/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/goblint-regression/28-race_reach_70-funloop_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-29289db [2021-06-05 12:10:14,720 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-05 12:10:14,722 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-05 12:10:14,752 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-05 12:10:14,752 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-05 12:10:14,755 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-05 12:10:14,756 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-05 12:10:14,760 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-05 12:10:14,762 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-05 12:10:14,765 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-05 12:10:14,765 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-05 12:10:14,766 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-05 12:10:14,767 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-05 12:10:14,768 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-05 12:10:14,769 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-05 12:10:14,770 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-05 12:10:14,772 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-05 12:10:14,772 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-05 12:10:14,774 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-05 12:10:14,778 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-05 12:10:14,779 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-05 12:10:14,779 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-05 12:10:14,780 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-05 12:10:14,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-05 12:10:14,786 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-05 12:10:14,786 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-05 12:10:14,786 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-05 12:10:14,788 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-05 12:10:14,788 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-05 12:10:14,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-05 12:10:14,788 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-05 12:10:14,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-05 12:10:14,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-05 12:10:14,790 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-05 12:10:14,791 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-05 12:10:14,791 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-05 12:10:14,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-05 12:10:14,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-05 12:10:14,792 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-05 12:10:14,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-05 12:10:14,792 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-05 12:10:14,793 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 12:10:14,826 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-05 12:10:14,827 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-05 12:10:14,827 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-06-05 12:10:14,827 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-06-05 12:10:14,829 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-05 12:10:14,829 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-05 12:10:14,829 INFO L138 SettingsManager]: * Use SBE=true [2021-06-05 12:10:14,830 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-05 12:10:14,830 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-05 12:10:14,830 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-05 12:10:14,830 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-05 12:10:14,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-05 12:10:14,831 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-05 12:10:14,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-05 12:10:14,831 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-05 12:10:14,831 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-05 12:10:14,831 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-05 12:10:14,831 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-05 12:10:14,831 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-05 12:10:14,831 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-05 12:10:14,831 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-05 12:10:14,831 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-05 12:10:14,832 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-05 12:10:14,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-05 12:10:14,832 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-05 12:10:14,832 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-05 12:10:14,832 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-05 12:10:14,832 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-05 12:10:14,832 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-05 12:10:14,832 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-05 12:10:14,832 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-05 12:10:14,833 INFO L138 SettingsManager]: * Check the insufficient thread errors last=true [2021-06-05 12:10:14,833 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 12:10:15,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-05 12:10:15,111 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-05 12:10:15,113 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-05 12:10:15,113 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-05 12:10:15,114 INFO L275 PluginConnector]: CDTParser initialized [2021-06-05 12:10:15,114 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2021-06-05 12:10:15,179 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b537498/17b1b6999eac4a5bad4b80eb39fb74f9/FLAG27c3497f6 [2021-06-05 12:10:15,547 INFO L306 CDTParser]: Found 1 translation units. [2021-06-05 12:10:15,548 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i [2021-06-05 12:10:15,561 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b537498/17b1b6999eac4a5bad4b80eb39fb74f9/FLAG27c3497f6 [2021-06-05 12:10:15,896 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64b537498/17b1b6999eac4a5bad4b80eb39fb74f9 [2021-06-05 12:10:15,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-05 12:10:15,899 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-05 12:10:15,902 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-05 12:10:15,902 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-05 12:10:15,904 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-05 12:10:15,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 12:10:15" (1/1) ... [2021-06-05 12:10:15,907 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34ea1f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:10:15, skipping insertion in model container [2021-06-05 12:10:15,907 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.06 12:10:15" (1/1) ... [2021-06-05 12:10:15,911 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-05 12:10:15,952 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-05 12:10:16,239 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i[41060,41073] [2021-06-05 12:10:16,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 12:10:16,264 INFO L203 MainTranslator]: Completed pre-run [2021-06-05 12:10:16,281 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_70-funloop_racefree.i[41060,41073] [2021-06-05 12:10:16,286 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-05 12:10:16,383 INFO L208 MainTranslator]: Completed translation [2021-06-05 12:10:16,384 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:10:16 WrapperNode [2021-06-05 12:10:16,384 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-05 12:10:16,384 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-05 12:10:16,385 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-05 12:10:16,385 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-05 12:10:16,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:10:16" (1/1) ... [2021-06-05 12:10:16,414 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:10:16" (1/1) ... [2021-06-05 12:10:16,438 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-05 12:10:16,439 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-05 12:10:16,439 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-05 12:10:16,439 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-05 12:10:16,445 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:10:16" (1/1) ... [2021-06-05 12:10:16,445 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:10:16" (1/1) ... [2021-06-05 12:10:16,459 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:10:16" (1/1) ... [2021-06-05 12:10:16,460 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:10:16" (1/1) ... [2021-06-05 12:10:16,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:10:16" (1/1) ... [2021-06-05 12:10:16,475 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:10:16" (1/1) ... [2021-06-05 12:10:16,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:10:16" (1/1) ... [2021-06-05 12:10:16,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-05 12:10:16,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-05 12:10:16,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-05 12:10:16,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-05 12:10:16,479 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:10:16" (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 12:10:16,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-05 12:10:16,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-05 12:10:16,549 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-06-05 12:10:16,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-05 12:10:16,550 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-06-05 12:10:16,551 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-06-05 12:10:16,551 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-06-05 12:10:16,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-05 12:10:16,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-05 12:10:16,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-05 12:10:16,552 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 12:10:16,923 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-05 12:10:16,923 INFO L299 CfgBuilder]: Removed 37 assume(true) statements. [2021-06-05 12:10:16,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 12:10:16 BoogieIcfgContainer [2021-06-05 12:10:16,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-05 12:10:16,925 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-05 12:10:16,925 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-05 12:10:16,927 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-05 12:10:16,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.06 12:10:15" (1/3) ... [2021-06-05 12:10:16,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52cc4ad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 12:10:16, skipping insertion in model container [2021-06-05 12:10:16,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.06 12:10:16" (2/3) ... [2021-06-05 12:10:16,928 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52cc4ad9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.06 12:10:16, skipping insertion in model container [2021-06-05 12:10:16,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.06 12:10:16" (3/3) ... [2021-06-05 12:10:16,929 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_70-funloop_racefree.i [2021-06-05 12:10:16,947 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-05 12:10:16,947 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-05 12:10:16,948 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-05 12:10:16,948 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-05 12:10:17,010 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,010 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,010 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,010 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,010 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,010 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,010 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,011 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,011 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,011 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,011 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,011 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,011 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,011 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,011 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,012 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,012 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,012 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,012 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,012 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,012 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,012 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,012 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,012 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,012 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,013 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,013 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,013 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,013 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,013 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,013 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,013 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,013 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,014 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,014 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,014 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,014 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,014 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,014 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,014 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,014 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,014 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,014 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,015 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,015 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,015 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,015 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,015 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,015 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,015 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,015 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,015 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,015 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,015 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,016 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,016 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,016 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,016 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,016 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,016 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,016 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,016 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,016 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,016 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,017 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,017 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,017 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,017 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,017 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,017 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,017 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,017 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,018 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,018 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,018 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,018 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,018 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,018 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,018 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,018 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,018 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,018 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,019 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,019 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,019 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,019 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,019 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,019 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,019 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,019 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,020 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,020 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,020 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,020 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,020 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,020 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,020 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,020 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,021 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,021 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,021 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,021 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,021 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,021 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,021 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,021 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,022 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,022 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,022 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,022 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,022 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,022 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,022 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,022 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,022 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,023 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,023 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,023 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,023 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,023 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,023 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,023 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,023 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,023 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,023 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,024 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,024 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,024 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,024 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,024 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,024 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,024 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,024 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,024 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,024 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,025 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,025 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,025 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,025 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,025 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,025 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,025 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,025 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,025 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,026 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,026 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,026 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,026 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,026 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,026 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,026 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,026 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,026 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,026 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,027 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,027 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,027 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,027 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,027 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,027 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,027 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,027 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,028 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,028 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,042 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,042 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,042 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,042 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,043 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,043 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,043 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,043 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,043 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,043 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,043 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,043 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,043 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,043 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,044 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,044 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,044 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,044 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,044 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,044 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,044 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,044 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:10:17,055 INFO L149 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2021-06-05 12:10:17,069 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-06-05 12:10:17,083 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:10:17,083 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:10:17,083 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:10:17,083 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:10:17,083 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:10:17,083 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:10:17,083 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:10:17,083 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 12:10:17,092 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 156 places, 186 transitions, 380 flow [2021-06-05 12:10:17,211 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3874 states, 3864 states have (on average 2.4309006211180124) internal successors, (9393), 3873 states have internal predecessors, (9393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:17,221 INFO L276 IsEmpty]: Start isEmpty. Operand has 3874 states, 3864 states have (on average 2.4309006211180124) internal successors, (9393), 3873 states have internal predecessors, (9393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:17,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-06-05 12:10:17,235 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:17,236 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] [2021-06-05 12:10:17,240 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:17,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:17,247 INFO L82 PathProgramCache]: Analyzing trace with hash 2023168462, now seen corresponding path program 1 times [2021-06-05 12:10:17,252 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:17,253 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990912544] [2021-06-05 12:10:17,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:17,429 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 12:10:17,430 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:17,430 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990912544] [2021-06-05 12:10:17,430 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990912544] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:10:17,431 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:10:17,431 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 12:10:17,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554989744] [2021-06-05 12:10:17,434 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 12:10:17,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:17,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 12:10:17,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:10:17,454 INFO L87 Difference]: Start difference. First operand has 3874 states, 3864 states have (on average 2.4309006211180124) internal successors, (9393), 3873 states have internal predecessors, (9393), 0 states have call successors, (0), 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 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:17,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:10:17,498 INFO L93 Difference]: Finished difference Result 3750 states and 7533 transitions. [2021-06-05 12:10:17,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 12:10:17,499 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-06-05 12:10:17,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:10:17,525 INFO L225 Difference]: With dead ends: 3750 [2021-06-05 12:10:17,526 INFO L226 Difference]: Without dead ends: 3691 [2021-06-05 12:10:17,528 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 12:10:17,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3691 states. [2021-06-05 12:10:17,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3691 to 3691. [2021-06-05 12:10:17,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3691 states, 3685 states have (on average 2.015739484396201) internal successors, (7428), 3690 states have internal predecessors, (7428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:17,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3691 states to 3691 states and 7428 transitions. [2021-06-05 12:10:17,704 INFO L78 Accepts]: Start accepts. Automaton has 3691 states and 7428 transitions. Word has length 41 [2021-06-05 12:10:17,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:10:17,705 INFO L482 AbstractCegarLoop]: Abstraction has 3691 states and 7428 transitions. [2021-06-05 12:10:17,705 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:17,706 INFO L276 IsEmpty]: Start isEmpty. Operand 3691 states and 7428 transitions. [2021-06-05 12:10:17,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-06-05 12:10:17,708 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:17,709 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] [2021-06-05 12:10:17,709 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-05 12:10:17,709 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:17,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:17,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1871506224, now seen corresponding path program 1 times [2021-06-05 12:10:17,711 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:17,712 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636305107] [2021-06-05 12:10:17,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:17,770 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 12:10:17,771 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:17,771 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636305107] [2021-06-05 12:10:17,771 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636305107] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:10:17,771 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:10:17,771 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 12:10:17,771 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413082608] [2021-06-05 12:10:17,772 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:10:17,772 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:17,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:10:17,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:10:17,773 INFO L87 Difference]: Start difference. First operand 3691 states and 7428 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:17,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:10:17,799 INFO L93 Difference]: Finished difference Result 3695 states and 7432 transitions. [2021-06-05 12:10:17,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:10:17,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-06-05 12:10:17,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:10:17,810 INFO L225 Difference]: With dead ends: 3695 [2021-06-05 12:10:17,810 INFO L226 Difference]: Without dead ends: 3695 [2021-06-05 12:10:17,810 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:10:17,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3695 states. [2021-06-05 12:10:17,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3695 to 3692. [2021-06-05 12:10:17,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3692 states, 3686 states have (on average 2.015463917525773) internal successors, (7429), 3691 states have internal predecessors, (7429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:17,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3692 states to 3692 states and 7429 transitions. [2021-06-05 12:10:17,898 INFO L78 Accepts]: Start accepts. Automaton has 3692 states and 7429 transitions. Word has length 41 [2021-06-05 12:10:17,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:10:17,898 INFO L482 AbstractCegarLoop]: Abstraction has 3692 states and 7429 transitions. [2021-06-05 12:10:17,899 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:17,899 INFO L276 IsEmpty]: Start isEmpty. Operand 3692 states and 7429 transitions. [2021-06-05 12:10:17,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-06-05 12:10:17,899 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:17,900 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] [2021-06-05 12:10:17,900 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-05 12:10:17,900 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:17,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:17,900 INFO L82 PathProgramCache]: Analyzing trace with hash -416118304, now seen corresponding path program 1 times [2021-06-05 12:10:17,900 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:17,900 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279057748] [2021-06-05 12:10:17,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:17,968 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:10:17,968 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:17,968 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279057748] [2021-06-05 12:10:17,968 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279057748] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:17,968 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675556266] [2021-06-05 12:10:17,968 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 12:10:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:18,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2021-06-05 12:10:18,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:10:18,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:10:18,266 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675556266] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:10:18,266 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:10:18,266 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-06-05 12:10:18,266 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088764423] [2021-06-05 12:10:18,266 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:10:18,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:18,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:10:18,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:10:18,269 INFO L87 Difference]: Start difference. First operand 3692 states and 7429 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:18,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:10:18,305 INFO L93 Difference]: Finished difference Result 3644 states and 7379 transitions. [2021-06-05 12:10:18,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:10:18,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-06-05 12:10:18,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:10:18,316 INFO L225 Difference]: With dead ends: 3644 [2021-06-05 12:10:18,316 INFO L226 Difference]: Without dead ends: 3644 [2021-06-05 12:10:18,316 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 25.3ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:10:18,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3644 states. [2021-06-05 12:10:18,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3644 to 3644. [2021-06-05 12:10:18,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3644 states, 3639 states have (on average 2.0277548777136576) internal successors, (7379), 3643 states have internal predecessors, (7379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:18,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3644 states to 3644 states and 7379 transitions. [2021-06-05 12:10:18,411 INFO L78 Accepts]: Start accepts. Automaton has 3644 states and 7379 transitions. Word has length 46 [2021-06-05 12:10:18,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:10:18,412 INFO L482 AbstractCegarLoop]: Abstraction has 3644 states and 7379 transitions. [2021-06-05 12:10:18,412 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:18,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3644 states and 7379 transitions. [2021-06-05 12:10:18,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-06-05 12:10:18,413 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:18,414 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] [2021-06-05 12:10:18,625 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-06-05 12:10:18,625 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:18,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:18,626 INFO L82 PathProgramCache]: Analyzing trace with hash -147585648, now seen corresponding path program 1 times [2021-06-05 12:10:18,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:18,626 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084655613] [2021-06-05 12:10:18,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:18,661 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:10:18,662 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:18,662 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084655613] [2021-06-05 12:10:18,662 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084655613] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:18,662 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957997486] [2021-06-05 12:10:18,662 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 12:10:18,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:18,771 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:10:18,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:10:18,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:10:18,915 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957997486] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:18,915 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:10:18,916 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:10:18,918 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040197617] [2021-06-05 12:10:18,919 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:10:18,919 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:18,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:10:18,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:10:18,919 INFO L87 Difference]: Start difference. First operand 3644 states and 7379 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 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 12:10:18,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:10:18,962 INFO L93 Difference]: Finished difference Result 3652 states and 7387 transitions. [2021-06-05 12:10:18,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:10:18,963 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 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 52 [2021-06-05 12:10:18,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:10:18,973 INFO L225 Difference]: With dead ends: 3652 [2021-06-05 12:10:18,974 INFO L226 Difference]: Without dead ends: 3652 [2021-06-05 12:10:18,974 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 25.9ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:10:19,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3652 states. [2021-06-05 12:10:19,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3652 to 3649. [2021-06-05 12:10:19,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3649 states, 3644 states have (on average 2.026344676180022) internal successors, (7384), 3648 states have internal predecessors, (7384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:19,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3649 states to 3649 states and 7384 transitions. [2021-06-05 12:10:19,060 INFO L78 Accepts]: Start accepts. Automaton has 3649 states and 7384 transitions. Word has length 52 [2021-06-05 12:10:19,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:10:19,061 INFO L482 AbstractCegarLoop]: Abstraction has 3649 states and 7384 transitions. [2021-06-05 12:10:19,061 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 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 12:10:19,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3649 states and 7384 transitions. [2021-06-05 12:10:19,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-06-05 12:10:19,062 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:19,063 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 12:10:19,279 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:10:19,280 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:19,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:19,280 INFO L82 PathProgramCache]: Analyzing trace with hash -289159552, now seen corresponding path program 2 times [2021-06-05 12:10:19,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:19,280 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084464626] [2021-06-05 12:10:19,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:19,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:19,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:10:19,334 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:19,334 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084464626] [2021-06-05 12:10:19,334 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084464626] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:19,334 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192006636] [2021-06-05 12:10:19,334 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:10:19,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 12:10:19,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:10:19,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 12:10:19,414 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:10:19,453 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 12:10:19,455 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:19,456 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:19,456 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:19,456 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:10:19,472 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 7 treesize of output 6 [2021-06-05 12:10:19,473 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:19,476 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:19,476 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:19,476 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:10:19,525 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:10:19,525 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 12:10:19,527 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:19,530 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:19,530 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:19,531 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:10:19,562 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:10:19,566 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 12 treesize of output 11 [2021-06-05 12:10:19,566 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:19,584 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:19,585 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:19,590 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:19,594 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 12:10:19,594 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:10:19,660 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 14 treesize of output 10 [2021-06-05 12:10:19,662 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:19,663 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:19,664 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 12:10:19,664 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:10:19,725 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 12:10:19,725 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192006636] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:10:19,725 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:10:19,725 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2021-06-05 12:10:19,727 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011430315] [2021-06-05 12:10:19,728 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:10:19,728 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:19,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:10:19,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 12:10:19,729 INFO L87 Difference]: Start difference. First operand 3649 states and 7384 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:20,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:10:20,541 INFO L93 Difference]: Finished difference Result 10795 states and 21826 transitions. [2021-06-05 12:10:20,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-06-05 12:10:20,542 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-06-05 12:10:20,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:10:20,567 INFO L225 Difference]: With dead ends: 10795 [2021-06-05 12:10:20,568 INFO L226 Difference]: Without dead ends: 10795 [2021-06-05 12:10:20,568 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 462.7ms TimeCoverageRelationStatistics Valid=389, Invalid=1503, Unknown=0, NotChecked=0, Total=1892 [2021-06-05 12:10:20,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10795 states. [2021-06-05 12:10:20,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10795 to 5354. [2021-06-05 12:10:20,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5354 states, 5349 states have (on average 2.0396335763694147) internal successors, (10910), 5353 states have internal predecessors, (10910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:20,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5354 states to 5354 states and 10910 transitions. [2021-06-05 12:10:20,706 INFO L78 Accepts]: Start accepts. Automaton has 5354 states and 10910 transitions. Word has length 57 [2021-06-05 12:10:20,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:10:20,706 INFO L482 AbstractCegarLoop]: Abstraction has 5354 states and 10910 transitions. [2021-06-05 12:10:20,707 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:20,707 INFO L276 IsEmpty]: Start isEmpty. Operand 5354 states and 10910 transitions. [2021-06-05 12:10:20,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 12:10:20,708 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:20,709 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 12:10:20,927 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:10:20,927 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:20,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:20,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1519758725, now seen corresponding path program 1 times [2021-06-05 12:10:20,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:20,928 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310941446] [2021-06-05 12:10:20,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:20,966 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 12:10:20,966 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:20,966 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310941446] [2021-06-05 12:10:20,967 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310941446] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:20,967 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255713057] [2021-06-05 12:10:20,967 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 12:10:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:21,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:10:21,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:10:21,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:10:21,163 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255713057] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:21,163 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:10:21,163 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2021-06-05 12:10:21,164 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454323553] [2021-06-05 12:10:21,164 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 12:10:21,165 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:21,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 12:10:21,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 12:10:21,165 INFO L87 Difference]: Start difference. First operand 5354 states and 10910 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 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 12:10:21,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:10:21,264 INFO L93 Difference]: Finished difference Result 905 states and 1707 transitions. [2021-06-05 12:10:21,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 12:10:21,264 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 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 61 [2021-06-05 12:10:21,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:10:21,267 INFO L225 Difference]: With dead ends: 905 [2021-06-05 12:10:21,267 INFO L226 Difference]: Without dead ends: 887 [2021-06-05 12:10:21,267 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 61.6ms TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-06-05 12:10:21,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2021-06-05 12:10:21,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 884. [2021-06-05 12:10:21,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 883 states have (on average 1.8856172140430352) internal successors, (1665), 883 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:21,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1665 transitions. [2021-06-05 12:10:21,280 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1665 transitions. Word has length 61 [2021-06-05 12:10:21,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:10:21,280 INFO L482 AbstractCegarLoop]: Abstraction has 884 states and 1665 transitions. [2021-06-05 12:10:21,280 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 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 12:10:21,280 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1665 transitions. [2021-06-05 12:10:21,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 12:10:21,281 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:21,281 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:10:21,494 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:10:21,497 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:21,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:21,497 INFO L82 PathProgramCache]: Analyzing trace with hash 391107484, now seen corresponding path program 1 times [2021-06-05 12:10:21,497 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:21,497 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636222271] [2021-06-05 12:10:21,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:21,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:21,557 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:10:21,557 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:21,557 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636222271] [2021-06-05 12:10:21,557 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636222271] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:21,557 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117601598] [2021-06-05 12:10:21,557 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 12:10:21,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:21,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 12:10:21,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:10:21,718 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:10:21,718 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117601598] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:21,718 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:10:21,718 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-06-05 12:10:21,718 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311829416] [2021-06-05 12:10:21,719 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:10:21,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:21,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:10:21,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:10:21,719 INFO L87 Difference]: Start difference. First operand 884 states and 1665 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:21,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:10:21,781 INFO L93 Difference]: Finished difference Result 892 states and 1673 transitions. [2021-06-05 12:10:21,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 12:10:21,781 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-06-05 12:10:21,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:10:21,782 INFO L225 Difference]: With dead ends: 892 [2021-06-05 12:10:21,782 INFO L226 Difference]: Without dead ends: 892 [2021-06-05 12:10:21,783 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 58.3ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:10:21,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2021-06-05 12:10:21,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 889. [2021-06-05 12:10:21,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 888 states have (on average 1.8806306306306306) internal successors, (1670), 888 states have internal predecessors, (1670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:21,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1670 transitions. [2021-06-05 12:10:21,793 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1670 transitions. Word has length 71 [2021-06-05 12:10:21,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:10:21,793 INFO L482 AbstractCegarLoop]: Abstraction has 889 states and 1670 transitions. [2021-06-05 12:10:21,793 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:21,794 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1670 transitions. [2021-06-05 12:10:21,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-05 12:10:21,794 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:21,794 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:10:22,008 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-06-05 12:10:22,009 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:22,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:22,009 INFO L82 PathProgramCache]: Analyzing trace with hash 132189356, now seen corresponding path program 2 times [2021-06-05 12:10:22,009 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:22,009 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823332873] [2021-06-05 12:10:22,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:22,117 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:10:22,118 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:22,118 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823332873] [2021-06-05 12:10:22,118 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823332873] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:22,118 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785926288] [2021-06-05 12:10:22,118 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:10:22,220 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:10:22,221 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:10:22,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 12:10:22,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:10:22,345 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:10:22,345 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785926288] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:22,346 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:10:22,346 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-06-05 12:10:22,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906901234] [2021-06-05 12:10:22,346 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:10:22,346 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:22,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:10:22,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:10:22,347 INFO L87 Difference]: Start difference. First operand 889 states and 1670 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:22,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:10:22,442 INFO L93 Difference]: Finished difference Result 897 states and 1678 transitions. [2021-06-05 12:10:22,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 12:10:22,443 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-06-05 12:10:22,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:10:22,444 INFO L225 Difference]: With dead ends: 897 [2021-06-05 12:10:22,444 INFO L226 Difference]: Without dead ends: 897 [2021-06-05 12:10:22,444 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 112.7ms TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:10:22,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2021-06-05 12:10:22,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 894. [2021-06-05 12:10:22,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 893 states have (on average 1.8756998880179172) internal successors, (1675), 893 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:22,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1675 transitions. [2021-06-05 12:10:22,455 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1675 transitions. Word has length 76 [2021-06-05 12:10:22,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:10:22,455 INFO L482 AbstractCegarLoop]: Abstraction has 894 states and 1675 transitions. [2021-06-05 12:10:22,455 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:22,455 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1675 transitions. [2021-06-05 12:10:22,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-06-05 12:10:22,456 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:22,456 INFO L521 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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] [2021-06-05 12:10:22,668 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:10:22,669 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:22,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:22,669 INFO L82 PathProgramCache]: Analyzing trace with hash 695795100, now seen corresponding path program 3 times [2021-06-05 12:10:22,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:22,669 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673112070] [2021-06-05 12:10:22,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:22,767 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:10:22,767 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:22,767 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673112070] [2021-06-05 12:10:22,767 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673112070] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:22,767 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777608663] [2021-06-05 12:10:22,767 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 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 12:10:22,827 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 12:10:22,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:10:22,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 15 conjunts are in the unsatisfiable core [2021-06-05 12:10:22,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:10:22,852 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 12:10:22,853 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:22,854 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:22,854 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:22,854 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:10:22,866 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 7 treesize of output 6 [2021-06-05 12:10:22,867 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:22,870 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:22,870 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:22,870 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:10:22,932 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:10:22,933 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 12:10:22,934 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:22,937 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:22,937 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:22,938 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:10:22,969 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:10:22,973 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 12 treesize of output 11 [2021-06-05 12:10:22,974 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:22,977 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:22,977 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:22,981 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:22,982 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 12:10:22,982 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:10:23,059 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:10:23,063 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:10:23,064 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:23,067 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:23,068 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:23,071 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:23,073 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 12:10:23,073 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:10:23,088 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 14 treesize of output 10 [2021-06-05 12:10:23,089 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:23,090 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:23,091 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 12:10:23,091 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:10:23,131 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-06-05 12:10:23,131 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777608663] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:23,132 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:10:23,132 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2021-06-05 12:10:23,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904910823] [2021-06-05 12:10:23,132 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 12:10:23,132 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:23,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 12:10:23,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2021-06-05 12:10:23,133 INFO L87 Difference]: Start difference. First operand 894 states and 1675 transitions. Second operand has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 22 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:23,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:10:23,781 INFO L93 Difference]: Finished difference Result 1674 states and 3169 transitions. [2021-06-05 12:10:23,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 12:10:23,781 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 22 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-06-05 12:10:23,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:10:23,783 INFO L225 Difference]: With dead ends: 1674 [2021-06-05 12:10:23,783 INFO L226 Difference]: Without dead ends: 1674 [2021-06-05 12:10:23,784 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 510.1ms TimeCoverageRelationStatistics Valid=419, Invalid=1837, Unknown=0, NotChecked=0, Total=2256 [2021-06-05 12:10:23,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1674 states. [2021-06-05 12:10:23,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1674 to 871. [2021-06-05 12:10:23,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 870 states have (on average 1.8781609195402298) internal successors, (1634), 870 states have internal predecessors, (1634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:23,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1634 transitions. [2021-06-05 12:10:23,797 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1634 transitions. Word has length 81 [2021-06-05 12:10:23,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:10:23,797 INFO L482 AbstractCegarLoop]: Abstraction has 871 states and 1634 transitions. [2021-06-05 12:10:23,798 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 22 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:23,798 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1634 transitions. [2021-06-05 12:10:23,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-06-05 12:10:23,799 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:23,799 INFO L521 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:10:24,004 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:10:24,005 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:24,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:24,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1816148880, now seen corresponding path program 1 times [2021-06-05 12:10:24,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:24,005 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695466425] [2021-06-05 12:10:24,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:24,114 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 12:10:24,115 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:24,115 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695466425] [2021-06-05 12:10:24,115 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695466425] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:24,115 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869180596] [2021-06-05 12:10:24,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:10:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:24,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 12:10:24,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:10:24,325 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 12:10:24,326 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869180596] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:24,326 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:10:24,326 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2021-06-05 12:10:24,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039405585] [2021-06-05 12:10:24,326 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 12:10:24,326 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:24,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 12:10:24,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:10:24,327 INFO L87 Difference]: Start difference. First operand 871 states and 1634 transitions. Second operand has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:24,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:10:24,497 INFO L93 Difference]: Finished difference Result 879 states and 1642 transitions. [2021-06-05 12:10:24,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 12:10:24,497 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-06-05 12:10:24,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:10:24,498 INFO L225 Difference]: With dead ends: 879 [2021-06-05 12:10:24,498 INFO L226 Difference]: Without dead ends: 879 [2021-06-05 12:10:24,499 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 173.4ms TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2021-06-05 12:10:24,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2021-06-05 12:10:24,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 876. [2021-06-05 12:10:24,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 875 states have (on average 1.8731428571428572) internal successors, (1639), 875 states have internal predecessors, (1639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:24,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1639 transitions. [2021-06-05 12:10:24,514 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1639 transitions. Word has length 111 [2021-06-05 12:10:24,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:10:24,514 INFO L482 AbstractCegarLoop]: Abstraction has 876 states and 1639 transitions. [2021-06-05 12:10:24,514 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 6.411764705882353) internal successors, (109), 17 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:24,515 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1639 transitions. [2021-06-05 12:10:24,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-06-05 12:10:24,517 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:24,517 INFO L521 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:10:24,733 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-06-05 12:10:24,734 INFO L430 AbstractCegarLoop]: === Iteration 11 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:24,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:24,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1390849408, now seen corresponding path program 2 times [2021-06-05 12:10:24,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:24,734 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426668534] [2021-06-05 12:10:24,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:24,853 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 12:10:24,853 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:24,853 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426668534] [2021-06-05 12:10:24,853 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426668534] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:24,853 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130167306] [2021-06-05 12:10:24,854 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:10:24,936 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:10:24,936 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:10:24,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 12:10:24,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:10:25,125 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 12:10:25,125 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130167306] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:25,125 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:10:25,126 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2021-06-05 12:10:25,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162546257] [2021-06-05 12:10:25,126 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 12:10:25,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:25,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 12:10:25,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-06-05 12:10:25,127 INFO L87 Difference]: Start difference. First operand 876 states and 1639 transitions. Second operand has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 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 12:10:25,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:10:25,289 INFO L93 Difference]: Finished difference Result 884 states and 1647 transitions. [2021-06-05 12:10:25,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 12:10:25,290 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 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 116 [2021-06-05 12:10:25,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:10:25,291 INFO L225 Difference]: With dead ends: 884 [2021-06-05 12:10:25,291 INFO L226 Difference]: Without dead ends: 884 [2021-06-05 12:10:25,291 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 193.2ms TimeCoverageRelationStatistics Valid=340, Invalid=716, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 12:10:25,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2021-06-05 12:10:25,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 881. [2021-06-05 12:10:25,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 880 states have (on average 1.8681818181818182) internal successors, (1644), 880 states have internal predecessors, (1644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:25,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1644 transitions. [2021-06-05 12:10:25,309 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1644 transitions. Word has length 116 [2021-06-05 12:10:25,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:10:25,309 INFO L482 AbstractCegarLoop]: Abstraction has 881 states and 1644 transitions. [2021-06-05 12:10:25,309 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 6.0) internal successors, (114), 19 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 12:10:25,309 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1644 transitions. [2021-06-05 12:10:25,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-06-05 12:10:25,310 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:25,310 INFO L521 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:10:25,541 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:10:25,543 INFO L430 AbstractCegarLoop]: === Iteration 12 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:25,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:25,543 INFO L82 PathProgramCache]: Analyzing trace with hash -805900688, now seen corresponding path program 3 times [2021-06-05 12:10:25,544 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:25,544 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791243002] [2021-06-05 12:10:25,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-06-05 12:10:25,682 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:25,682 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791243002] [2021-06-05 12:10:25,682 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791243002] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:25,682 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864637690] [2021-06-05 12:10:25,682 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:10:25,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 12:10:25,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:10:25,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 12:10:25,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:10:25,783 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 12:10:25,784 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:25,785 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:25,786 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:25,786 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:10:25,799 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 7 treesize of output 6 [2021-06-05 12:10:25,800 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:25,802 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:25,803 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:25,803 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:10:25,876 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:10:25,876 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 12:10:25,879 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:25,882 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:25,882 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:25,883 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:10:25,915 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:10:25,919 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 12 treesize of output 11 [2021-06-05 12:10:25,919 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:25,922 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:25,924 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:25,927 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:25,929 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 12:10:25,929 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:10:26,039 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2021-06-05 12:10:26,040 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:26,042 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:26,043 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:26,043 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:18 [2021-06-05 12:10:26,112 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2021-06-05 12:10:26,113 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:26,114 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:26,115 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:10:26,115 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:12 [2021-06-05 12:10:26,185 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 14 treesize of output 10 [2021-06-05 12:10:26,186 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:26,190 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:26,191 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 12:10:26,191 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:10:26,273 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2021-06-05 12:10:26,273 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864637690] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:26,273 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:10:26,273 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2021-06-05 12:10:26,273 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925935211] [2021-06-05 12:10:26,274 INFO L462 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-06-05 12:10:26,274 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:26,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-06-05 12:10:26,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1044, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 12:10:26,275 INFO L87 Difference]: Start difference. First operand 881 states and 1644 transitions. Second operand has 35 states, 35 states have (on average 5.285714285714286) internal successors, (185), 35 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:28,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:10:28,080 INFO L93 Difference]: Finished difference Result 1884 states and 3499 transitions. [2021-06-05 12:10:28,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-06-05 12:10:28,083 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 5.285714285714286) internal successors, (185), 35 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2021-06-05 12:10:28,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:10:28,085 INFO L225 Difference]: With dead ends: 1884 [2021-06-05 12:10:28,085 INFO L226 Difference]: Without dead ends: 1590 [2021-06-05 12:10:28,090 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2426 ImplicationChecksByTransitivity, 1496.6ms TimeCoverageRelationStatistics Valid=1233, Invalid=7887, Unknown=0, NotChecked=0, Total=9120 [2021-06-05 12:10:28,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2021-06-05 12:10:28,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 885. [2021-06-05 12:10:28,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 1.8484162895927603) internal successors, (1634), 884 states have internal predecessors, (1634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:28,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1634 transitions. [2021-06-05 12:10:28,103 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1634 transitions. Word has length 121 [2021-06-05 12:10:28,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:10:28,103 INFO L482 AbstractCegarLoop]: Abstraction has 885 states and 1634 transitions. [2021-06-05 12:10:28,104 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 35 states, 35 states have (on average 5.285714285714286) internal successors, (185), 35 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:28,104 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1634 transitions. [2021-06-05 12:10:28,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-06-05 12:10:28,105 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:28,105 INFO L521 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:10:28,320 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:10:28,320 INFO L430 AbstractCegarLoop]: === Iteration 13 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:28,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:28,320 INFO L82 PathProgramCache]: Analyzing trace with hash -1870815112, now seen corresponding path program 1 times [2021-06-05 12:10:28,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:28,321 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592462419] [2021-06-05 12:10:28,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:28,499 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-06-05 12:10:28,499 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:28,499 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592462419] [2021-06-05 12:10:28,499 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592462419] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:28,499 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778676522] [2021-06-05 12:10:28,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 12:10:28,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:28,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 12:10:28,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:10:28,747 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-06-05 12:10:28,747 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778676522] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:28,747 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:10:28,747 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2021-06-05 12:10:28,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458420162] [2021-06-05 12:10:28,748 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 12:10:28,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:28,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 12:10:28,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2021-06-05 12:10:28,748 INFO L87 Difference]: Start difference. First operand 885 states and 1634 transitions. Second operand has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 23 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:28,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:10:28,964 INFO L93 Difference]: Finished difference Result 890 states and 1639 transitions. [2021-06-05 12:10:28,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 12:10:28,966 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 23 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2021-06-05 12:10:28,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:10:28,967 INFO L225 Difference]: With dead ends: 890 [2021-06-05 12:10:28,967 INFO L226 Difference]: Without dead ends: 890 [2021-06-05 12:10:28,968 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 280.1ms TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 12:10:28,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2021-06-05 12:10:28,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 890. [2021-06-05 12:10:28,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 889 states have (on average 1.843644544431946) internal successors, (1639), 889 states have internal predecessors, (1639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:28,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1639 transitions. [2021-06-05 12:10:28,978 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1639 transitions. Word has length 135 [2021-06-05 12:10:28,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:10:28,978 INFO L482 AbstractCegarLoop]: Abstraction has 890 states and 1639 transitions. [2021-06-05 12:10:28,978 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 5.608695652173913) internal successors, (129), 23 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:28,978 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1639 transitions. [2021-06-05 12:10:28,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-06-05 12:10:28,979 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:10:28,979 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:10:29,192 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-06-05 12:10:29,193 INFO L430 AbstractCegarLoop]: === Iteration 14 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:10:29,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:10:29,193 INFO L82 PathProgramCache]: Analyzing trace with hash -155297400, now seen corresponding path program 2 times [2021-06-05 12:10:29,193 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:10:29,193 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676378178] [2021-06-05 12:10:29,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:10:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:10:29,542 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:10:29,543 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:10:29,543 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676378178] [2021-06-05 12:10:29,543 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676378178] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:29,543 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [514257095] [2021-06-05 12:10:29,543 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 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 12:10:29,640 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:10:29,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:10:29,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 27 conjunts are in the unsatisfiable core [2021-06-05 12:10:29,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:10:29,674 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 12:10:29,675 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:29,676 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:29,677 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:29,677 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:10:29,682 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:10:29,682 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:29,685 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:29,685 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:29,686 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:10:29,763 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:10:29,764 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 12:10:29,765 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:29,767 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:29,768 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:29,768 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:10:29,779 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:10:29,782 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 12 treesize of output 11 [2021-06-05 12:10:29,783 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:29,786 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:29,786 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:29,790 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:29,791 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 12:10:29,791 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:10:29,879 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2021-06-05 12:10:29,879 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:29,884 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:29,886 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:10:29,886 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2021-06-05 12:10:30,883 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2021-06-05 12:10:30,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2021-06-05 12:10:30,906 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 12 treesize of output 11 [2021-06-05 12:10:30,907 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:30,911 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:30,911 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:10:30,918 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:30,921 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:10:30,921 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:41, output treesize:22 [2021-06-05 12:10:32,128 WARN L205 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2021-06-05 12:10:32,179 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2021-06-05 12:10:32,181 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:32,184 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:32,186 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 12:10:32,186 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:19 [2021-06-05 12:10:32,617 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (t_funThread1of1ForFork0_cache_entry_addref_~entry.offset Int)) (and (<= t_funThread1of1ForFork0_cache_entry_addref_~entry.offset (+ |c_~#cache~0.offset| (* 28 c_t_funThread1of1ForFork0_~i~0))) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) t_funThread1of1ForFork0_cache_entry_addref_~entry.offset (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))))) is different from true [2021-06-05 12:10:33,307 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int)) (and (<= aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 |c_t_funThread1of1ForFork0_#t~post43|) (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_~#cache~0.offset|) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))))) is different from true [2021-06-05 12:10:33,919 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int)) (and (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (select |c_#memory_int| |c_~#cache~0.base|) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_~#cache~0.offset|) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 1) c_t_funThread1of1ForFork0_~i~0))) is different from true [2021-06-05 12:10:34,407 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_div_~#cache~0.offset_103| Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_mod_~#cache~0.offset_103| Int)) (and (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (< |aux_mod_~#cache~0.offset_103| 28) (<= 0 |aux_mod_~#cache~0.offset_103|) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (= (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* |aux_div_~#cache~0.offset_103| (- 28)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| (* |aux_mod_~#cache~0.offset_103| (- 1))) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1))) (select |c_#memory_int| |c_t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base|)) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 1) |aux_div_~#cache~0.offset_103|))) is different from true [2021-06-05 12:10:35,008 WARN L860 $PredicateComparison]: unable to prove that (exists ((|t_funThread1of1ForFork0_cache_entry_addref_#t~post40| Int) (aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|aux_div_~#cache~0.offset_103| Int) (aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 Int) (|t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| Int) (|aux_mod_~#cache~0.offset_103| Int)) (and (= (select |c_#memory_int| c_t_funThread1of1ForFork0_cache_entry_addref_~entry.base) (store ((as const (Array Int Int)) 0) (+ (* aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 (- 1)) (* |aux_div_~#cache~0.offset_103| (- 28)) (* aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| (* |aux_mod_~#cache~0.offset_103| (- 1))) (+ |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| (- 1)))) (< aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 28) (<= |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| c_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset) (< |aux_mod_~#cache~0.offset_103| 28) (<= 0 |aux_mod_~#cache~0.offset_103|) (<= 0 aux_mod_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102) (<= (+ aux_div_t_funThread1of1ForFork0_cache_entry_addref_~entry.offset_102 1) |aux_div_~#cache~0.offset_103|))) is different from true [2021-06-05 12:10:35,192 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 32 treesize of output 28 [2021-06-05 12:10:35,193 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:10:35,202 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:10:35,211 INFO L550 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 1 xjuncts. [2021-06-05 12:10:35,211 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:52, output treesize:45 [2021-06-05 12:10:35,269 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 8 not checked. [2021-06-05 12:10:35,270 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [514257095] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:10:35,270 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:10:35,270 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 29 [2021-06-05 12:10:35,270 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765587861] [2021-06-05 12:10:35,270 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-06-05 12:10:35,270 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:10:35,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-06-05 12:10:35,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=462, Unknown=10, NotChecked=240, Total=812 [2021-06-05 12:10:35,271 INFO L87 Difference]: Start difference. First operand 890 states and 1639 transitions. Second operand has 29 states, 29 states have (on average 5.275862068965517) internal successors, (153), 29 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:10:35,897 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 28 [2021-06-05 12:10:38,330 WARN L205 SmtUtils]: Spent 416.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2021-06-05 12:10:49,452 WARN L205 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 64 DAG size of output: 54 [2021-06-05 12:11:01,334 WARN L205 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2021-06-05 12:11:10,978 WARN L205 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 29 [2021-06-05 12:11:16,646 WARN L205 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 67 DAG size of output: 54 [2021-06-05 12:11:32,861 WARN L205 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2021-06-05 12:11:38,998 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2021-06-05 12:12:00,989 WARN L205 SmtUtils]: Spent 766.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-06-05 12:12:13,680 WARN L205 SmtUtils]: Spent 1.67 s on a formula simplification. DAG size of input: 48 DAG size of output: 33 [2021-06-05 12:12:27,692 WARN L205 SmtUtils]: Spent 2.91 s on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2021-06-05 12:12:52,595 WARN L205 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 77 DAG size of output: 75 [2021-06-05 12:12:52,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:12:52,801 INFO L93 Difference]: Finished difference Result 3426 states and 6532 transitions. [2021-06-05 12:12:52,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2021-06-05 12:12:52,802 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 5.275862068965517) internal successors, (153), 29 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2021-06-05 12:12:52,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:12:52,806 INFO L225 Difference]: With dead ends: 3426 [2021-06-05 12:12:52,806 INFO L226 Difference]: Without dead ends: 3426 [2021-06-05 12:12:52,807 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 131 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1484 ImplicationChecksByTransitivity, 130654.9ms TimeCoverageRelationStatistics Valid=945, Invalid=3926, Unknown=119, NotChecked=710, Total=5700 [2021-06-05 12:12:52,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3426 states. [2021-06-05 12:12:52,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3426 to 1348. [2021-06-05 12:12:52,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1347 states have (on average 1.8708240534521159) internal successors, (2520), 1347 states have internal predecessors, (2520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:52,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2520 transitions. [2021-06-05 12:12:52,828 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 2520 transitions. Word has length 140 [2021-06-05 12:12:52,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:12:52,828 INFO L482 AbstractCegarLoop]: Abstraction has 1348 states and 2520 transitions. [2021-06-05 12:12:52,828 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 5.275862068965517) internal successors, (153), 29 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:12:52,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 2520 transitions. [2021-06-05 12:12:52,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-06-05 12:12:52,830 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:12:52,830 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:12:53,044 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-06-05 12:12:53,045 INFO L430 AbstractCegarLoop]: === Iteration 15 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:12:53,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:12:53,045 INFO L82 PathProgramCache]: Analyzing trace with hash -584221382, now seen corresponding path program 3 times [2021-06-05 12:12:53,045 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:12:53,045 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594374176] [2021-06-05 12:12:53,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:12:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:12:53,505 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:12:53,505 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:12:53,505 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594374176] [2021-06-05 12:12:53,506 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594374176] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:53,506 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592998595] [2021-06-05 12:12:53,506 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 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 12:12:53,597 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 12:12:53,597 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:12:53,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 35 conjunts are in the unsatisfiable core [2021-06-05 12:12:53,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:12:53,617 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 12:12:53,618 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:53,620 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:53,621 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:53,621 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 12:12:53,662 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 7 treesize of output 6 [2021-06-05 12:12:53,663 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:53,667 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:53,667 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:53,667 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2021-06-05 12:12:53,768 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:12:53,769 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 12:12:53,770 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:53,774 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:53,774 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:53,775 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2021-06-05 12:12:53,801 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:12:53,804 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 12 treesize of output 11 [2021-06-05 12:12:53,805 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:53,808 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:53,809 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:53,814 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:53,815 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 12:12:53,815 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:14 [2021-06-05 12:12:53,927 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2021-06-05 12:12:53,928 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:53,937 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:53,938 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:12:53,939 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2021-06-05 12:12:54,559 WARN L205 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2021-06-05 12:12:54,597 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 33 treesize of output 28 [2021-06-05 12:12:54,598 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:54,604 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:54,605 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 12:12:54,605 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:26 [2021-06-05 12:12:55,268 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2021-06-05 12:12:55,642 WARN L205 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2021-06-05 12:12:56,012 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2021-06-05 12:12:56,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2021-06-05 12:12:56,029 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 12 treesize of output 11 [2021-06-05 12:12:56,029 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:56,033 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:56,034 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:12:56,041 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:56,043 INFO L550 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:12:56,043 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:37, output treesize:18 [2021-06-05 12:12:56,394 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2021-06-05 12:12:56,774 WARN L205 SmtUtils]: Spent 340.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2021-06-05 12:12:57,143 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2021-06-05 12:12:57,181 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2021-06-05 12:12:57,183 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:12:57,189 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:12:57,195 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 12:12:57,195 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:25 [2021-06-05 12:12:57,315 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:12:57,315 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592998595] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:12:57,315 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:12:57,315 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2021-06-05 12:12:57,315 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186706975] [2021-06-05 12:12:57,316 INFO L462 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-06-05 12:12:57,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:12:57,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-06-05 12:12:57,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=911, Unknown=2, NotChecked=0, Total=1056 [2021-06-05 12:12:57,316 INFO L87 Difference]: Start difference. First operand 1348 states and 2520 transitions. Second operand has 33 states, 33 states have (on average 5.333333333333333) internal successors, (176), 33 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:13:05,750 WARN L205 SmtUtils]: Spent 669.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2021-06-05 12:13:06,913 WARN L205 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2021-06-05 12:13:07,631 WARN L205 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2021-06-05 12:13:09,180 WARN L205 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2021-06-05 12:13:09,985 WARN L205 SmtUtils]: Spent 754.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2021-06-05 12:13:10,866 WARN L205 SmtUtils]: Spent 834.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2021-06-05 12:13:11,646 WARN L205 SmtUtils]: Spent 701.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-06-05 12:13:13,147 WARN L205 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2021-06-05 12:13:14,495 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 39 [2021-06-05 12:13:16,064 WARN L205 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2021-06-05 12:13:17,943 WARN L205 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 41 [2021-06-05 12:13:19,449 WARN L205 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2021-06-05 12:13:20,709 WARN L205 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 43 [2021-06-05 12:13:22,065 WARN L205 SmtUtils]: Spent 1.28 s on a formula simplification that was a NOOP. DAG size: 45 [2021-06-05 12:13:23,361 WARN L205 SmtUtils]: Spent 1.25 s on a formula simplification that was a NOOP. DAG size: 43 [2021-06-05 12:13:23,762 WARN L205 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2021-06-05 12:13:24,135 WARN L205 SmtUtils]: Spent 338.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2021-06-05 12:13:25,505 WARN L205 SmtUtils]: Spent 1.33 s on a formula simplification that was a NOOP. DAG size: 45 [2021-06-05 12:13:26,795 WARN L205 SmtUtils]: Spent 706.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2021-06-05 12:13:27,649 WARN L205 SmtUtils]: Spent 713.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-06-05 12:13:28,951 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification that was a NOOP. DAG size: 42 [2021-06-05 12:13:30,243 WARN L205 SmtUtils]: Spent 1.20 s on a formula simplification that was a NOOP. DAG size: 44 [2021-06-05 12:13:31,465 WARN L205 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 46 [2021-06-05 12:13:31,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:13:31,514 INFO L93 Difference]: Finished difference Result 3218 states and 6033 transitions. [2021-06-05 12:13:31,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-06-05 12:13:31,515 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 5.333333333333333) internal successors, (176), 33 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2021-06-05 12:13:31,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:13:31,519 INFO L225 Difference]: With dead ends: 3218 [2021-06-05 12:13:31,519 INFO L226 Difference]: Without dead ends: 3218 [2021-06-05 12:13:31,520 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 126 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1766 ImplicationChecksByTransitivity, 29098.1ms TimeCoverageRelationStatistics Valid=1142, Invalid=4860, Unknown=4, NotChecked=0, Total=6006 [2021-06-05 12:13:31,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3218 states. [2021-06-05 12:13:31,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3218 to 1614. [2021-06-05 12:13:31,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1614 states, 1613 states have (on average 1.8691878487290763) internal successors, (3015), 1613 states have internal predecessors, (3015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:13:31,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1614 states to 1614 states and 3015 transitions. [2021-06-05 12:13:31,543 INFO L78 Accepts]: Start accepts. Automaton has 1614 states and 3015 transitions. Word has length 140 [2021-06-05 12:13:31,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:13:31,544 INFO L482 AbstractCegarLoop]: Abstraction has 1614 states and 3015 transitions. [2021-06-05 12:13:31,544 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 33 states, 33 states have (on average 5.333333333333333) internal successors, (176), 33 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:13:31,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1614 states and 3015 transitions. [2021-06-05 12:13:31,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-06-05 12:13:31,546 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:13:31,546 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:13:31,760 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-06-05 12:13:31,760 INFO L430 AbstractCegarLoop]: === Iteration 16 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:13:31,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:13:31,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1756192050, now seen corresponding path program 4 times [2021-06-05 12:13:31,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:13:31,760 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833075646] [2021-06-05 12:13:31,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:13:31,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:13:32,197 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:13:32,198 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:13:32,198 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833075646] [2021-06-05 12:13:32,198 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833075646] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:13:32,198 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266180738] [2021-06-05 12:13:32,198 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 12:13:32,302 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 12:13:32,302 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:13:32,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 39 conjunts are in the unsatisfiable core [2021-06-05 12:13:32,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:13:32,323 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 12:13:32,324 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:13:32,326 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:13:32,329 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:13:32,329 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-06-05 12:13:32,351 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 6 [2021-06-05 12:13:32,352 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:13:32,355 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:13:32,356 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:13:32,356 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2021-06-05 12:13:32,451 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:13:32,452 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 12:13:32,453 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:13:32,457 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:13:32,458 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:13:32,458 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2021-06-05 12:13:32,502 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2021-06-05 12:13:32,506 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 8 treesize of output 7 [2021-06-05 12:13:32,506 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:13:32,509 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:13:32,510 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:13:32,515 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:13:32,516 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 12:13:32,516 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:17 [2021-06-05 12:13:32,639 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2021-06-05 12:13:32,639 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:13:32,648 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:13:32,649 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:13:32,650 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:43, output treesize:35 [2021-06-05 12:13:33,275 WARN L205 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2021-06-05 12:13:33,313 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 33 treesize of output 28 [2021-06-05 12:13:33,314 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:13:33,321 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:13:33,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 12:13:33,322 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:46, output treesize:29 [2021-06-05 12:13:33,989 WARN L205 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2021-06-05 12:13:34,363 WARN L205 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2021-06-05 12:13:34,719 WARN L205 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2021-06-05 12:13:35,098 WARN L205 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2021-06-05 12:13:35,110 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2021-06-05 12:13:35,114 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2021-06-05 12:13:35,114 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:13:35,118 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:13:35,119 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:13:35,125 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:13:35,127 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:13:35,127 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:34, output treesize:17 [2021-06-05 12:13:35,493 WARN L205 SmtUtils]: Spent 336.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2021-06-05 12:13:35,859 WARN L205 SmtUtils]: Spent 329.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2021-06-05 12:13:35,892 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2021-06-05 12:13:35,893 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:13:35,899 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:13:35,904 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2021-06-05 12:13:35,904 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:25 [2021-06-05 12:13:35,979 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:13:35,980 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266180738] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:13:35,980 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:13:35,980 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19] total 34 [2021-06-05 12:13:35,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704581495] [2021-06-05 12:13:35,980 INFO L462 AbstractCegarLoop]: Interpolant automaton has 34 states [2021-06-05 12:13:35,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:13:35,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2021-06-05 12:13:35,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=979, Unknown=2, NotChecked=0, Total=1122 [2021-06-05 12:13:35,981 INFO L87 Difference]: Start difference. First operand 1614 states and 3015 transitions. Second operand has 34 states, 34 states have (on average 5.176470588235294) internal successors, (176), 34 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:13:43,615 WARN L205 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2021-06-05 12:13:45,469 WARN L205 SmtUtils]: Spent 676.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2021-06-05 12:13:45,685 WARN L205 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2021-06-05 12:13:47,043 WARN L205 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2021-06-05 12:13:47,318 WARN L205 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 70 [2021-06-05 12:13:48,151 WARN L205 SmtUtils]: Spent 703.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2021-06-05 12:13:48,405 WARN L205 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2021-06-05 12:13:50,097 WARN L205 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2021-06-05 12:13:50,890 WARN L205 SmtUtils]: Spent 694.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2021-06-05 12:13:51,639 WARN L205 SmtUtils]: Spent 708.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 38 [2021-06-05 12:13:53,191 WARN L205 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2021-06-05 12:13:54,008 WARN L205 SmtUtils]: Spent 778.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2021-06-05 12:13:54,883 WARN L205 SmtUtils]: Spent 806.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 39 [2021-06-05 12:13:55,727 WARN L205 SmtUtils]: Spent 703.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2021-06-05 12:13:57,235 WARN L205 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2021-06-05 12:13:58,523 WARN L205 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 43 [2021-06-05 12:14:00,067 WARN L205 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2021-06-05 12:14:02,160 WARN L205 SmtUtils]: Spent 1.51 s on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2021-06-05 12:14:03,743 WARN L205 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2021-06-05 12:14:05,098 WARN L205 SmtUtils]: Spent 1.26 s on a formula simplification that was a NOOP. DAG size: 45 [2021-06-05 12:14:06,661 WARN L205 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2021-06-05 12:14:07,988 WARN L205 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 47 [2021-06-05 12:14:09,369 WARN L205 SmtUtils]: Spent 1.30 s on a formula simplification that was a NOOP. DAG size: 49 [2021-06-05 12:14:10,956 WARN L205 SmtUtils]: Spent 1.55 s on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2021-06-05 12:14:12,278 WARN L205 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 47 [2021-06-05 12:14:13,075 WARN L205 SmtUtils]: Spent 724.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2021-06-05 12:14:13,846 WARN L205 SmtUtils]: Spent 727.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-06-05 12:14:15,080 WARN L205 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 49 [2021-06-05 12:14:15,840 WARN L205 SmtUtils]: Spent 715.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2021-06-05 12:14:16,608 WARN L205 SmtUtils]: Spent 721.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2021-06-05 12:14:17,349 WARN L205 SmtUtils]: Spent 703.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2021-06-05 12:14:18,118 WARN L205 SmtUtils]: Spent 704.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-06-05 12:14:18,857 WARN L205 SmtUtils]: Spent 716.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2021-06-05 12:14:20,134 WARN L205 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 46 [2021-06-05 12:14:21,385 WARN L205 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 48 [2021-06-05 12:14:22,669 WARN L205 SmtUtils]: Spent 1.25 s on a formula simplification that was a NOOP. DAG size: 50 [2021-06-05 12:14:23,418 WARN L205 SmtUtils]: Spent 719.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2021-06-05 12:14:23,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:14:23,426 INFO L93 Difference]: Finished difference Result 3249 states and 6089 transitions. [2021-06-05 12:14:23,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2021-06-05 12:14:23,427 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 5.176470588235294) internal successors, (176), 34 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2021-06-05 12:14:23,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:14:23,430 INFO L225 Difference]: With dead ends: 3249 [2021-06-05 12:14:23,430 INFO L226 Difference]: Without dead ends: 3249 [2021-06-05 12:14:23,432 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 125 SyntacticMatches, 3 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2871 ImplicationChecksByTransitivity, 41922.6ms TimeCoverageRelationStatistics Valid=1831, Invalid=7671, Unknown=4, NotChecked=0, Total=9506 [2021-06-05 12:14:23,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3249 states. [2021-06-05 12:14:23,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3249 to 1610. [2021-06-05 12:14:23,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1610 states, 1609 states have (on average 1.870105655686762) internal successors, (3009), 1609 states have internal predecessors, (3009), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:23,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 3009 transitions. [2021-06-05 12:14:23,453 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 3009 transitions. Word has length 140 [2021-06-05 12:14:23,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:14:23,454 INFO L482 AbstractCegarLoop]: Abstraction has 1610 states and 3009 transitions. [2021-06-05 12:14:23,454 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 34 states, 34 states have (on average 5.176470588235294) internal successors, (176), 34 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:23,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 3009 transitions. [2021-06-05 12:14:23,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-06-05 12:14:23,456 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:14:23,456 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:14:23,668 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:14:23,669 INFO L430 AbstractCegarLoop]: === Iteration 17 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:14:23,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:14:23,669 INFO L82 PathProgramCache]: Analyzing trace with hash -151076880, now seen corresponding path program 5 times [2021-06-05 12:14:23,669 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:14:23,669 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030914842] [2021-06-05 12:14:23,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:14:23,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:14:24,043 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:14:24,043 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:14:24,043 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030914842] [2021-06-05 12:14:24,043 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030914842] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:14:24,044 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [891529222] [2021-06-05 12:14:24,044 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 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 12:14:24,158 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2021-06-05 12:14:24,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:14:24,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 29 conjunts are in the unsatisfiable core [2021-06-05 12:14:24,166 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:14:24,181 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 12:14:24,182 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:14:24,183 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:14:24,183 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:14:24,183 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:14:24,188 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 7 treesize of output 6 [2021-06-05 12:14:24,189 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:14:24,192 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:14:24,192 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:14:24,192 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:14:24,262 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:14:24,262 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 12:14:24,263 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:14:24,266 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:14:24,266 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:14:24,267 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:14:24,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:14:24,281 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 12 treesize of output 11 [2021-06-05 12:14:24,282 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:14:24,285 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:14:24,285 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:14:24,289 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:14:24,305 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 12:14:24,305 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:14:24,405 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2021-06-05 12:14:24,406 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:14:24,410 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:14:24,410 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:14:24,411 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:22 [2021-06-05 12:14:24,491 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 32 treesize of output 25 [2021-06-05 12:14:24,492 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:14:24,495 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:14:24,496 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-06-05 12:14:24,496 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:17 [2021-06-05 12:14:24,583 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:14:24,586 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 12 treesize of output 11 [2021-06-05 12:14:24,587 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:14:24,590 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:14:24,591 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:14:24,595 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:14:24,596 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 12:14:24,596 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:14:24,631 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 14 treesize of output 10 [2021-06-05 12:14:24,631 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:14:24,633 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:14:24,633 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 12:14:24,633 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:14:24,684 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2021-06-05 12:14:24,684 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [891529222] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:14:24,685 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:14:24,685 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 30 [2021-06-05 12:14:24,685 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737122962] [2021-06-05 12:14:24,686 INFO L462 AbstractCegarLoop]: Interpolant automaton has 30 states [2021-06-05 12:14:24,686 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:14:24,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2021-06-05 12:14:24,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=744, Unknown=0, NotChecked=0, Total=870 [2021-06-05 12:14:24,686 INFO L87 Difference]: Start difference. First operand 1610 states and 3009 transitions. Second operand has 30 states, 30 states have (on average 5.066666666666666) internal successors, (152), 30 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:26,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:14:26,052 INFO L93 Difference]: Finished difference Result 2491 states and 4702 transitions. [2021-06-05 12:14:26,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2021-06-05 12:14:26,053 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 5.066666666666666) internal successors, (152), 30 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 140 [2021-06-05 12:14:26,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:14:26,053 INFO L225 Difference]: With dead ends: 2491 [2021-06-05 12:14:26,053 INFO L226 Difference]: Without dead ends: 0 [2021-06-05 12:14:26,054 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 128 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 1199.0ms TimeCoverageRelationStatistics Valid=781, Invalid=3125, Unknown=0, NotChecked=0, Total=3906 [2021-06-05 12:14:26,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-05 12:14:26,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-05 12:14:26,054 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 12:14:26,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-05 12:14:26,054 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 140 [2021-06-05 12:14:26,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:14:26,054 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-05 12:14:26,054 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 30 states, 30 states have (on average 5.066666666666666) internal successors, (152), 30 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:26,054 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-05 12:14:26,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-05 12:14:26,268 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2021-06-05 12:14:26,269 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was SAFE (1/2) [2021-06-05 12:14:26,270 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 12:14:26,271 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:14:26,271 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:14:26,271 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:14:26,271 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:14:26,271 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:14:26,271 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:14:26,271 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:14:26,271 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 12:14:26,279 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 156 places, 186 transitions, 380 flow [2021-06-05 12:14:26,322 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3874 states, 3864 states have (on average 2.4309006211180124) internal successors, (9393), 3873 states have internal predecessors, (9393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:26,326 INFO L276 IsEmpty]: Start isEmpty. Operand has 3874 states, 3864 states have (on average 2.4309006211180124) internal successors, (9393), 3873 states have internal predecessors, (9393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:26,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 12:14:26,326 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:14:26,326 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] [2021-06-05 12:14:26,326 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:14:26,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:14:26,327 INFO L82 PathProgramCache]: Analyzing trace with hash -85999061, now seen corresponding path program 1 times [2021-06-05 12:14:26,327 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:14:26,327 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539117837] [2021-06-05 12:14:26,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:14:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:14:26,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:14:26,335 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:14:26,336 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539117837] [2021-06-05 12:14:26,336 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539117837] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:14:26,336 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:14:26,336 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 12:14:26,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202307748] [2021-06-05 12:14:26,336 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 12:14:26,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:14:26,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 12:14:26,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:14:26,342 INFO L87 Difference]: Start difference. First operand has 3874 states, 3864 states have (on average 2.4309006211180124) internal successors, (9393), 3873 states have internal predecessors, (9393), 0 states have call successors, (0), 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 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:26,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:14:26,355 INFO L93 Difference]: Finished difference Result 3750 states and 7533 transitions. [2021-06-05 12:14:26,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 12:14:26,355 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 12:14:26,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:14:26,364 INFO L225 Difference]: With dead ends: 3750 [2021-06-05 12:14:26,365 INFO L226 Difference]: Without dead ends: 614 [2021-06-05 12:14:26,365 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 12:14:26,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2021-06-05 12:14:26,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2021-06-05 12:14:26,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 614 states, 612 states have (on average 1.8888888888888888) internal successors, (1156), 613 states have internal predecessors, (1156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:26,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 1156 transitions. [2021-06-05 12:14:26,372 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 1156 transitions. Word has length 37 [2021-06-05 12:14:26,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:14:26,372 INFO L482 AbstractCegarLoop]: Abstraction has 614 states and 1156 transitions. [2021-06-05 12:14:26,372 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:26,372 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 1156 transitions. [2021-06-05 12:14:26,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-06-05 12:14:26,372 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:14:26,373 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] [2021-06-05 12:14:26,373 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-06-05 12:14:26,373 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:14:26,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:14:26,373 INFO L82 PathProgramCache]: Analyzing trace with hash -930470932, now seen corresponding path program 1 times [2021-06-05 12:14:26,373 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:14:26,373 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22546577] [2021-06-05 12:14:26,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:14:26,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:14:26,382 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 12:14:26,382 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:14:26,382 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22546577] [2021-06-05 12:14:26,382 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22546577] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:14:26,383 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:14:26,383 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 12:14:26,383 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599463034] [2021-06-05 12:14:26,383 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:14:26,383 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:14:26,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:14:26,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:14:26,383 INFO L87 Difference]: Start difference. First operand 614 states and 1156 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:26,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:14:26,391 INFO L93 Difference]: Finished difference Result 618 states and 1160 transitions. [2021-06-05 12:14:26,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:14:26,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2021-06-05 12:14:26,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:14:26,392 INFO L225 Difference]: With dead ends: 618 [2021-06-05 12:14:26,392 INFO L226 Difference]: Without dead ends: 618 [2021-06-05 12:14:26,392 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 12:14:26,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2021-06-05 12:14:26,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 615. [2021-06-05 12:14:26,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 613 states have (on average 1.8874388254486134) internal successors, (1157), 614 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 1157 transitions. [2021-06-05 12:14:26,398 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 1157 transitions. Word has length 37 [2021-06-05 12:14:26,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:14:26,398 INFO L482 AbstractCegarLoop]: Abstraction has 615 states and 1157 transitions. [2021-06-05 12:14:26,398 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:26,398 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 1157 transitions. [2021-06-05 12:14:26,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-06-05 12:14:26,398 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:14:26,398 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] [2021-06-05 12:14:26,399 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-06-05 12:14:26,399 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:14:26,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:14:26,399 INFO L82 PathProgramCache]: Analyzing trace with hash 250519804, now seen corresponding path program 1 times [2021-06-05 12:14:26,399 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:14:26,399 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989775817] [2021-06-05 12:14:26,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:14:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:14:26,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:14:26,415 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:14:26,415 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989775817] [2021-06-05 12:14:26,415 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989775817] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:14:26,415 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497168444] [2021-06-05 12:14:26,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:14:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:14:26,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:14:26,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:14:26,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:14:26,565 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497168444] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:14:26,565 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:14:26,565 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:14:26,566 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594663761] [2021-06-05 12:14:26,566 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:14:26,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:14:26,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:14:26,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:14:26,567 INFO L87 Difference]: Start difference. First operand 615 states and 1157 transitions. Second operand has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:26,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:14:26,594 INFO L93 Difference]: Finished difference Result 623 states and 1165 transitions. [2021-06-05 12:14:26,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:14:26,594 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-06-05 12:14:26,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:14:26,595 INFO L225 Difference]: With dead ends: 623 [2021-06-05 12:14:26,595 INFO L226 Difference]: Without dead ends: 623 [2021-06-05 12:14:26,595 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 21.7ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:14:26,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2021-06-05 12:14:26,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 620. [2021-06-05 12:14:26,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 618 states have (on average 1.8802588996763754) internal successors, (1162), 619 states have internal predecessors, (1162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:26,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1162 transitions. [2021-06-05 12:14:26,601 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 1162 transitions. Word has length 42 [2021-06-05 12:14:26,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:14:26,601 INFO L482 AbstractCegarLoop]: Abstraction has 620 states and 1162 transitions. [2021-06-05 12:14:26,601 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 6.142857142857143) internal successors, (43), 7 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:26,601 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 1162 transitions. [2021-06-05 12:14:26,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-06-05 12:14:26,601 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:14:26,601 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 12:14:26,817 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:14:26,817 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:14:26,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:14:26,818 INFO L82 PathProgramCache]: Analyzing trace with hash -1877094932, now seen corresponding path program 2 times [2021-06-05 12:14:26,818 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:14:26,818 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324813185] [2021-06-05 12:14:26,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:14:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:14:26,843 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:14:26,843 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:14:26,843 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324813185] [2021-06-05 12:14:26,843 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324813185] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:14:26,843 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1474276797] [2021-06-05 12:14:26,843 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 12:14:26,907 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:14:26,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:14:26,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:14:26,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:14:26,955 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:14:26,956 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1474276797] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:14:26,956 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:14:26,956 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 12:14:26,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552965476] [2021-06-05 12:14:26,956 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 12:14:26,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:14:26,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 12:14:26,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:14:26,956 INFO L87 Difference]: Start difference. First operand 620 states and 1162 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:26,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:14:27,000 INFO L93 Difference]: Finished difference Result 628 states and 1170 transitions. [2021-06-05 12:14:27,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 12:14:27,000 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-06-05 12:14:27,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:14:27,001 INFO L225 Difference]: With dead ends: 628 [2021-06-05 12:14:27,001 INFO L226 Difference]: Without dead ends: 628 [2021-06-05 12:14:27,001 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 36.6ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:14:27,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2021-06-05 12:14:27,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 625. [2021-06-05 12:14:27,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 623 states have (on average 1.8731942215088282) internal successors, (1167), 624 states have internal predecessors, (1167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:27,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 1167 transitions. [2021-06-05 12:14:27,008 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 1167 transitions. Word has length 47 [2021-06-05 12:14:27,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:14:27,009 INFO L482 AbstractCegarLoop]: Abstraction has 625 states and 1167 transitions. [2021-06-05 12:14:27,009 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 9 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:27,009 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 1167 transitions. [2021-06-05 12:14:27,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-06-05 12:14:27,009 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:14:27,009 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:14:27,222 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2021-06-05 12:14:27,222 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:14:27,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:14:27,222 INFO L82 PathProgramCache]: Analyzing trace with hash 588592892, now seen corresponding path program 3 times [2021-06-05 12:14:27,222 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:14:27,222 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437603965] [2021-06-05 12:14:27,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:14:27,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:14:27,258 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:14:27,259 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:14:27,259 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437603965] [2021-06-05 12:14:27,259 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437603965] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:14:27,259 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495670244] [2021-06-05 12:14:27,259 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 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 12:14:27,317 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-06-05 12:14:27,317 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:14:27,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 12:14:27,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:14:27,375 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:14:27,375 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495670244] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:14:27,375 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:14:27,375 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-06-05 12:14:27,376 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674931997] [2021-06-05 12:14:27,376 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:14:27,376 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:14:27,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:14:27,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:14:27,376 INFO L87 Difference]: Start difference. First operand 625 states and 1167 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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 12:14:27,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:14:27,434 INFO L93 Difference]: Finished difference Result 633 states and 1175 transitions. [2021-06-05 12:14:27,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 12:14:27,434 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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 52 [2021-06-05 12:14:27,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:14:27,435 INFO L225 Difference]: With dead ends: 633 [2021-06-05 12:14:27,435 INFO L226 Difference]: Without dead ends: 633 [2021-06-05 12:14:27,435 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 61.4ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:14:27,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2021-06-05 12:14:27,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 630. [2021-06-05 12:14:27,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 630 states, 628 states have (on average 1.8662420382165605) internal successors, (1172), 629 states have internal predecessors, (1172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:27,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 1172 transitions. [2021-06-05 12:14:27,441 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 1172 transitions. Word has length 52 [2021-06-05 12:14:27,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:14:27,441 INFO L482 AbstractCegarLoop]: Abstraction has 630 states and 1172 transitions. [2021-06-05 12:14:27,442 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 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 12:14:27,442 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 1172 transitions. [2021-06-05 12:14:27,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-06-05 12:14:27,442 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:14:27,442 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:14:27,658 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2021-06-05 12:14:27,659 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:14:27,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:14:27,659 INFO L82 PathProgramCache]: Analyzing trace with hash 447018988, now seen corresponding path program 4 times [2021-06-05 12:14:27,659 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:14:27,659 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359666786] [2021-06-05 12:14:27,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:14:27,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:14:27,708 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:14:27,709 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:14:27,709 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359666786] [2021-06-05 12:14:27,709 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359666786] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:14:27,709 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734886132] [2021-06-05 12:14:27,709 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 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 12:14:27,764 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 12:14:27,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:14:27,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 12:14:27,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:14:27,826 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:14:27,826 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [734886132] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:14:27,826 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:14:27,826 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-06-05 12:14:27,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243871503] [2021-06-05 12:14:27,827 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:14:27,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:14:27,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:14:27,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:14:27,827 INFO L87 Difference]: Start difference. First operand 630 states and 1172 transitions. Second operand has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:27,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:14:27,905 INFO L93 Difference]: Finished difference Result 638 states and 1180 transitions. [2021-06-05 12:14:27,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 12:14:27,905 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-06-05 12:14:27,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:14:27,906 INFO L225 Difference]: With dead ends: 638 [2021-06-05 12:14:27,906 INFO L226 Difference]: Without dead ends: 638 [2021-06-05 12:14:27,906 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 89.4ms TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:14:27,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2021-06-05 12:14:27,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 635. [2021-06-05 12:14:27,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 633 states have (on average 1.8593996840442337) internal successors, (1177), 634 states have internal predecessors, (1177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:27,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 1177 transitions. [2021-06-05 12:14:27,913 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 1177 transitions. Word has length 57 [2021-06-05 12:14:27,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:14:27,913 INFO L482 AbstractCegarLoop]: Abstraction has 635 states and 1177 transitions. [2021-06-05 12:14:27,913 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 4.461538461538462) internal successors, (58), 13 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:27,913 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 1177 transitions. [2021-06-05 12:14:27,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-06-05 12:14:27,913 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:14:27,913 INFO L521 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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] [2021-06-05 12:14:28,122 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2021-06-05 12:14:28,123 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:14:28,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:14:28,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1065857796, now seen corresponding path program 5 times [2021-06-05 12:14:28,123 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:14:28,123 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615950113] [2021-06-05 12:14:28,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:14:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:14:28,191 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:14:28,191 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:14:28,191 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615950113] [2021-06-05 12:14:28,191 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615950113] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:14:28,191 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668201584] [2021-06-05 12:14:28,191 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 12:14:28,263 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2021-06-05 12:14:28,263 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:14:28,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2021-06-05 12:14:28,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:14:28,330 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:14:28,330 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [668201584] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:14:28,330 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:14:28,330 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2021-06-05 12:14:28,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139648576] [2021-06-05 12:14:28,330 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 12:14:28,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:14:28,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 12:14:28,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-05 12:14:28,331 INFO L87 Difference]: Start difference. First operand 635 states and 1177 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:28,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:14:28,439 INFO L93 Difference]: Finished difference Result 643 states and 1185 transitions. [2021-06-05 12:14:28,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 12:14:28,439 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2021-06-05 12:14:28,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:14:28,440 INFO L225 Difference]: With dead ends: 643 [2021-06-05 12:14:28,440 INFO L226 Difference]: Without dead ends: 643 [2021-06-05 12:14:28,440 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 116.4ms TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2021-06-05 12:14:28,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 643 states. [2021-06-05 12:14:28,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 643 to 640. [2021-06-05 12:14:28,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 638 states have (on average 1.8526645768025078) internal successors, (1182), 639 states have internal predecessors, (1182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:28,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 1182 transitions. [2021-06-05 12:14:28,447 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 1182 transitions. Word has length 62 [2021-06-05 12:14:28,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:14:28,447 INFO L482 AbstractCegarLoop]: Abstraction has 640 states and 1182 transitions. [2021-06-05 12:14:28,447 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:28,447 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 1182 transitions. [2021-06-05 12:14:28,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-06-05 12:14:28,447 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:14:28,448 INFO L521 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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] [2021-06-05 12:14:28,660 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2021-06-05 12:14:28,661 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:14:28,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:14:28,661 INFO L82 PathProgramCache]: Analyzing trace with hash -306208276, now seen corresponding path program 6 times [2021-06-05 12:14:28,661 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:14:28,661 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521127562] [2021-06-05 12:14:28,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:14:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:14:28,743 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:14:28,743 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:14:28,743 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521127562] [2021-06-05 12:14:28,743 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521127562] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:14:28,743 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294893726] [2021-06-05 12:14:28,744 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 12:14:28,838 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2021-06-05 12:14:28,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:14:28,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 12:14:28,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:14:28,937 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:14:28,938 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294893726] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:14:28,938 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:14:28,938 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2021-06-05 12:14:28,938 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786223957] [2021-06-05 12:14:28,938 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 12:14:28,938 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:14:28,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 12:14:28,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:14:28,939 INFO L87 Difference]: Start difference. First operand 640 states and 1182 transitions. Second operand has 17 states, 17 states have (on average 4.0) internal successors, (68), 17 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:29,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:14:29,067 INFO L93 Difference]: Finished difference Result 648 states and 1190 transitions. [2021-06-05 12:14:29,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 12:14:29,068 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 17 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2021-06-05 12:14:29,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:14:29,068 INFO L225 Difference]: With dead ends: 648 [2021-06-05 12:14:29,068 INFO L226 Difference]: Without dead ends: 648 [2021-06-05 12:14:29,069 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 156.9ms TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2021-06-05 12:14:29,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2021-06-05 12:14:29,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 645. [2021-06-05 12:14:29,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 643 states have (on average 1.8460342146189737) internal successors, (1187), 644 states have internal predecessors, (1187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:29,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1187 transitions. [2021-06-05 12:14:29,075 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1187 transitions. Word has length 67 [2021-06-05 12:14:29,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:14:29,075 INFO L482 AbstractCegarLoop]: Abstraction has 645 states and 1187 transitions. [2021-06-05 12:14:29,075 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 4.0) internal successors, (68), 17 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:29,075 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1187 transitions. [2021-06-05 12:14:29,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-05 12:14:29,075 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:14:29,075 INFO L521 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 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] [2021-06-05 12:14:29,292 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2021-06-05 12:14:29,292 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:14:29,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:14:29,293 INFO L82 PathProgramCache]: Analyzing trace with hash -445127940, now seen corresponding path program 7 times [2021-06-05 12:14:29,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:14:29,293 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051593150] [2021-06-05 12:14:29,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:14:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:14:29,389 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:14:29,390 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:14:29,390 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051593150] [2021-06-05 12:14:29,390 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051593150] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:14:29,390 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1409472600] [2021-06-05 12:14:29,390 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 12:14:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:14:29,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 12:14:29,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:14:29,532 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:14:29,533 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1409472600] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:14:29,533 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:14:29,533 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2021-06-05 12:14:29,533 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21052211] [2021-06-05 12:14:29,533 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 12:14:29,533 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:14:29,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 12:14:29,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-06-05 12:14:29,534 INFO L87 Difference]: Start difference. First operand 645 states and 1187 transitions. Second operand has 19 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 19 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:29,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:14:29,693 INFO L93 Difference]: Finished difference Result 653 states and 1195 transitions. [2021-06-05 12:14:29,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 12:14:29,694 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 19 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2021-06-05 12:14:29,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:14:29,695 INFO L225 Difference]: With dead ends: 653 [2021-06-05 12:14:29,695 INFO L226 Difference]: Without dead ends: 653 [2021-06-05 12:14:29,695 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 195.7ms TimeCoverageRelationStatistics Valid=340, Invalid=716, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 12:14:29,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2021-06-05 12:14:29,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 650. [2021-06-05 12:14:29,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 650 states, 648 states have (on average 1.8395061728395061) internal successors, (1192), 649 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:29,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 1192 transitions. [2021-06-05 12:14:29,701 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 1192 transitions. Word has length 72 [2021-06-05 12:14:29,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:14:29,701 INFO L482 AbstractCegarLoop]: Abstraction has 650 states and 1192 transitions. [2021-06-05 12:14:29,701 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 3.8421052631578947) internal successors, (73), 19 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:29,701 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 1192 transitions. [2021-06-05 12:14:29,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-06-05 12:14:29,701 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:14:29,702 INFO L521 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 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] [2021-06-05 12:14:29,916 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,23 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:14:29,917 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:14:29,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:14:29,917 INFO L82 PathProgramCache]: Analyzing trace with hash 118344684, now seen corresponding path program 8 times [2021-06-05 12:14:29,917 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:14:29,917 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321694745] [2021-06-05 12:14:29,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:14:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:14:30,045 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:14:30,046 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:14:30,046 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321694745] [2021-06-05 12:14:30,046 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321694745] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:14:30,046 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040787072] [2021-06-05 12:14:30,046 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 12:14:30,122 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:14:30,123 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:14:30,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 18 conjunts are in the unsatisfiable core [2021-06-05 12:14:30,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:14:30,222 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:14:30,222 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040787072] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:14:30,222 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:14:30,223 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 21 [2021-06-05 12:14:30,223 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313762468] [2021-06-05 12:14:30,223 INFO L462 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-06-05 12:14:30,223 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:14:30,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-06-05 12:14:30,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:14:30,223 INFO L87 Difference]: Start difference. First operand 650 states and 1192 transitions. Second operand has 21 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 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 12:14:30,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:14:30,414 INFO L93 Difference]: Finished difference Result 658 states and 1200 transitions. [2021-06-05 12:14:30,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2021-06-05 12:14:30,414 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 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 77 [2021-06-05 12:14:30,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:14:30,415 INFO L225 Difference]: With dead ends: 658 [2021-06-05 12:14:30,415 INFO L226 Difference]: Without dead ends: 658 [2021-06-05 12:14:30,415 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 243.5ms TimeCoverageRelationStatistics Valid=427, Invalid=905, Unknown=0, NotChecked=0, Total=1332 [2021-06-05 12:14:30,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2021-06-05 12:14:30,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 655. [2021-06-05 12:14:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 655 states, 653 states have (on average 1.8330781010719754) internal successors, (1197), 654 states have internal predecessors, (1197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:30,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 1197 transitions. [2021-06-05 12:14:30,421 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 1197 transitions. Word has length 77 [2021-06-05 12:14:30,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:14:30,421 INFO L482 AbstractCegarLoop]: Abstraction has 655 states and 1197 transitions. [2021-06-05 12:14:30,421 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 21 states, 21 states have (on average 3.7142857142857144) internal successors, (78), 21 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 12:14:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 1197 transitions. [2021-06-05 12:14:30,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-06-05 12:14:30,421 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:14:30,422 INFO L521 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 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] [2021-06-05 12:14:30,637 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2021-06-05 12:14:30,637 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:14:30,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:14:30,637 INFO L82 PathProgramCache]: Analyzing trace with hash 410253564, now seen corresponding path program 9 times [2021-06-05 12:14:30,638 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:14:30,638 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393993669] [2021-06-05 12:14:30,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:14:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:14:30,782 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:14:30,783 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:14:30,783 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393993669] [2021-06-05 12:14:30,783 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393993669] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:14:30,783 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53414428] [2021-06-05 12:14:30,783 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 12:14:30,897 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2021-06-05 12:14:30,897 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:14:30,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 12:14:30,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:14:30,998 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:14:30,998 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53414428] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:14:30,998 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:14:30,998 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2021-06-05 12:14:30,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66404856] [2021-06-05 12:14:30,998 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 12:14:30,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:14:30,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 12:14:30,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2021-06-05 12:14:30,999 INFO L87 Difference]: Start difference. First operand 655 states and 1197 transitions. Second operand has 23 states, 23 states have (on average 3.608695652173913) internal successors, (83), 23 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:31,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:14:31,231 INFO L93 Difference]: Finished difference Result 660 states and 1202 transitions. [2021-06-05 12:14:31,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 12:14:31,231 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 3.608695652173913) internal successors, (83), 23 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-06-05 12:14:31,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:14:31,232 INFO L225 Difference]: With dead ends: 660 [2021-06-05 12:14:31,232 INFO L226 Difference]: Without dead ends: 660 [2021-06-05 12:14:31,232 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 303.1ms TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 12:14:31,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2021-06-05 12:14:31,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2021-06-05 12:14:31,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 658 states have (on average 1.8267477203647415) internal successors, (1202), 659 states have internal predecessors, (1202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:31,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1202 transitions. [2021-06-05 12:14:31,240 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1202 transitions. Word has length 82 [2021-06-05 12:14:31,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:14:31,240 INFO L482 AbstractCegarLoop]: Abstraction has 660 states and 1202 transitions. [2021-06-05 12:14:31,240 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 3.608695652173913) internal successors, (83), 23 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:14:31,240 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1202 transitions. [2021-06-05 12:14:31,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-06-05 12:14:31,241 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:14:31,241 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:14:31,441 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,25 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:14:31,441 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0INUSE_VIOLATION]=== [2021-06-05 12:14:31,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:14:31,442 INFO L82 PathProgramCache]: Analyzing trace with hash -600869396, now seen corresponding path program 10 times [2021-06-05 12:14:31,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:14:31,442 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659774902] [2021-06-05 12:14:31,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:14:31,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 12:14:31,456 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 12:14:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-05 12:14:31,474 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-05 12:14:31,493 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-05 12:14:31,493 INFO L622 BasicCegarLoop]: Counterexample might be feasible [2021-06-05 12:14:31,494 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2021-06-05 12:14:31,494 INFO L315 ceAbstractionStarter]: Result for error location InUseError was UNSAFE (2/2) [2021-06-05 12:14:31,494 WARN L242 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2021-06-05 12:14:31,494 INFO L510 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2021-06-05 12:14:31,504 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,504 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,504 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,504 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,504 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,504 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,504 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,504 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,504 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,504 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,504 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,504 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,504 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,504 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,504 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,504 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,505 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,505 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,505 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,505 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,505 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,505 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,505 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,505 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,505 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,505 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,505 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,505 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,505 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,505 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,505 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,505 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,505 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,505 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,505 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,505 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,505 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,505 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,505 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,505 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,505 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,506 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,506 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,506 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,506 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,506 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,506 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,506 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,506 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,506 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,506 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,506 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,506 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,506 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,506 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,506 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,506 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,506 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,506 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,506 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,506 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,506 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,506 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,506 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,506 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,506 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,507 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,507 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,507 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,507 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,507 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,507 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,507 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,507 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,507 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,507 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,507 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,507 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,507 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,507 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,507 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,507 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,507 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,507 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,507 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,507 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,508 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,508 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,508 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,508 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,508 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,508 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,508 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,508 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,508 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,508 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,508 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,508 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,508 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,508 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,508 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,508 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,508 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,508 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,508 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,508 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,509 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,509 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,509 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,509 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,509 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,509 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,509 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,509 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,509 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,509 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,509 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,509 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,509 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,509 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,509 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,509 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,509 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,509 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,509 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,509 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,509 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,509 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,510 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,510 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,510 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,510 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,510 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,510 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,510 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,510 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,510 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,510 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,510 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,510 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,510 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,510 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,510 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,510 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,510 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,510 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,510 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,510 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,510 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,510 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,510 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,511 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,511 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,511 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,511 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,511 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,511 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,511 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,511 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,511 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,511 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,511 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,511 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,511 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,511 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,512 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,512 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,512 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,512 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,512 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,512 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,512 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,512 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,512 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,512 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,512 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,512 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,512 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,512 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,512 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,512 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,512 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,512 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,512 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,512 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,513 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,513 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,513 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,513 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,513 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,513 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,513 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,513 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,513 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,513 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,513 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,513 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,513 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,513 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,513 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,513 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,513 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,513 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,513 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,513 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,513 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,513 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,513 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,513 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,513 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,513 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,514 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,514 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,514 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,514 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,514 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,514 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,514 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,514 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,514 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,514 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,514 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,514 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,514 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,514 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,514 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,514 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,514 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,514 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,514 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,514 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,514 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,515 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,515 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,515 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,515 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,515 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,515 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,515 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,515 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,515 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,515 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,515 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,515 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,515 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,515 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,515 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,515 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,515 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,515 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,515 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,515 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,516 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,516 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,516 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,516 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,516 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,516 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,516 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,516 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,516 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,516 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,516 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,516 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,516 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,516 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,516 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,516 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,516 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,516 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,516 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,516 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,516 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,517 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,517 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,517 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,517 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,517 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,517 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,517 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,517 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,517 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,517 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,517 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,517 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,517 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,517 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,517 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,517 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,517 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,517 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,517 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,517 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,517 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,517 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,517 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,517 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,518 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,518 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,518 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,518 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,518 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,518 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,518 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,518 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,518 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,518 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,518 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,518 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,518 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,518 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,518 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,518 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,518 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,518 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,518 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,518 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,518 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,518 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,518 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,518 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,519 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,519 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,519 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,519 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,519 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,519 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,519 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,519 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,519 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,519 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,519 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,519 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,520 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,520 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,520 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,520 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,520 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,520 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,520 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,520 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,520 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,520 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,520 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,520 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,520 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,520 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,520 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,520 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,520 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,521 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,521 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,522 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,522 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,522 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,522 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,522 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,522 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,522 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,522 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,522 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,522 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,522 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,522 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,522 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,522 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,522 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,522 WARN L313 ript$VariableManager]: TermVariabe t_funThread2of2ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,522 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,522 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,522 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,522 WARN L313 ript$VariableManager]: TermVariabe |t_funThread2of2ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-05 12:14:31,525 INFO L149 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-06-05 12:14:31,525 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-05 12:14:31,526 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:14:31,526 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:14:31,526 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:14:31,526 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:14:31,526 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:14:31,526 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:14:31,526 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:14:31,526 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-06-05 12:14:31,528 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 212 places, 255 transitions, 528 flow [2021-06-05 12:15:12,963 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 208858 states, 208834 states have (on average 3.6673721711981764) internal successors, (765872), 208857 states have internal predecessors, (765872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:13,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 208858 states, 208834 states have (on average 3.6673721711981764) internal successors, (765872), 208857 states have internal predecessors, (765872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:13,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-06-05 12:15:13,213 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:13,213 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] [2021-06-05 12:15:13,213 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:15:13,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:13,213 INFO L82 PathProgramCache]: Analyzing trace with hash 930307405, now seen corresponding path program 1 times [2021-06-05 12:15:13,213 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:13,213 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509926778] [2021-06-05 12:15:13,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:13,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:13,225 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 12:15:13,225 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:13,225 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509926778] [2021-06-05 12:15:13,225 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509926778] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:15:13,225 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:15:13,225 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-05 12:15:13,225 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305458271] [2021-06-05 12:15:13,225 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-06-05 12:15:13,225 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:13,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-06-05 12:15:13,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-06-05 12:15:13,441 INFO L87 Difference]: Start difference. First operand has 208858 states, 208834 states have (on average 3.6673721711981764) internal successors, (765872), 208857 states have internal predecessors, (765872), 0 states have call successors, (0), 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 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:15,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:15,254 INFO L93 Difference]: Finished difference Result 198419 states and 600938 transitions. [2021-06-05 12:15:15,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-06-05 12:15:15,254 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-06-05 12:15:15,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:16,018 INFO L225 Difference]: With dead ends: 198419 [2021-06-05 12:15:16,018 INFO L226 Difference]: Without dead ends: 198189 [2021-06-05 12:15:16,018 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 12:15:23,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198189 states. [2021-06-05 12:15:26,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198189 to 198189. [2021-06-05 12:15:26,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198189 states, 198171 states have (on average 3.029464452417357) internal successors, (600352), 198188 states have internal predecessors, (600352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:27,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198189 states to 198189 states and 600352 transitions. [2021-06-05 12:15:27,786 INFO L78 Accepts]: Start accepts. Automaton has 198189 states and 600352 transitions. Word has length 41 [2021-06-05 12:15:27,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:27,791 INFO L482 AbstractCegarLoop]: Abstraction has 198189 states and 600352 transitions. [2021-06-05 12:15:27,791 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:27,791 INFO L276 IsEmpty]: Start isEmpty. Operand 198189 states and 600352 transitions. [2021-06-05 12:15:27,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2021-06-05 12:15:27,797 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:27,797 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] [2021-06-05 12:15:27,797 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2021-06-05 12:15:27,798 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:15:27,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:27,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1330600015, now seen corresponding path program 1 times [2021-06-05 12:15:27,798 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:27,798 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383852239] [2021-06-05 12:15:27,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:27,811 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 12:15:27,811 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:27,811 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383852239] [2021-06-05 12:15:27,811 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383852239] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:15:27,811 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:15:27,812 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-06-05 12:15:27,812 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376369447] [2021-06-05 12:15:27,812 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:15:27,812 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:27,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:15:27,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:15:27,812 INFO L87 Difference]: Start difference. First operand 198189 states and 600352 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:28,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:28,792 INFO L93 Difference]: Finished difference Result 198193 states and 600356 transitions. [2021-06-05 12:15:28,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:15:28,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2021-06-05 12:15:28,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:29,179 INFO L225 Difference]: With dead ends: 198193 [2021-06-05 12:15:29,179 INFO L226 Difference]: Without dead ends: 198193 [2021-06-05 12:15:29,179 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-05 12:15:36,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198193 states. [2021-06-05 12:15:39,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198193 to 198190. [2021-06-05 12:15:39,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198190 states, 198172 states have (on average 3.0294542114930465) internal successors, (600353), 198189 states have internal predecessors, (600353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:40,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198190 states to 198190 states and 600353 transitions. [2021-06-05 12:15:40,275 INFO L78 Accepts]: Start accepts. Automaton has 198190 states and 600353 transitions. Word has length 41 [2021-06-05 12:15:40,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:40,276 INFO L482 AbstractCegarLoop]: Abstraction has 198190 states and 600353 transitions. [2021-06-05 12:15:40,276 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:40,276 INFO L276 IsEmpty]: Start isEmpty. Operand 198190 states and 600353 transitions. [2021-06-05 12:15:40,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-06-05 12:15:40,276 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:40,276 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] [2021-06-05 12:15:40,277 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2021-06-05 12:15:40,277 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:15:40,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:40,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1304481536, now seen corresponding path program 1 times [2021-06-05 12:15:40,277 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:40,277 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420746658] [2021-06-05 12:15:40,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:40,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:15:40,291 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:40,292 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420746658] [2021-06-05 12:15:40,292 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420746658] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:40,292 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1264565753] [2021-06-05 12:15:40,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 12:15:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:40,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2021-06-05 12:15:40,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:15:40,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:15:40,867 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1264565753] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:15:40,867 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:15:40,867 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-06-05 12:15:40,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926427542] [2021-06-05 12:15:40,867 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-05 12:15:40,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:40,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-05 12:15:40,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:15:40,868 INFO L87 Difference]: Start difference. First operand 198190 states and 600353 transitions. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:41,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:41,575 INFO L93 Difference]: Finished difference Result 198142 states and 600303 transitions. [2021-06-05 12:15:41,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-05 12:15:41,575 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-06-05 12:15:41,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:42,306 INFO L225 Difference]: With dead ends: 198142 [2021-06-05 12:15:42,306 INFO L226 Difference]: Without dead ends: 198142 [2021-06-05 12:15:42,307 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 9.2ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-06-05 12:15:50,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198142 states. [2021-06-05 12:15:52,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198142 to 198142. [2021-06-05 12:15:52,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198142 states, 198125 states have (on average 3.0299205047318614) internal successors, (600303), 198141 states have internal predecessors, (600303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:53,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198142 states to 198142 states and 600303 transitions. [2021-06-05 12:15:53,075 INFO L78 Accepts]: Start accepts. Automaton has 198142 states and 600303 transitions. Word has length 46 [2021-06-05 12:15:53,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:15:53,075 INFO L482 AbstractCegarLoop]: Abstraction has 198142 states and 600303 transitions. [2021-06-05 12:15:53,075 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:15:53,075 INFO L276 IsEmpty]: Start isEmpty. Operand 198142 states and 600303 transitions. [2021-06-05 12:15:53,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-06-05 12:15:53,077 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:15:53,077 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] [2021-06-05 12:15:53,286 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2021-06-05 12:15:53,287 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:15:53,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:15:53,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1940859667, now seen corresponding path program 1 times [2021-06-05 12:15:53,287 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:15:53,287 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111842244] [2021-06-05 12:15:53,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:15:53,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:15:53,309 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:15:53,309 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111842244] [2021-06-05 12:15:53,309 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111842244] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:53,309 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199054705] [2021-06-05 12:15:53,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 12:15:53,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:15:53,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2021-06-05 12:15:53,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:15:53,932 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:15:53,932 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [199054705] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:15:53,932 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:15:53,932 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-06-05 12:15:53,933 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092028859] [2021-06-05 12:15:53,933 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:15:53,933 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:15:53,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:15:53,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:15:53,934 INFO L87 Difference]: Start difference. First operand 198142 states and 600303 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 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 12:15:54,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:15:54,734 INFO L93 Difference]: Finished difference Result 198150 states and 600311 transitions. [2021-06-05 12:15:54,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-06-05 12:15:54,735 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 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 52 [2021-06-05 12:15:54,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:15:55,194 INFO L225 Difference]: With dead ends: 198150 [2021-06-05 12:15:55,194 INFO L226 Difference]: Without dead ends: 198150 [2021-06-05 12:15:55,196 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 21.3ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:16:03,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198150 states. [2021-06-05 12:16:05,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198150 to 198147. [2021-06-05 12:16:06,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198147 states, 198130 states have (on average 3.029869277746934) internal successors, (600308), 198146 states have internal predecessors, (600308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:16:06,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198147 states to 198147 states and 600308 transitions. [2021-06-05 12:16:06,668 INFO L78 Accepts]: Start accepts. Automaton has 198147 states and 600308 transitions. Word has length 52 [2021-06-05 12:16:06,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:16:06,668 INFO L482 AbstractCegarLoop]: Abstraction has 198147 states and 600308 transitions. [2021-06-05 12:16:06,669 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 7 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 12:16:06,669 INFO L276 IsEmpty]: Start isEmpty. Operand 198147 states and 600308 transitions. [2021-06-05 12:16:06,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-06-05 12:16:06,671 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:16:06,671 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 12:16:06,885 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,27 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:16:06,885 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:16:06,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:16:06,886 INFO L82 PathProgramCache]: Analyzing trace with hash -391427134, now seen corresponding path program 2 times [2021-06-05 12:16:06,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:16:06,886 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176042430] [2021-06-05 12:16:06,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:16:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:16:06,913 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-05 12:16:06,913 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:16:06,913 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176042430] [2021-06-05 12:16:06,913 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176042430] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:16:06,913 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512755474] [2021-06-05 12:16:06,914 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 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 12:16:06,980 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 12:16:06,980 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:16:06,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 12:16:06,982 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:16:06,998 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 12:16:06,999 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:16:07,000 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:16:07,000 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:16:07,000 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:16:07,010 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 7 treesize of output 6 [2021-06-05 12:16:07,011 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:16:07,017 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:16:07,018 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:16:07,018 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:16:07,564 WARN L205 SmtUtils]: Spent 525.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2021-06-05 12:16:07,577 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:16:07,577 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:16:07,578 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:16:07,581 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:16:07,582 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:16:07,582 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:16:07,629 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:16:07,632 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:16:07,632 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:16:07,636 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:16:07,636 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:16:07,653 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:16:07,655 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 12:16:07,655 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:16:07,720 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 14 treesize of output 10 [2021-06-05 12:16:07,721 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:16:07,722 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:16:07,723 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 12:16:07,723 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:16:07,758 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 12:16:07,758 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512755474] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:16:07,759 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:16:07,759 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2021-06-05 12:16:07,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351448092] [2021-06-05 12:16:07,759 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:16:07,759 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:16:07,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:16:07,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-06-05 12:16:07,760 INFO L87 Difference]: Start difference. First operand 198147 states and 600308 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:16:11,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:16:11,976 INFO L93 Difference]: Finished difference Result 701121 states and 2125136 transitions. [2021-06-05 12:16:11,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2021-06-05 12:16:11,977 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2021-06-05 12:16:11,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:16:13,556 INFO L225 Difference]: With dead ends: 701121 [2021-06-05 12:16:13,556 INFO L226 Difference]: Without dead ends: 701121 [2021-06-05 12:16:13,557 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 563 ImplicationChecksByTransitivity, 908.4ms TimeCoverageRelationStatistics Valid=480, Invalid=1872, Unknown=0, NotChecked=0, Total=2352 [2021-06-05 12:16:27,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701121 states. [2021-06-05 12:16:34,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701121 to 302441. [2021-06-05 12:16:34,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302441 states, 302424 states have (on average 3.0563381213131233) internal successors, (924310), 302440 states have internal predecessors, (924310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:16:35,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302441 states to 302441 states and 924310 transitions. [2021-06-05 12:16:35,427 INFO L78 Accepts]: Start accepts. Automaton has 302441 states and 924310 transitions. Word has length 57 [2021-06-05 12:16:35,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:16:35,427 INFO L482 AbstractCegarLoop]: Abstraction has 302441 states and 924310 transitions. [2021-06-05 12:16:35,427 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:16:35,427 INFO L276 IsEmpty]: Start isEmpty. Operand 302441 states and 924310 transitions. [2021-06-05 12:16:35,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-06-05 12:16:35,432 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:16:35,432 INFO L521 BasicCegarLoop]: trace histogram [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] [2021-06-05 12:16:35,634 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2021-06-05 12:16:35,634 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:16:35,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:16:35,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1440665987, now seen corresponding path program 1 times [2021-06-05 12:16:35,634 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:16:35,634 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925507577] [2021-06-05 12:16:35,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:16:35,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:16:35,652 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-06-05 12:16:35,652 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:16:35,652 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925507577] [2021-06-05 12:16:35,653 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925507577] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:16:35,653 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1671800099] [2021-06-05 12:16:35,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:16:36,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:16:36,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:16:36,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:16:36,580 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-06-05 12:16:36,581 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1671800099] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:16:36,581 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:16:36,581 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 10 [2021-06-05 12:16:36,581 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792193586] [2021-06-05 12:16:36,581 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-06-05 12:16:36,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:16:36,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-06-05 12:16:36,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-06-05 12:16:36,581 INFO L87 Difference]: Start difference. First operand 302441 states and 924310 transitions. Second operand has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 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 12:16:37,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:16:37,675 INFO L93 Difference]: Finished difference Result 298721 states and 916502 transitions. [2021-06-05 12:16:37,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 12:16:37,675 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 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 61 [2021-06-05 12:16:37,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:16:38,799 INFO L225 Difference]: With dead ends: 298721 [2021-06-05 12:16:38,800 INFO L226 Difference]: Without dead ends: 298721 [2021-06-05 12:16:38,800 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 60.1ms TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2021-06-05 12:16:47,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298721 states. [2021-06-05 12:16:51,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298721 to 298718. [2021-06-05 12:16:52,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298718 states, 298703 states have (on average 3.0682617851176586) internal successors, (916499), 298717 states have internal predecessors, (916499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:16:53,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298718 states to 298718 states and 916499 transitions. [2021-06-05 12:16:53,586 INFO L78 Accepts]: Start accepts. Automaton has 298718 states and 916499 transitions. Word has length 61 [2021-06-05 12:16:53,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:16:53,586 INFO L482 AbstractCegarLoop]: Abstraction has 298718 states and 916499 transitions. [2021-06-05 12:16:53,586 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.2) internal successors, (82), 10 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 12:16:53,586 INFO L276 IsEmpty]: Start isEmpty. Operand 298718 states and 916499 transitions. [2021-06-05 12:16:53,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-05 12:16:53,613 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:16:53,613 INFO L521 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:16:53,836 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,29 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:16:53,836 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:16:53,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:16:53,836 INFO L82 PathProgramCache]: Analyzing trace with hash 2147239018, now seen corresponding path program 1 times [2021-06-05 12:16:53,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:16:53,836 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24053019] [2021-06-05 12:16:53,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:16:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:16:53,904 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:16:53,905 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:16:53,905 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24053019] [2021-06-05 12:16:53,905 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24053019] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:16:53,905 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1328753385] [2021-06-05 12:16:53,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 12:16:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:16:53,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjunts are in the unsatisfiable core [2021-06-05 12:16:53,974 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:16:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:16:54,047 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1328753385] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:16:54,047 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:16:54,047 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-06-05 12:16:54,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014456621] [2021-06-05 12:16:54,047 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:16:54,047 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:16:54,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:16:54,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:16:54,048 INFO L87 Difference]: Start difference. First operand 298718 states and 916499 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:16:56,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:16:56,094 INFO L93 Difference]: Finished difference Result 298726 states and 916507 transitions. [2021-06-05 12:16:56,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-05 12:16:56,094 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2021-06-05 12:16:56,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:16:57,182 INFO L225 Difference]: With dead ends: 298726 [2021-06-05 12:16:57,183 INFO L226 Difference]: Without dead ends: 298726 [2021-06-05 12:16:57,184 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 74.6ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:17:05,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298726 states. [2021-06-05 12:17:09,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298726 to 298723. [2021-06-05 12:17:10,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298723 states, 298708 states have (on average 3.0682271649905593) internal successors, (916504), 298722 states have internal predecessors, (916504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:17:11,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298723 states to 298723 states and 916504 transitions. [2021-06-05 12:17:11,071 INFO L78 Accepts]: Start accepts. Automaton has 298723 states and 916504 transitions. Word has length 71 [2021-06-05 12:17:11,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:17:11,071 INFO L482 AbstractCegarLoop]: Abstraction has 298723 states and 916504 transitions. [2021-06-05 12:17:11,071 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 11 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:17:11,071 INFO L276 IsEmpty]: Start isEmpty. Operand 298723 states and 916504 transitions. [2021-06-05 12:17:11,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-05 12:17:11,080 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:17:11,081 INFO L521 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:17:11,292 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2021-06-05 12:17:11,293 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:17:11,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:17:11,293 INFO L82 PathProgramCache]: Analyzing trace with hash 602779483, now seen corresponding path program 2 times [2021-06-05 12:17:11,293 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:17:11,293 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286716467] [2021-06-05 12:17:11,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:17:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:17:11,339 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:17:11,339 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:17:11,339 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286716467] [2021-06-05 12:17:11,339 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286716467] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:17:11,339 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [264043875] [2021-06-05 12:17:11,339 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 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 12:17:12,098 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:17:12,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:17:12,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 10 conjunts are in the unsatisfiable core [2021-06-05 12:17:12,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:17:12,180 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:17:12,180 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [264043875] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:17:12,180 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:17:12,180 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2021-06-05 12:17:12,180 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611465080] [2021-06-05 12:17:12,185 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:17:12,186 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:17:12,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:17:12,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:17:12,186 INFO L87 Difference]: Start difference. First operand 298723 states and 916504 transitions. Second operand has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:17:13,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:17:13,255 INFO L93 Difference]: Finished difference Result 298731 states and 916512 transitions. [2021-06-05 12:17:13,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 12:17:13,255 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2021-06-05 12:17:13,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:17:14,338 INFO L225 Difference]: With dead ends: 298731 [2021-06-05 12:17:14,338 INFO L226 Difference]: Without dead ends: 298731 [2021-06-05 12:17:14,338 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 100.6ms TimeCoverageRelationStatistics Valid=139, Invalid=281, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:17:22,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298731 states. [2021-06-05 12:17:26,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298731 to 298728. [2021-06-05 12:17:27,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298728 states, 298713 states have (on average 3.0681925460224364) internal successors, (916509), 298727 states have internal predecessors, (916509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:17:27,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298728 states to 298728 states and 916509 transitions. [2021-06-05 12:17:27,974 INFO L78 Accepts]: Start accepts. Automaton has 298728 states and 916509 transitions. Word has length 76 [2021-06-05 12:17:27,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:17:27,975 INFO L482 AbstractCegarLoop]: Abstraction has 298728 states and 916509 transitions. [2021-06-05 12:17:27,975 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.923076923076923) internal successors, (77), 13 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:17:27,975 INFO L276 IsEmpty]: Start isEmpty. Operand 298728 states and 916509 transitions. [2021-06-05 12:17:27,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-06-05 12:17:27,984 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:17:27,984 INFO L521 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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] [2021-06-05 12:17:28,200 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,31 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:17:28,200 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:17:28,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:17:28,201 INFO L82 PathProgramCache]: Analyzing trace with hash -879856886, now seen corresponding path program 3 times [2021-06-05 12:17:28,201 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:17:28,201 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144366396] [2021-06-05 12:17:28,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:17:28,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:17:28,262 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:17:28,262 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:17:28,262 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144366396] [2021-06-05 12:17:28,262 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144366396] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:17:28,262 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961281772] [2021-06-05 12:17:28,262 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 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 12:17:28,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 12:17:28,332 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:17:28,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 15 conjunts are in the unsatisfiable core [2021-06-05 12:17:28,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:17:28,349 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 12:17:28,350 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:17:28,351 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:17:28,352 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:17:28,352 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:17:28,362 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 7 treesize of output 6 [2021-06-05 12:17:28,363 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:17:28,365 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:17:28,366 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:17:28,366 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:17:29,129 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:17:29,130 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 12:17:29,131 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:17:29,135 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:17:29,135 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:17:29,135 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:17:29,154 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:17:29,156 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 12 treesize of output 11 [2021-06-05 12:17:29,157 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:17:29,160 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:17:29,160 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:17:29,164 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:17:29,165 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 12:17:29,165 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:17:29,197 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:17:29,200 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 12 treesize of output 11 [2021-06-05 12:17:29,201 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:17:29,204 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:17:29,204 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:17:29,209 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:17:29,225 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 12:17:29,225 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:17:29,261 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 14 treesize of output 10 [2021-06-05 12:17:29,262 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:17:29,263 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:17:29,264 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 12:17:29,264 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:17:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2021-06-05 12:17:29,305 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961281772] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:17:29,305 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:17:29,305 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 22 [2021-06-05 12:17:29,305 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868187362] [2021-06-05 12:17:29,305 INFO L462 AbstractCegarLoop]: Interpolant automaton has 22 states [2021-06-05 12:17:29,305 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:17:29,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2021-06-05 12:17:29,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2021-06-05 12:17:29,306 INFO L87 Difference]: Start difference. First operand 298728 states and 916509 transitions. Second operand has 22 states, 22 states have (on average 5.5) internal successors, (121), 22 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:17:34,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:17:34,167 INFO L93 Difference]: Finished difference Result 775947 states and 2362400 transitions. [2021-06-05 12:17:34,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2021-06-05 12:17:34,167 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.5) internal successors, (121), 22 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2021-06-05 12:17:34,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:17:36,609 INFO L225 Difference]: With dead ends: 775947 [2021-06-05 12:17:36,609 INFO L226 Difference]: Without dead ends: 775947 [2021-06-05 12:17:36,609 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1195 ImplicationChecksByTransitivity, 842.8ms TimeCoverageRelationStatistics Valid=730, Invalid=3962, Unknown=0, NotChecked=0, Total=4692 [2021-06-05 12:17:50,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775947 states. [2021-06-05 12:17:57,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775947 to 294415. [2021-06-05 12:17:57,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294415 states, 294400 states have (on average 3.0686141304347827) internal successors, (903400), 294414 states have internal predecessors, (903400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:17:59,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294415 states to 294415 states and 903400 transitions. [2021-06-05 12:17:59,637 INFO L78 Accepts]: Start accepts. Automaton has 294415 states and 903400 transitions. Word has length 81 [2021-06-05 12:17:59,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:17:59,638 INFO L482 AbstractCegarLoop]: Abstraction has 294415 states and 903400 transitions. [2021-06-05 12:17:59,638 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 22 states, 22 states have (on average 5.5) internal successors, (121), 22 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:17:59,638 INFO L276 IsEmpty]: Start isEmpty. Operand 294415 states and 903400 transitions. [2021-06-05 12:17:59,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-06-05 12:17:59,649 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:17:59,649 INFO L521 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 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] [2021-06-05 12:17:59,865 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2021-06-05 12:17:59,865 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:17:59,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:17:59,866 INFO L82 PathProgramCache]: Analyzing trace with hash 859554269, now seen corresponding path program 4 times [2021-06-05 12:17:59,866 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:17:59,866 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791877949] [2021-06-05 12:17:59,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:17:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:17:59,964 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:17:59,964 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:17:59,964 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791877949] [2021-06-05 12:17:59,965 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791877949] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:17:59,965 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726350108] [2021-06-05 12:17:59,965 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 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 12:18:00,052 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 12:18:00,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:18:00,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 14 conjunts are in the unsatisfiable core [2021-06-05 12:18:00,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:18:00,147 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:18:00,147 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726350108] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:18:00,147 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:18:00,147 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2021-06-05 12:18:00,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246999351] [2021-06-05 12:18:00,148 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-06-05 12:18:00,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:18:00,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-06-05 12:18:00,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:18:00,148 INFO L87 Difference]: Start difference. First operand 294415 states and 903400 transitions. Second operand has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:18:01,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:18:01,989 INFO L93 Difference]: Finished difference Result 294423 states and 903408 transitions. [2021-06-05 12:18:01,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 12:18:01,989 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2021-06-05 12:18:01,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:18:02,647 INFO L225 Difference]: With dead ends: 294423 [2021-06-05 12:18:02,647 INFO L226 Difference]: Without dead ends: 294423 [2021-06-05 12:18:02,647 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 149.8ms TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2021-06-05 12:18:11,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294423 states. [2021-06-05 12:18:15,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294423 to 294420. [2021-06-05 12:18:15,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294420 states, 294405 states have (on average 3.068578998318643) internal successors, (903405), 294419 states have internal predecessors, (903405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:18:17,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294420 states to 294420 states and 903405 transitions. [2021-06-05 12:18:17,238 INFO L78 Accepts]: Start accepts. Automaton has 294420 states and 903405 transitions. Word has length 86 [2021-06-05 12:18:17,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:18:17,238 INFO L482 AbstractCegarLoop]: Abstraction has 294420 states and 903405 transitions. [2021-06-05 12:18:17,238 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 17 states, 17 states have (on average 5.117647058823529) internal successors, (87), 17 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:18:17,238 INFO L276 IsEmpty]: Start isEmpty. Operand 294420 states and 903405 transitions. [2021-06-05 12:18:17,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-06-05 12:18:17,246 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:18:17,246 INFO L521 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 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] [2021-06-05 12:18:17,447 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2021-06-05 12:18:17,447 INFO L430 AbstractCegarLoop]: === Iteration 11 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:18:17,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:18:17,447 INFO L82 PathProgramCache]: Analyzing trace with hash -816122164, now seen corresponding path program 5 times [2021-06-05 12:18:17,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:18:17,448 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994645412] [2021-06-05 12:18:17,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:18:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:18:17,541 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:18:17,541 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:18:17,541 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994645412] [2021-06-05 12:18:17,541 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994645412] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:18:17,541 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581359429] [2021-06-05 12:18:17,541 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:18:17,618 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2021-06-05 12:18:17,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:18:17,620 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 12:18:17,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:18:17,715 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:18:17,715 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581359429] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:18:17,715 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:18:17,715 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2021-06-05 12:18:17,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648299391] [2021-06-05 12:18:17,715 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-06-05 12:18:17,715 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:18:17,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-06-05 12:18:17,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-06-05 12:18:17,716 INFO L87 Difference]: Start difference. First operand 294420 states and 903405 transitions. Second operand has 19 states, 19 states have (on average 4.842105263157895) internal successors, (92), 19 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:18:19,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:18:19,439 INFO L93 Difference]: Finished difference Result 294428 states and 903413 transitions. [2021-06-05 12:18:19,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-06-05 12:18:19,439 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 4.842105263157895) internal successors, (92), 19 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2021-06-05 12:18:19,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:18:20,002 INFO L225 Difference]: With dead ends: 294428 [2021-06-05 12:18:20,002 INFO L226 Difference]: Without dead ends: 294428 [2021-06-05 12:18:20,003 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 191.9ms TimeCoverageRelationStatistics Valid=340, Invalid=716, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 12:18:28,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294428 states. [2021-06-05 12:18:32,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294428 to 294425. [2021-06-05 12:18:32,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294425 states, 294410 states have (on average 3.0685438673958085) internal successors, (903410), 294424 states have internal predecessors, (903410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:18:34,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294425 states to 294425 states and 903410 transitions. [2021-06-05 12:18:34,697 INFO L78 Accepts]: Start accepts. Automaton has 294425 states and 903410 transitions. Word has length 91 [2021-06-05 12:18:34,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:18:34,697 INFO L482 AbstractCegarLoop]: Abstraction has 294425 states and 903410 transitions. [2021-06-05 12:18:34,697 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 19 states, 19 states have (on average 4.842105263157895) internal successors, (92), 19 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:18:34,697 INFO L276 IsEmpty]: Start isEmpty. Operand 294425 states and 903410 transitions. [2021-06-05 12:18:34,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-06-05 12:18:34,706 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:18:34,706 INFO L521 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 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] [2021-06-05 12:18:34,908 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2021-06-05 12:18:34,909 INFO L430 AbstractCegarLoop]: === Iteration 12 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:18:34,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:18:34,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1114799933, now seen corresponding path program 6 times [2021-06-05 12:18:34,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:18:34,909 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145026544] [2021-06-05 12:18:34,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:18:34,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:18:35,018 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-06-05 12:18:35,019 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:18:35,019 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145026544] [2021-06-05 12:18:35,019 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145026544] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:18:35,019 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741820800] [2021-06-05 12:18:35,019 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 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 12:18:35,087 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 12:18:35,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:18:35,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 15 conjunts are in the unsatisfiable core [2021-06-05 12:18:35,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:18:35,105 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 12:18:35,105 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:18:35,106 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:18:35,107 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:18:35,107 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:18:35,119 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 7 treesize of output 6 [2021-06-05 12:18:35,120 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:18:35,122 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:18:35,123 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:18:35,123 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:18:35,195 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:18:35,196 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 12:18:35,197 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:18:35,200 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:18:35,200 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:18:35,200 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:18:35,223 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:18:35,226 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 12 treesize of output 11 [2021-06-05 12:18:35,227 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:18:35,230 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:18:35,230 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:18:35,234 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:18:35,235 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 12:18:35,235 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:18:35,289 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:18:35,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 12 treesize of output 11 [2021-06-05 12:18:35,293 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:18:35,296 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:18:35,296 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:18:35,300 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:18:35,301 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 12:18:35,301 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:18:35,325 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 14 treesize of output 10 [2021-06-05 12:18:35,326 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:18:35,327 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:18:35,327 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 12:18:35,328 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:18:35,373 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2021-06-05 12:18:35,373 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741820800] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:18:35,373 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:18:35,374 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 11] total 28 [2021-06-05 12:18:35,374 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292948116] [2021-06-05 12:18:35,374 INFO L462 AbstractCegarLoop]: Interpolant automaton has 28 states [2021-06-05 12:18:35,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:18:35,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-06-05 12:18:35,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2021-06-05 12:18:35,374 INFO L87 Difference]: Start difference. First operand 294425 states and 903410 transitions. Second operand has 28 states, 28 states have (on average 4.857142857142857) internal successors, (136), 28 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:18:39,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:18:39,872 INFO L93 Difference]: Finished difference Result 619161 states and 1880946 transitions. [2021-06-05 12:18:39,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2021-06-05 12:18:39,873 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.857142857142857) internal successors, (136), 28 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2021-06-05 12:18:39,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:18:41,182 INFO L225 Difference]: With dead ends: 619161 [2021-06-05 12:18:41,183 INFO L226 Difference]: Without dead ends: 619161 [2021-06-05 12:18:41,183 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1348 ImplicationChecksByTransitivity, 1398.8ms TimeCoverageRelationStatistics Valid=905, Invalid=4795, Unknown=0, NotChecked=0, Total=5700 [2021-06-05 12:18:54,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619161 states. [2021-06-05 12:19:00,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619161 to 268522. [2021-06-05 12:19:00,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268522 states, 268507 states have (on average 3.0554622412078642) internal successors, (820413), 268521 states have internal predecessors, (820413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:01,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268522 states to 268522 states and 820413 transitions. [2021-06-05 12:19:01,256 INFO L78 Accepts]: Start accepts. Automaton has 268522 states and 820413 transitions. Word has length 96 [2021-06-05 12:19:01,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:01,257 INFO L482 AbstractCegarLoop]: Abstraction has 268522 states and 820413 transitions. [2021-06-05 12:19:01,257 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 28 states, 28 states have (on average 4.857142857142857) internal successors, (136), 28 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:01,257 INFO L276 IsEmpty]: Start isEmpty. Operand 268522 states and 820413 transitions. [2021-06-05 12:19:01,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2021-06-05 12:19:01,266 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:01,266 INFO L521 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:01,480 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2021-06-05 12:19:01,481 INFO L430 AbstractCegarLoop]: === Iteration 13 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:19:01,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:01,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1345872478, now seen corresponding path program 1 times [2021-06-05 12:19:01,481 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:01,481 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911805372] [2021-06-05 12:19:01,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:01,649 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:19:01,650 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:01,650 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911805372] [2021-06-05 12:19:01,650 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911805372] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:01,650 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1066390964] [2021-06-05 12:19:01,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:01,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:01,750 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 20 conjunts are in the unsatisfiable core [2021-06-05 12:19:01,751 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:02,288 WARN L205 SmtUtils]: Spent 481.00 ms on a formula simplification that was a NOOP. DAG size: 3 [2021-06-05 12:19:02,423 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2021-06-05 12:19:02,423 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1066390964] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:02,423 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:02,423 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2021-06-05 12:19:02,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647827805] [2021-06-05 12:19:02,424 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-06-05 12:19:02,424 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:02,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-06-05 12:19:02,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2021-06-05 12:19:02,424 INFO L87 Difference]: Start difference. First operand 268522 states and 820413 transitions. Second operand has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:03,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:03,688 INFO L93 Difference]: Finished difference Result 268527 states and 820418 transitions. [2021-06-05 12:19:03,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-06-05 12:19:03,688 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 102 [2021-06-05 12:19:03,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:04,771 INFO L225 Difference]: With dead ends: 268527 [2021-06-05 12:19:04,772 INFO L226 Difference]: Without dead ends: 268527 [2021-06-05 12:19:04,772 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 314.3ms TimeCoverageRelationStatistics Valid=524, Invalid=1116, Unknown=0, NotChecked=0, Total=1640 [2021-06-05 12:19:13,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268527 states. [2021-06-05 12:19:16,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268527 to 268527. [2021-06-05 12:19:16,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268527 states, 268512 states have (on average 3.055423966154213) internal successors, (820418), 268526 states have internal predecessors, (820418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:18,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268527 states to 268527 states and 820418 transitions. [2021-06-05 12:19:18,218 INFO L78 Accepts]: Start accepts. Automaton has 268527 states and 820418 transitions. Word has length 102 [2021-06-05 12:19:18,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:18,218 INFO L482 AbstractCegarLoop]: Abstraction has 268527 states and 820418 transitions. [2021-06-05 12:19:18,218 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 23 states, 23 states have (on average 4.478260869565218) internal successors, (103), 23 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:18,218 INFO L276 IsEmpty]: Start isEmpty. Operand 268527 states and 820418 transitions. [2021-06-05 12:19:18,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-06-05 12:19:18,227 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:18,227 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:18,428 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,36 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:18,428 INFO L430 AbstractCegarLoop]: === Iteration 14 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:19:18,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:18,429 INFO L82 PathProgramCache]: Analyzing trace with hash -40561519, now seen corresponding path program 2 times [2021-06-05 12:19:18,429 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:18,429 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725900615] [2021-06-05 12:19:18,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2021-06-05 12:19:18,516 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:18,516 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725900615] [2021-06-05 12:19:18,516 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725900615] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:18,516 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470162005] [2021-06-05 12:19:18,516 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 12:19:18,590 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:19:18,590 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:19:18,591 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 15 conjunts are in the unsatisfiable core [2021-06-05 12:19:18,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:18,612 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 12:19:18,612 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:18,614 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:18,614 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:18,614 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:19:18,622 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 7 treesize of output 6 [2021-06-05 12:19:18,623 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:18,625 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:18,626 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:18,626 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:19:18,698 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:19:18,698 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 12:19:18,699 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:18,702 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:18,702 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:18,702 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:19:18,712 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:19:18,715 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 12 treesize of output 11 [2021-06-05 12:19:18,716 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:18,719 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:18,720 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:18,723 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:18,724 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 12:19:18,724 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:19:18,743 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:19:18,746 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 12 treesize of output 11 [2021-06-05 12:19:18,747 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:18,750 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:18,750 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:18,754 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:18,755 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 12:19:18,755 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:19:18,783 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 14 treesize of output 10 [2021-06-05 12:19:18,784 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:18,786 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:18,786 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 12:19:18,786 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:19:18,813 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2021-06-05 12:19:18,813 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470162005] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:18,813 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:18,813 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2021-06-05 12:19:18,813 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95464098] [2021-06-05 12:19:18,813 INFO L462 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-06-05 12:19:18,813 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:18,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-06-05 12:19:18,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2021-06-05 12:19:18,814 INFO L87 Difference]: Start difference. First operand 268527 states and 820418 transitions. Second operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:23,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:23,016 INFO L93 Difference]: Finished difference Result 752299 states and 2279361 transitions. [2021-06-05 12:19:23,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2021-06-05 12:19:23,016 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2021-06-05 12:19:23,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:25,302 INFO L225 Difference]: With dead ends: 752299 [2021-06-05 12:19:25,302 INFO L226 Difference]: Without dead ends: 752299 [2021-06-05 12:19:25,302 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 105 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 663 ImplicationChecksByTransitivity, 426.2ms TimeCoverageRelationStatistics Valid=580, Invalid=1870, Unknown=0, NotChecked=0, Total=2450 [2021-06-05 12:19:39,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752299 states. [2021-06-05 12:19:46,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752299 to 297450. [2021-06-05 12:19:46,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297450 states, 297435 states have (on average 3.0471027283271974) internal successors, (906315), 297449 states have internal predecessors, (906315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297450 states to 297450 states and 906315 transitions. [2021-06-05 12:19:47,214 INFO L78 Accepts]: Start accepts. Automaton has 297450 states and 906315 transitions. Word has length 107 [2021-06-05 12:19:47,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:47,215 INFO L482 AbstractCegarLoop]: Abstraction has 297450 states and 906315 transitions. [2021-06-05 12:19:47,215 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 14 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:47,215 INFO L276 IsEmpty]: Start isEmpty. Operand 297450 states and 906315 transitions. [2021-06-05 12:19:47,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-06-05 12:19:47,228 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:47,229 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:19:47,429 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2021-06-05 12:19:47,429 INFO L430 AbstractCegarLoop]: === Iteration 15 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:19:47,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:47,430 INFO L82 PathProgramCache]: Analyzing trace with hash 11156492, now seen corresponding path program 1 times [2021-06-05 12:19:47,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:47,430 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72065033] [2021-06-05 12:19:47,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:47,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:47,460 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:19:47,460 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:47,460 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72065033] [2021-06-05 12:19:47,461 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72065033] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:47,461 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [918435980] [2021-06-05 12:19:47,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:47,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:47,534 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 6 conjunts are in the unsatisfiable core [2021-06-05 12:19:47,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:47,647 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:19:47,647 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [918435980] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:47,647 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:47,647 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-06-05 12:19:47,647 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384076518] [2021-06-05 12:19:47,648 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 12:19:47,648 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:47,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 12:19:47,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-06-05 12:19:47,648 INFO L87 Difference]: Start difference. First operand 297450 states and 906315 transitions. Second operand has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:48,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:48,554 INFO L93 Difference]: Finished difference Result 51205 states and 149959 transitions. [2021-06-05 12:19:48,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-05 12:19:48,555 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2021-06-05 12:19:48,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:48,632 INFO L225 Difference]: With dead ends: 51205 [2021-06-05 12:19:48,632 INFO L226 Difference]: Without dead ends: 51151 [2021-06-05 12:19:48,632 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 39.2ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-06-05 12:19:49,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51151 states. [2021-06-05 12:19:49,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51151 to 51151. [2021-06-05 12:19:50,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51151 states, 51148 states have (on average 2.928169234378666) internal successors, (149770), 51150 states have internal predecessors, (149770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:50,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51151 states to 51151 states and 149770 transitions. [2021-06-05 12:19:50,104 INFO L78 Accepts]: Start accepts. Automaton has 51151 states and 149770 transitions. Word has length 111 [2021-06-05 12:19:50,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:50,104 INFO L482 AbstractCegarLoop]: Abstraction has 51151 states and 149770 transitions. [2021-06-05 12:19:50,104 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 8.444444444444445) internal successors, (76), 9 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:50,104 INFO L276 IsEmpty]: Start isEmpty. Operand 51151 states and 149770 transitions. [2021-06-05 12:19:50,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-06-05 12:19:50,114 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:50,114 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:50,314 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable43 [2021-06-05 12:19:50,314 INFO L430 AbstractCegarLoop]: === Iteration 16 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:19:50,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:50,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1857231694, now seen corresponding path program 3 times [2021-06-05 12:19:50,315 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:50,315 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077771698] [2021-06-05 12:19:50,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:50,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:50,400 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2021-06-05 12:19:50,400 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:50,400 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077771698] [2021-06-05 12:19:50,401 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077771698] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:50,401 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179048024] [2021-06-05 12:19:50,401 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 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 12:19:50,473 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2021-06-05 12:19:50,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:19:50,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 12:19:50,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:50,490 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 12:19:50,491 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:50,492 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:50,493 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:50,493 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:19:50,497 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 7 treesize of output 6 [2021-06-05 12:19:50,498 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:50,500 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:50,500 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:50,500 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:19:50,569 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:19:50,570 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 12:19:50,571 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:50,573 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:50,574 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:50,574 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:19:50,592 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:19:50,595 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 12 treesize of output 11 [2021-06-05 12:19:50,596 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:50,599 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:50,599 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:50,603 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:50,604 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 12:19:50,604 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:19:50,621 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:19:50,624 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 12 treesize of output 11 [2021-06-05 12:19:50,625 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:50,628 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:50,628 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:50,632 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:50,633 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 12:19:50,633 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:19:50,677 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:19:50,680 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-06-05 12:19:50,680 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:50,683 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:50,684 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:50,688 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:50,689 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 12:19:50,689 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:19:50,710 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 14 treesize of output 10 [2021-06-05 12:19:50,711 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:50,712 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:50,713 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 12:19:50,713 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:19:50,743 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2021-06-05 12:19:50,743 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179048024] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:50,743 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:50,743 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2021-06-05 12:19:50,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422604193] [2021-06-05 12:19:50,744 INFO L462 AbstractCegarLoop]: Interpolant automaton has 15 states [2021-06-05 12:19:50,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:50,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-06-05 12:19:50,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2021-06-05 12:19:50,744 INFO L87 Difference]: Start difference. First operand 51151 states and 149770 transitions. Second operand has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:51,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:51,781 INFO L93 Difference]: Finished difference Result 126499 states and 368868 transitions. [2021-06-05 12:19:51,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2021-06-05 12:19:51,781 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2021-06-05 12:19:51,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:52,220 INFO L225 Difference]: With dead ends: 126499 [2021-06-05 12:19:52,220 INFO L226 Difference]: Without dead ends: 126499 [2021-06-05 12:19:52,221 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 114 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 353.8ms TimeCoverageRelationStatistics Valid=390, Invalid=1092, Unknown=0, NotChecked=0, Total=1482 [2021-06-05 12:19:53,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126499 states. [2021-06-05 12:19:54,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126499 to 51003. [2021-06-05 12:19:54,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51003 states, 51000 states have (on average 2.929333333333333) internal successors, (149396), 51002 states have internal predecessors, (149396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:54,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51003 states to 51003 states and 149396 transitions. [2021-06-05 12:19:54,346 INFO L78 Accepts]: Start accepts. Automaton has 51003 states and 149396 transitions. Word has length 116 [2021-06-05 12:19:54,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:54,347 INFO L482 AbstractCegarLoop]: Abstraction has 51003 states and 149396 transitions. [2021-06-05 12:19:54,347 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.933333333333334) internal successors, (74), 15 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:54,347 INFO L276 IsEmpty]: Start isEmpty. Operand 51003 states and 149396 transitions. [2021-06-05 12:19:54,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-06-05 12:19:54,357 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:54,357 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-06-05 12:19:54,558 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,39 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:19:54,558 INFO L430 AbstractCegarLoop]: === Iteration 17 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:19:54,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:54,558 INFO L82 PathProgramCache]: Analyzing trace with hash -585478508, now seen corresponding path program 4 times [2021-06-05 12:19:54,558 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:54,558 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563323756] [2021-06-05 12:19:54,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:54,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:54,643 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2021-06-05 12:19:54,643 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:54,643 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563323756] [2021-06-05 12:19:54,643 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563323756] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:54,643 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420745299] [2021-06-05 12:19:54,643 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 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 12:19:54,726 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 12:19:54,726 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:19:54,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 16 conjunts are in the unsatisfiable core [2021-06-05 12:19:54,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:19:54,743 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 12:19:54,744 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:54,745 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:54,745 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:54,745 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:19:54,750 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 7 treesize of output 6 [2021-06-05 12:19:54,750 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:54,753 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:54,753 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:54,754 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-06-05 12:19:54,821 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:19:54,821 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 12:19:54,823 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:54,825 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:54,826 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:54,826 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-06-05 12:19:54,836 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:19:54,839 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 12 treesize of output 11 [2021-06-05 12:19:54,839 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:54,842 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:54,843 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:54,846 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:54,847 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 12:19:54,847 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:19:54,863 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:19:54,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 12 treesize of output 11 [2021-06-05 12:19:54,866 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:54,869 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:54,870 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:54,873 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:54,874 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 12:19:54,874 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-06-05 12:19:54,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2021-06-05 12:19:54,925 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 12 treesize of output 11 [2021-06-05 12:19:54,925 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:54,928 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:54,929 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:19:54,932 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:54,933 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 12:19:54,933 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-06-05 12:19:54,953 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 14 treesize of output 10 [2021-06-05 12:19:54,954 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:19:54,955 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:19:54,956 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 12:19:54,956 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-06-05 12:19:54,986 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 251 trivial. 0 not checked. [2021-06-05 12:19:54,986 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420745299] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:19:54,986 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-06-05 12:19:54,986 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 16 [2021-06-05 12:19:54,986 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189466915] [2021-06-05 12:19:54,986 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-06-05 12:19:54,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:54,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-06-05 12:19:54,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2021-06-05 12:19:54,988 INFO L87 Difference]: Start difference. First operand 51003 states and 149396 transitions. Second operand has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:56,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:56,043 INFO L93 Difference]: Finished difference Result 119379 states and 350654 transitions. [2021-06-05 12:19:56,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 12:19:56,044 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 116 [2021-06-05 12:19:56,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:56,245 INFO L225 Difference]: With dead ends: 119379 [2021-06-05 12:19:56,245 INFO L226 Difference]: Without dead ends: 119379 [2021-06-05 12:19:56,246 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 113 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 248.4ms TimeCoverageRelationStatistics Valid=209, Invalid=661, Unknown=0, NotChecked=0, Total=870 [2021-06-05 12:19:57,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119379 states. [2021-06-05 12:19:58,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119379 to 50007. [2021-06-05 12:19:58,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50007 states, 50004 states have (on average 2.935365170786337) internal successors, (146780), 50006 states have internal predecessors, (146780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:58,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50007 states to 50007 states and 146780 transitions. [2021-06-05 12:19:58,427 INFO L78 Accepts]: Start accepts. Automaton has 50007 states and 146780 transitions. Word has length 116 [2021-06-05 12:19:58,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:19:58,428 INFO L482 AbstractCegarLoop]: Abstraction has 50007 states and 146780 transitions. [2021-06-05 12:19:58,428 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 4.6875) internal successors, (75), 16 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:58,428 INFO L276 IsEmpty]: Start isEmpty. Operand 50007 states and 146780 transitions. [2021-06-05 12:19:58,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2021-06-05 12:19:58,449 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:19:58,449 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:19:58,655 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2021-06-05 12:19:58,656 INFO L430 AbstractCegarLoop]: === Iteration 18 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:19:58,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:19:58,656 INFO L82 PathProgramCache]: Analyzing trace with hash 340370722, now seen corresponding path program 1 times [2021-06-05 12:19:58,656 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:19:58,656 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502496104] [2021-06-05 12:19:58,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:19:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:19:58,710 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2021-06-05 12:19:58,711 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:19:58,711 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502496104] [2021-06-05 12:19:58,711 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502496104] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:19:58,711 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:19:58,711 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-05 12:19:58,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341374186] [2021-06-05 12:19:58,711 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-05 12:19:58,711 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:19:58,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-05 12:19:58,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-05 12:19:58,711 INFO L87 Difference]: Start difference. First operand 50007 states and 146780 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:19:59,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:19:59,045 INFO L93 Difference]: Finished difference Result 73239 states and 212868 transitions. [2021-06-05 12:19:59,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-06-05 12:19:59,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2021-06-05 12:19:59,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:19:59,154 INFO L225 Difference]: With dead ends: 73239 [2021-06-05 12:19:59,155 INFO L226 Difference]: Without dead ends: 73239 [2021-06-05 12:19:59,155 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 54.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:20:00,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73239 states. [2021-06-05 12:20:00,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73239 to 62023. [2021-06-05 12:20:00,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62023 states, 62014 states have (on average 2.922630373786564) internal successors, (181244), 62022 states have internal predecessors, (181244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:01,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62023 states to 62023 states and 181244 transitions. [2021-06-05 12:20:01,002 INFO L78 Accepts]: Start accepts. Automaton has 62023 states and 181244 transitions. Word has length 125 [2021-06-05 12:20:01,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:01,002 INFO L482 AbstractCegarLoop]: Abstraction has 62023 states and 181244 transitions. [2021-06-05 12:20:01,002 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 7 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:01,002 INFO L276 IsEmpty]: Start isEmpty. Operand 62023 states and 181244 transitions. [2021-06-05 12:20:01,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:20:01,023 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:01,023 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:20:01,024 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2021-06-05 12:20:01,024 INFO L430 AbstractCegarLoop]: === Iteration 19 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:01,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:01,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1989964639, now seen corresponding path program 1 times [2021-06-05 12:20:01,024 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:01,024 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569493440] [2021-06-05 12:20:01,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:01,274 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:20:01,274 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:01,274 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569493440] [2021-06-05 12:20:01,275 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569493440] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:20:01,275 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:20:01,275 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 12:20:01,275 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564507500] [2021-06-05 12:20:01,275 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 12:20:01,275 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:01,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 12:20:01,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-06-05 12:20:01,275 INFO L87 Difference]: Start difference. First operand 62023 states and 181244 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:02,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:02,492 INFO L93 Difference]: Finished difference Result 139569 states and 406835 transitions. [2021-06-05 12:20:02,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 12:20:02,492 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:20:02,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:03,156 INFO L225 Difference]: With dead ends: 139569 [2021-06-05 12:20:03,156 INFO L226 Difference]: Without dead ends: 139569 [2021-06-05 12:20:03,156 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 474.8ms TimeCoverageRelationStatistics Valid=149, Invalid=313, Unknown=0, NotChecked=0, Total=462 [2021-06-05 12:20:04,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139569 states. [2021-06-05 12:20:05,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139569 to 67662. [2021-06-05 12:20:05,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67662 states, 67653 states have (on average 2.9109721667923076) internal successors, (196936), 67661 states have internal predecessors, (196936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:05,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67662 states to 67662 states and 196936 transitions. [2021-06-05 12:20:05,588 INFO L78 Accepts]: Start accepts. Automaton has 67662 states and 196936 transitions. Word has length 128 [2021-06-05 12:20:05,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:05,588 INFO L482 AbstractCegarLoop]: Abstraction has 67662 states and 196936 transitions. [2021-06-05 12:20:05,588 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:05,588 INFO L276 IsEmpty]: Start isEmpty. Operand 67662 states and 196936 transitions. [2021-06-05 12:20:05,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:20:05,611 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:05,611 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:20:05,611 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2021-06-05 12:20:05,611 INFO L430 AbstractCegarLoop]: === Iteration 20 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:05,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:05,612 INFO L82 PathProgramCache]: Analyzing trace with hash 379231786, now seen corresponding path program 1 times [2021-06-05 12:20:05,612 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:05,612 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097583540] [2021-06-05 12:20:05,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:06,075 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2021-06-05 12:20:06,075 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:06,075 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097583540] [2021-06-05 12:20:06,075 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097583540] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:06,076 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1217045573] [2021-06-05 12:20:06,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:06,167 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 12:20:06,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:06,406 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 12:20:06,407 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:06,408 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:06,408 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:06,408 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2021-06-05 12:20:06,497 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:20:06,498 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1217045573] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:20:06,498 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:20:06,498 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2021-06-05 12:20:06,498 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660539652] [2021-06-05 12:20:06,498 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 12:20:06,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:06,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 12:20:06,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2021-06-05 12:20:06,498 INFO L87 Difference]: Start difference. First operand 67662 states and 196936 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:07,921 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2021-06-05 12:20:08,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:08,760 INFO L93 Difference]: Finished difference Result 205404 states and 598861 transitions. [2021-06-05 12:20:08,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 12:20:08,761 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:20:08,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:09,180 INFO L225 Difference]: With dead ends: 205404 [2021-06-05 12:20:09,180 INFO L226 Difference]: Without dead ends: 205404 [2021-06-05 12:20:09,181 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 141 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 985.1ms TimeCoverageRelationStatistics Valid=262, Invalid=1630, Unknown=0, NotChecked=0, Total=1892 [2021-06-05 12:20:10,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205404 states. [2021-06-05 12:20:12,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205404 to 68707. [2021-06-05 12:20:12,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68707 states, 68698 states have (on average 2.9042184634196047) internal successors, (199514), 68706 states have internal predecessors, (199514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:12,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68707 states to 68707 states and 199514 transitions. [2021-06-05 12:20:12,347 INFO L78 Accepts]: Start accepts. Automaton has 68707 states and 199514 transitions. Word has length 128 [2021-06-05 12:20:12,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:12,348 INFO L482 AbstractCegarLoop]: Abstraction has 68707 states and 199514 transitions. [2021-06-05 12:20:12,348 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:12,348 INFO L276 IsEmpty]: Start isEmpty. Operand 68707 states and 199514 transitions. [2021-06-05 12:20:12,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:20:12,371 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:12,371 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:20:12,572 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48,41 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:12,573 INFO L430 AbstractCegarLoop]: === Iteration 21 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:12,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:12,573 INFO L82 PathProgramCache]: Analyzing trace with hash -269413182, now seen corresponding path program 2 times [2021-06-05 12:20:12,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:12,573 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815015818] [2021-06-05 12:20:12,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:13,136 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2021-06-05 12:20:13,136 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:13,136 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815015818] [2021-06-05 12:20:13,136 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815015818] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:13,136 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670089358] [2021-06-05 12:20:13,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:13,236 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:20:13,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:20:13,237 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 12:20:13,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:13,481 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 12:20:13,481 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:13,482 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:13,483 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:13,483 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:20:13,511 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:20:13,511 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 12:20:13,512 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:13,513 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:13,513 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:13,514 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 12:20:13,833 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 12:20:13,833 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:13,836 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:13,837 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:13,837 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2021-06-05 12:20:13,869 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 12:20:13,871 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:13,875 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:13,875 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:13,875 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 12:20:13,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-06-05 12:20:13,915 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:13,920 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:13,922 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:20:13,922 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2021-06-05 12:20:13,967 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:20:13,967 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670089358] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:20:13,967 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:20:13,967 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [19] total 30 [2021-06-05 12:20:13,967 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420689746] [2021-06-05 12:20:13,968 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:20:13,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:13,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:20:13,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=782, Unknown=0, NotChecked=0, Total=870 [2021-06-05 12:20:13,968 INFO L87 Difference]: Start difference. First operand 68707 states and 199514 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:17,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:17,014 INFO L93 Difference]: Finished difference Result 178850 states and 520392 transitions. [2021-06-05 12:20:17,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-06-05 12:20:17,015 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:20:17,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:17,301 INFO L225 Difference]: With dead ends: 178850 [2021-06-05 12:20:17,301 INFO L226 Difference]: Without dead ends: 178850 [2021-06-05 12:20:17,301 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 119 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1098 ImplicationChecksByTransitivity, 2179.5ms TimeCoverageRelationStatistics Valid=757, Invalid=3935, Unknown=0, NotChecked=0, Total=4692 [2021-06-05 12:20:18,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178850 states. [2021-06-05 12:20:19,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178850 to 68124. [2021-06-05 12:20:20,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68124 states, 68115 states have (on average 2.904822726271746) internal successors, (197862), 68123 states have internal predecessors, (197862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:20,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68124 states to 68124 states and 197862 transitions. [2021-06-05 12:20:20,187 INFO L78 Accepts]: Start accepts. Automaton has 68124 states and 197862 transitions. Word has length 128 [2021-06-05 12:20:20,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:20,187 INFO L482 AbstractCegarLoop]: Abstraction has 68124 states and 197862 transitions. [2021-06-05 12:20:20,187 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:20,187 INFO L276 IsEmpty]: Start isEmpty. Operand 68124 states and 197862 transitions. [2021-06-05 12:20:20,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:20:20,210 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:20,210 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:20:20,410 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2021-06-05 12:20:20,416 INFO L430 AbstractCegarLoop]: === Iteration 22 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:20,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:20,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1435639602, now seen corresponding path program 3 times [2021-06-05 12:20:20,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:20,416 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298430257] [2021-06-05 12:20:20,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:20,651 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:20:20,651 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:20,651 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298430257] [2021-06-05 12:20:20,652 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298430257] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:20:20,652 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:20:20,652 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 12:20:20,652 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989082313] [2021-06-05 12:20:20,652 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:20:20,652 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:20,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:20:20,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:20:20,653 INFO L87 Difference]: Start difference. First operand 68124 states and 197862 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:22,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:22,302 INFO L93 Difference]: Finished difference Result 174153 states and 507410 transitions. [2021-06-05 12:20:22,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-06-05 12:20:22,302 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:20:22,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:22,577 INFO L225 Difference]: With dead ends: 174153 [2021-06-05 12:20:22,577 INFO L226 Difference]: Without dead ends: 174153 [2021-06-05 12:20:22,577 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 496.2ms TimeCoverageRelationStatistics Valid=146, Invalid=274, Unknown=0, NotChecked=0, Total=420 [2021-06-05 12:20:23,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174153 states. [2021-06-05 12:20:25,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174153 to 69048. [2021-06-05 12:20:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69048 states, 69039 states have (on average 2.9051985109865437) internal successors, (200572), 69047 states have internal predecessors, (200572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:25,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69048 states to 69048 states and 200572 transitions. [2021-06-05 12:20:25,514 INFO L78 Accepts]: Start accepts. Automaton has 69048 states and 200572 transitions. Word has length 128 [2021-06-05 12:20:25,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:25,514 INFO L482 AbstractCegarLoop]: Abstraction has 69048 states and 200572 transitions. [2021-06-05 12:20:25,514 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:25,515 INFO L276 IsEmpty]: Start isEmpty. Operand 69048 states and 200572 transitions. [2021-06-05 12:20:25,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:20:25,537 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:25,537 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:20:25,538 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2021-06-05 12:20:25,538 INFO L430 AbstractCegarLoop]: === Iteration 23 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:25,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:25,538 INFO L82 PathProgramCache]: Analyzing trace with hash 607674768, now seen corresponding path program 4 times [2021-06-05 12:20:25,538 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:25,538 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167482641] [2021-06-05 12:20:25,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:25,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:25,747 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:20:25,747 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:25,747 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167482641] [2021-06-05 12:20:25,747 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167482641] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:20:25,747 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:20:25,747 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 12:20:25,747 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616212729] [2021-06-05 12:20:25,747 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:20:25,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:25,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:20:25,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:20:25,748 INFO L87 Difference]: Start difference. First operand 69048 states and 200572 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:27,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:27,483 INFO L93 Difference]: Finished difference Result 183283 states and 533387 transitions. [2021-06-05 12:20:27,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 12:20:27,484 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:20:27,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:28,077 INFO L225 Difference]: With dead ends: 183283 [2021-06-05 12:20:28,078 INFO L226 Difference]: Without dead ends: 183283 [2021-06-05 12:20:28,078 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 666.2ms TimeCoverageRelationStatistics Valid=248, Invalid=564, Unknown=0, NotChecked=0, Total=812 [2021-06-05 12:20:29,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183283 states. [2021-06-05 12:20:30,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183283 to 69048. [2021-06-05 12:20:30,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69048 states, 69039 states have (on average 2.9051985109865437) internal successors, (200572), 69047 states have internal predecessors, (200572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:30,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69048 states to 69048 states and 200572 transitions. [2021-06-05 12:20:30,810 INFO L78 Accepts]: Start accepts. Automaton has 69048 states and 200572 transitions. Word has length 128 [2021-06-05 12:20:30,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:30,810 INFO L482 AbstractCegarLoop]: Abstraction has 69048 states and 200572 transitions. [2021-06-05 12:20:30,810 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:30,810 INFO L276 IsEmpty]: Start isEmpty. Operand 69048 states and 200572 transitions. [2021-06-05 12:20:30,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:20:30,834 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:30,834 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:20:30,834 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2021-06-05 12:20:30,834 INFO L430 AbstractCegarLoop]: === Iteration 24 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:30,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:30,834 INFO L82 PathProgramCache]: Analyzing trace with hash -311672458, now seen corresponding path program 5 times [2021-06-05 12:20:30,834 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:30,834 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111865510] [2021-06-05 12:20:30,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:30,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:31,543 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2021-06-05 12:20:31,543 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:31,543 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111865510] [2021-06-05 12:20:31,543 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111865510] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:31,543 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882897097] [2021-06-05 12:20:31,543 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 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 12:20:31,644 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2021-06-05 12:20:31,644 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:20:31,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 12:20:31,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:31,824 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 12:20:31,825 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:31,826 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:31,827 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:31,827 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2021-06-05 12:20:31,860 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:20:31,860 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882897097] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:20:31,860 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:20:31,860 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2021-06-05 12:20:31,860 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46474051] [2021-06-05 12:20:31,860 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 12:20:31,860 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:31,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 12:20:31,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2021-06-05 12:20:31,861 INFO L87 Difference]: Start difference. First operand 69048 states and 200572 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:33,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:33,695 INFO L93 Difference]: Finished difference Result 231155 states and 673377 transitions. [2021-06-05 12:20:33,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2021-06-05 12:20:33,696 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:20:33,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:34,102 INFO L225 Difference]: With dead ends: 231155 [2021-06-05 12:20:34,102 INFO L226 Difference]: Without dead ends: 231155 [2021-06-05 12:20:34,102 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 146 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 740.9ms TimeCoverageRelationStatistics Valid=311, Invalid=2041, Unknown=0, NotChecked=0, Total=2352 [2021-06-05 12:20:35,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231155 states. [2021-06-05 12:20:37,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231155 to 70093. [2021-06-05 12:20:37,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70093 states, 70084 states have (on average 2.898664459791108) internal successors, (203150), 70092 states have internal predecessors, (203150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70093 states to 70093 states and 203150 transitions. [2021-06-05 12:20:37,432 INFO L78 Accepts]: Start accepts. Automaton has 70093 states and 203150 transitions. Word has length 128 [2021-06-05 12:20:37,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:37,433 INFO L482 AbstractCegarLoop]: Abstraction has 70093 states and 203150 transitions. [2021-06-05 12:20:37,433 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:37,433 INFO L276 IsEmpty]: Start isEmpty. Operand 70093 states and 203150 transitions. [2021-06-05 12:20:37,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:20:37,456 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:37,456 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:20:37,657 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,43 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:37,657 INFO L430 AbstractCegarLoop]: === Iteration 25 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:37,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:37,657 INFO L82 PathProgramCache]: Analyzing trace with hash -960317426, now seen corresponding path program 6 times [2021-06-05 12:20:37,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:37,658 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493784094] [2021-06-05 12:20:37,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:38,161 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2021-06-05 12:20:38,161 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:38,161 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493784094] [2021-06-05 12:20:38,161 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493784094] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:38,161 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1576984965] [2021-06-05 12:20:38,161 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 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 12:20:38,265 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2021-06-05 12:20:38,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:20:38,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 12:20:38,267 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:38,277 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-06-05 12:20:38,278 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:38,279 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:38,279 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:38,279 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:20:38,303 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:20:38,303 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 12:20:38,304 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:38,306 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:38,306 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:38,306 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 12:20:38,519 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 12:20:38,520 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:38,523 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:38,523 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:38,523 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2021-06-05 12:20:38,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, 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 12:20:38,558 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:38,561 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:38,562 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:38,562 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 12:20:38,608 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-06-05 12:20:38,609 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:38,614 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:38,616 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:20:38,616 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2021-06-05 12:20:38,654 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:20:38,654 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1576984965] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:20:38,655 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:20:38,655 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [19] total 30 [2021-06-05 12:20:38,655 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542750835] [2021-06-05 12:20:38,655 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:20:38,655 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:38,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:20:38,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2021-06-05 12:20:38,655 INFO L87 Difference]: Start difference. First operand 70093 states and 203150 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:39,439 WARN L205 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2021-06-05 12:20:42,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:42,106 INFO L93 Difference]: Finished difference Result 196076 states and 569943 transitions. [2021-06-05 12:20:42,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2021-06-05 12:20:42,107 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:20:42,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:42,415 INFO L225 Difference]: With dead ends: 196076 [2021-06-05 12:20:42,415 INFO L226 Difference]: Without dead ends: 196076 [2021-06-05 12:20:42,415 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 119 SyntacticMatches, 4 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1314 ImplicationChecksByTransitivity, 2338.7ms TimeCoverageRelationStatistics Valid=836, Invalid=4420, Unknown=0, NotChecked=0, Total=5256 [2021-06-05 12:20:43,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196076 states. [2021-06-05 12:20:45,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196076 to 69048. [2021-06-05 12:20:45,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69048 states, 69039 states have (on average 2.9051985109865437) internal successors, (200572), 69047 states have internal predecessors, (200572), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:45,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69048 states to 69048 states and 200572 transitions. [2021-06-05 12:20:45,412 INFO L78 Accepts]: Start accepts. Automaton has 69048 states and 200572 transitions. Word has length 128 [2021-06-05 12:20:45,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:45,412 INFO L482 AbstractCegarLoop]: Abstraction has 69048 states and 200572 transitions. [2021-06-05 12:20:45,412 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:45,412 INFO L276 IsEmpty]: Start isEmpty. Operand 69048 states and 200572 transitions. [2021-06-05 12:20:45,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:20:45,435 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:45,435 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:20:45,635 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,44 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:45,635 INFO L430 AbstractCegarLoop]: === Iteration 26 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:45,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:45,636 INFO L82 PathProgramCache]: Analyzing trace with hash -107231536, now seen corresponding path program 7 times [2021-06-05 12:20:45,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:45,636 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536576134] [2021-06-05 12:20:45,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:20:45,827 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:45,827 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536576134] [2021-06-05 12:20:45,827 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536576134] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:20:45,827 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:20:45,827 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 12:20:45,827 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551014901] [2021-06-05 12:20:45,827 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:20:45,827 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:45,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:20:45,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:20:45,828 INFO L87 Difference]: Start difference. First operand 69048 states and 200572 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:47,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:47,559 INFO L93 Difference]: Finished difference Result 206405 states and 601586 transitions. [2021-06-05 12:20:47,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2021-06-05 12:20:47,559 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:20:47,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:47,920 INFO L225 Difference]: With dead ends: 206405 [2021-06-05 12:20:47,920 INFO L226 Difference]: Without dead ends: 206405 [2021-06-05 12:20:47,920 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 491.9ms TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2021-06-05 12:20:49,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206405 states. [2021-06-05 12:20:50,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206405 to 69708. [2021-06-05 12:20:50,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69708 states, 69699 states have (on average 2.905708833699192) internal successors, (202525), 69707 states have internal predecessors, (202525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:50,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69708 states to 69708 states and 202525 transitions. [2021-06-05 12:20:50,983 INFO L78 Accepts]: Start accepts. Automaton has 69708 states and 202525 transitions. Word has length 128 [2021-06-05 12:20:50,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:50,983 INFO L482 AbstractCegarLoop]: Abstraction has 69708 states and 202525 transitions. [2021-06-05 12:20:50,983 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:50,983 INFO L276 IsEmpty]: Start isEmpty. Operand 69708 states and 202525 transitions. [2021-06-05 12:20:51,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:20:51,004 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:51,005 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:20:51,005 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2021-06-05 12:20:51,005 INFO L430 AbstractCegarLoop]: === Iteration 27 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:51,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:51,005 INFO L82 PathProgramCache]: Analyzing trace with hash 7722576, now seen corresponding path program 8 times [2021-06-05 12:20:51,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:51,005 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619058743] [2021-06-05 12:20:51,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:51,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:51,195 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:20:51,195 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:51,195 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619058743] [2021-06-05 12:20:51,195 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619058743] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:20:51,195 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:20:51,195 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 12:20:51,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415471127] [2021-06-05 12:20:51,195 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:20:51,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:51,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:20:51,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:20:51,196 INFO L87 Difference]: Start difference. First operand 69708 states and 202525 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:53,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:53,198 INFO L93 Difference]: Finished difference Result 215535 states and 627563 transitions. [2021-06-05 12:20:53,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 12:20:53,208 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:20:53,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:53,562 INFO L225 Difference]: With dead ends: 215535 [2021-06-05 12:20:53,562 INFO L226 Difference]: Without dead ends: 215535 [2021-06-05 12:20:53,563 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 969.6ms TimeCoverageRelationStatistics Valid=305, Invalid=751, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 12:20:55,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215535 states. [2021-06-05 12:20:56,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215535 to 69686. [2021-06-05 12:20:56,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69686 states, 69677 states have (on average 2.905707765833776) internal successors, (202461), 69685 states have internal predecessors, (202461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:56,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69686 states to 69686 states and 202461 transitions. [2021-06-05 12:20:56,690 INFO L78 Accepts]: Start accepts. Automaton has 69686 states and 202461 transitions. Word has length 128 [2021-06-05 12:20:56,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:20:56,690 INFO L482 AbstractCegarLoop]: Abstraction has 69686 states and 202461 transitions. [2021-06-05 12:20:56,690 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:56,690 INFO L276 IsEmpty]: Start isEmpty. Operand 69686 states and 202461 transitions. [2021-06-05 12:20:56,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:20:56,715 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:20:56,716 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:20:56,716 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2021-06-05 12:20:56,716 INFO L430 AbstractCegarLoop]: === Iteration 28 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:20:56,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:20:56,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1335167986, now seen corresponding path program 9 times [2021-06-05 12:20:56,716 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:20:56,716 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265304514] [2021-06-05 12:20:56,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:20:56,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:20:57,120 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2021-06-05 12:20:57,120 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:20:57,120 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265304514] [2021-06-05 12:20:57,120 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265304514] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:20:57,120 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617649406] [2021-06-05 12:20:57,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:20:57,204 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 12:20:57,204 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:20:57,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 12:20:57,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:20:57,379 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 12:20:57,379 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:20:57,380 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:20:57,381 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:20:57,381 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2021-06-05 12:20:57,415 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:20:57,415 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617649406] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:20:57,415 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:20:57,415 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2021-06-05 12:20:57,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783116634] [2021-06-05 12:20:57,415 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 12:20:57,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:20:57,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 12:20:57,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2021-06-05 12:20:57,416 INFO L87 Difference]: Start difference. First operand 69686 states and 202461 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:20:59,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:20:59,252 INFO L93 Difference]: Finished difference Result 246423 states and 717353 transitions. [2021-06-05 12:20:59,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-06-05 12:20:59,252 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:20:59,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:20:59,732 INFO L225 Difference]: With dead ends: 246423 [2021-06-05 12:20:59,732 INFO L226 Difference]: Without dead ends: 246423 [2021-06-05 12:20:59,733 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 148 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 739.6ms TimeCoverageRelationStatistics Valid=327, Invalid=2223, Unknown=0, NotChecked=0, Total=2550 [2021-06-05 12:21:01,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246423 states. [2021-06-05 12:21:03,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246423 to 70731. [2021-06-05 12:21:03,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70731 states, 70722 states have (on average 2.899225135035774) internal successors, (205039), 70730 states have internal predecessors, (205039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:03,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70731 states to 70731 states and 205039 transitions. [2021-06-05 12:21:03,447 INFO L78 Accepts]: Start accepts. Automaton has 70731 states and 205039 transitions. Word has length 128 [2021-06-05 12:21:03,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:03,448 INFO L482 AbstractCegarLoop]: Abstraction has 70731 states and 205039 transitions. [2021-06-05 12:21:03,448 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:03,448 INFO L276 IsEmpty]: Start isEmpty. Operand 70731 states and 205039 transitions. [2021-06-05 12:21:03,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:21:03,474 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:03,474 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:21:03,675 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2021-06-05 12:21:03,675 INFO L430 AbstractCegarLoop]: === Iteration 29 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:03,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:03,675 INFO L82 PathProgramCache]: Analyzing trace with hash 686523018, now seen corresponding path program 10 times [2021-06-05 12:21:03,675 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:03,675 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609576390] [2021-06-05 12:21:03,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:04,158 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2021-06-05 12:21:04,158 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:04,158 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609576390] [2021-06-05 12:21:04,158 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609576390] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:04,158 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107277825] [2021-06-05 12:21:04,158 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 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 12:21:04,244 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-06-05 12:21:04,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:21:04,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 12:21:04,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:21:04,258 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 12:21:04,259 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:04,260 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:04,260 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:04,260 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:21:04,284 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:21:04,284 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2021-06-05 12:21:04,285 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:04,286 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:04,287 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:04,287 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 12:21:04,493 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 12:21:04,494 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:04,496 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:04,497 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:04,497 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2021-06-05 12:21:04,528 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 12:21:04,529 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:04,534 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:04,534 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:04,534 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 12:21:04,573 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-06-05 12:21:04,575 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:04,579 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:04,581 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:21:04,581 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2021-06-05 12:21:04,619 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:21:04,619 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107277825] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:21:04,619 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:21:04,620 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [19] total 30 [2021-06-05 12:21:04,620 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027446393] [2021-06-05 12:21:04,620 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:21:04,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:04,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:21:04,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2021-06-05 12:21:04,620 INFO L87 Difference]: Start difference. First operand 70731 states and 205039 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:07,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:07,925 INFO L93 Difference]: Finished difference Result 213401 states and 620024 transitions. [2021-06-05 12:21:07,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2021-06-05 12:21:07,926 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:21:07,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:08,601 INFO L225 Difference]: With dead ends: 213401 [2021-06-05 12:21:08,601 INFO L226 Difference]: Without dead ends: 213401 [2021-06-05 12:21:08,609 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 119 SyntacticMatches, 4 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1374 ImplicationChecksByTransitivity, 2345.7ms TimeCoverageRelationStatistics Valid=846, Invalid=4556, Unknown=0, NotChecked=0, Total=5402 [2021-06-05 12:21:09,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213401 states. [2021-06-05 12:21:11,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213401 to 69642. [2021-06-05 12:21:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69642 states, 69633 states have (on average 2.905705628078641) internal successors, (202333), 69641 states have internal predecessors, (202333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:11,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69642 states to 69642 states and 202333 transitions. [2021-06-05 12:21:11,758 INFO L78 Accepts]: Start accepts. Automaton has 69642 states and 202333 transitions. Word has length 128 [2021-06-05 12:21:11,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:11,758 INFO L482 AbstractCegarLoop]: Abstraction has 69642 states and 202333 transitions. [2021-06-05 12:21:11,758 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:11,759 INFO L276 IsEmpty]: Start isEmpty. Operand 69642 states and 202333 transitions. [2021-06-05 12:21:11,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:21:11,781 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:11,781 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:21:11,992 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2021-06-05 12:21:11,993 INFO L430 AbstractCegarLoop]: === Iteration 30 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:11,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:11,993 INFO L82 PathProgramCache]: Analyzing trace with hash -359358896, now seen corresponding path program 11 times [2021-06-05 12:21:11,993 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:11,993 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043223731] [2021-06-05 12:21:11,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:12,192 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:21:12,192 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:12,192 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043223731] [2021-06-05 12:21:12,192 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043223731] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:21:12,192 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:21:12,192 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 12:21:12,192 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212961322] [2021-06-05 12:21:12,192 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:21:12,192 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:12,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:21:12,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:21:12,193 INFO L87 Difference]: Start difference. First operand 69642 states and 202333 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:13,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:13,513 INFO L93 Difference]: Finished difference Result 189575 states and 551405 transitions. [2021-06-05 12:21:13,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-06-05 12:21:13,514 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:21:13,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:13,818 INFO L225 Difference]: With dead ends: 189575 [2021-06-05 12:21:13,818 INFO L226 Difference]: Without dead ends: 189575 [2021-06-05 12:21:13,818 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 430.0ms TimeCoverageRelationStatistics Valid=150, Invalid=312, Unknown=0, NotChecked=0, Total=462 [2021-06-05 12:21:15,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189575 states. [2021-06-05 12:21:16,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189575 to 69697. [2021-06-05 12:21:16,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69697 states, 69688 states have (on average 2.9057082998507635) internal successors, (202493), 69696 states have internal predecessors, (202493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:17,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69697 states to 69697 states and 202493 transitions. [2021-06-05 12:21:17,054 INFO L78 Accepts]: Start accepts. Automaton has 69697 states and 202493 transitions. Word has length 128 [2021-06-05 12:21:17,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:17,054 INFO L482 AbstractCegarLoop]: Abstraction has 69697 states and 202493 transitions. [2021-06-05 12:21:17,054 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:17,054 INFO L276 IsEmpty]: Start isEmpty. Operand 69697 states and 202493 transitions. [2021-06-05 12:21:17,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:21:17,080 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:17,080 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:21:17,080 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2021-06-05 12:21:17,080 INFO L430 AbstractCegarLoop]: === Iteration 31 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:17,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:17,080 INFO L82 PathProgramCache]: Analyzing trace with hash -244404784, now seen corresponding path program 12 times [2021-06-05 12:21:17,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:17,080 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977784512] [2021-06-05 12:21:17,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:17,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:17,585 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:21:17,585 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:17,586 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977784512] [2021-06-05 12:21:17,586 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977784512] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:21:17,586 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:21:17,586 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 12:21:17,586 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283200473] [2021-06-05 12:21:17,586 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:21:17,586 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:17,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:21:17,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:21:17,586 INFO L87 Difference]: Start difference. First operand 69697 states and 202493 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:19,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:19,310 INFO L93 Difference]: Finished difference Result 186143 states and 541476 transitions. [2021-06-05 12:21:19,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-06-05 12:21:19,310 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:21:19,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:19,918 INFO L225 Difference]: With dead ends: 186143 [2021-06-05 12:21:19,918 INFO L226 Difference]: Without dead ends: 186143 [2021-06-05 12:21:19,918 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 721.7ms TimeCoverageRelationStatistics Valid=239, Invalid=573, Unknown=0, NotChecked=0, Total=812 [2021-06-05 12:21:21,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186143 states. [2021-06-05 12:21:22,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186143 to 69675. [2021-06-05 12:21:22,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69675 states, 69666 states have (on average 2.9057072316481496) internal successors, (202429), 69674 states have internal predecessors, (202429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:22,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69675 states to 69675 states and 202429 transitions. [2021-06-05 12:21:22,603 INFO L78 Accepts]: Start accepts. Automaton has 69675 states and 202429 transitions. Word has length 128 [2021-06-05 12:21:22,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:22,603 INFO L482 AbstractCegarLoop]: Abstraction has 69675 states and 202429 transitions. [2021-06-05 12:21:22,603 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:22,604 INFO L276 IsEmpty]: Start isEmpty. Operand 69675 states and 202429 transitions. [2021-06-05 12:21:22,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:21:22,628 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:22,628 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:21:22,628 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2021-06-05 12:21:22,629 INFO L430 AbstractCegarLoop]: === Iteration 32 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:22,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:22,629 INFO L82 PathProgramCache]: Analyzing trace with hash -356540946, now seen corresponding path program 13 times [2021-06-05 12:21:22,629 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:22,629 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327493359] [2021-06-05 12:21:22,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:22,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:23,084 WARN L205 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 25 [2021-06-05 12:21:23,089 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:21:23,089 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:23,089 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327493359] [2021-06-05 12:21:23,089 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327493359] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:21:23,089 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:21:23,089 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 12:21:23,089 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864951503] [2021-06-05 12:21:23,090 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:21:23,090 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:23,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:21:23,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:21:23,090 INFO L87 Difference]: Start difference. First operand 69675 states and 202429 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:24,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:24,091 INFO L93 Difference]: Finished difference Result 143298 states and 416561 transitions. [2021-06-05 12:21:24,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 12:21:24,092 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:21:24,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:24,314 INFO L225 Difference]: With dead ends: 143298 [2021-06-05 12:21:24,314 INFO L226 Difference]: Without dead ends: 143298 [2021-06-05 12:21:24,314 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 585.5ms TimeCoverageRelationStatistics Valid=99, Invalid=173, Unknown=0, NotChecked=0, Total=272 [2021-06-05 12:21:25,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143298 states. [2021-06-05 12:21:26,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143298 to 70104. [2021-06-05 12:21:26,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70104 states, 70095 states have (on average 2.9058848705328484) internal successors, (203688), 70103 states have internal predecessors, (203688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:26,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70104 states to 70104 states and 203688 transitions. [2021-06-05 12:21:26,893 INFO L78 Accepts]: Start accepts. Automaton has 70104 states and 203688 transitions. Word has length 128 [2021-06-05 12:21:26,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:26,893 INFO L482 AbstractCegarLoop]: Abstraction has 70104 states and 203688 transitions. [2021-06-05 12:21:26,893 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:26,893 INFO L276 IsEmpty]: Start isEmpty. Operand 70104 states and 203688 transitions. [2021-06-05 12:21:26,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:21:26,918 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:26,918 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:21:26,918 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2021-06-05 12:21:26,918 INFO L430 AbstractCegarLoop]: === Iteration 33 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:26,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:26,919 INFO L82 PathProgramCache]: Analyzing trace with hash 225498810, now seen corresponding path program 14 times [2021-06-05 12:21:26,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:26,919 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60325808] [2021-06-05 12:21:26,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:26,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:27,142 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:21:27,142 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:27,142 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60325808] [2021-06-05 12:21:27,142 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60325808] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:21:27,142 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:21:27,143 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 12:21:27,143 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510974781] [2021-06-05 12:21:27,143 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 12:21:27,143 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:27,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 12:21:27,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2021-06-05 12:21:27,144 INFO L87 Difference]: Start difference. First operand 70104 states and 203688 transitions. Second operand has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:28,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:28,626 INFO L93 Difference]: Finished difference Result 146232 states and 425409 transitions. [2021-06-05 12:21:28,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 12:21:28,637 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:21:28,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:28,859 INFO L225 Difference]: With dead ends: 146232 [2021-06-05 12:21:28,860 INFO L226 Difference]: Without dead ends: 146232 [2021-06-05 12:21:28,860 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 495.8ms TimeCoverageRelationStatistics Valid=144, Invalid=318, Unknown=0, NotChecked=0, Total=462 [2021-06-05 12:21:29,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146232 states. [2021-06-05 12:21:31,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146232 to 70533. [2021-06-05 12:21:31,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70533 states, 70524 states have (on average 2.906060348250241) internal successors, (204947), 70532 states have internal predecessors, (204947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:31,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70533 states to 70533 states and 204947 transitions. [2021-06-05 12:21:31,288 INFO L78 Accepts]: Start accepts. Automaton has 70533 states and 204947 transitions. Word has length 128 [2021-06-05 12:21:31,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:31,288 INFO L482 AbstractCegarLoop]: Abstraction has 70533 states and 204947 transitions. [2021-06-05 12:21:31,288 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.916666666666667) internal successors, (83), 12 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:31,290 INFO L276 IsEmpty]: Start isEmpty. Operand 70533 states and 204947 transitions. [2021-06-05 12:21:31,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:21:31,315 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:31,315 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:21:31,315 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2021-06-05 12:21:31,315 INFO L430 AbstractCegarLoop]: === Iteration 34 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:31,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:31,316 INFO L82 PathProgramCache]: Analyzing trace with hash 661885712, now seen corresponding path program 15 times [2021-06-05 12:21:31,316 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:31,316 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470286397] [2021-06-05 12:21:31,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:31,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:31,545 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:21:31,545 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:31,545 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470286397] [2021-06-05 12:21:31,545 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470286397] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:21:31,545 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:21:31,545 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 12:21:31,545 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453050475] [2021-06-05 12:21:31,545 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:21:31,545 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:31,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:21:31,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:21:31,546 INFO L87 Difference]: Start difference. First operand 70533 states and 204947 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:33,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:33,141 INFO L93 Difference]: Finished difference Result 174326 states and 507368 transitions. [2021-06-05 12:21:33,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 12:21:33,141 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:21:33,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:33,427 INFO L225 Difference]: With dead ends: 174326 [2021-06-05 12:21:33,427 INFO L226 Difference]: Without dead ends: 174326 [2021-06-05 12:21:33,428 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 582.1ms TimeCoverageRelationStatistics Valid=203, Invalid=397, Unknown=0, NotChecked=0, Total=600 [2021-06-05 12:21:34,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174326 states. [2021-06-05 12:21:35,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174326 to 70921. [2021-06-05 12:21:36,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70921 states, 70912 states have (on average 2.9062641019855597) internal successors, (206089), 70920 states have internal predecessors, (206089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:36,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70921 states to 70921 states and 206089 transitions. [2021-06-05 12:21:36,199 INFO L78 Accepts]: Start accepts. Automaton has 70921 states and 206089 transitions. Word has length 128 [2021-06-05 12:21:36,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:36,199 INFO L482 AbstractCegarLoop]: Abstraction has 70921 states and 206089 transitions. [2021-06-05 12:21:36,199 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:36,200 INFO L276 IsEmpty]: Start isEmpty. Operand 70921 states and 206089 transitions. [2021-06-05 12:21:36,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:21:36,226 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:36,226 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:21:36,226 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2021-06-05 12:21:36,226 INFO L430 AbstractCegarLoop]: === Iteration 35 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:36,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:36,226 INFO L82 PathProgramCache]: Analyzing trace with hash 776839824, now seen corresponding path program 16 times [2021-06-05 12:21:36,226 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:36,226 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475258508] [2021-06-05 12:21:36,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:36,484 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:21:36,484 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:36,484 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475258508] [2021-06-05 12:21:36,484 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475258508] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:21:36,484 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:21:36,484 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 12:21:36,484 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755169125] [2021-06-05 12:21:36,484 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:21:36,484 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:36,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:21:36,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:21:36,485 INFO L87 Difference]: Start difference. First operand 70921 states and 206089 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:37,297 WARN L205 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2021-06-05 12:21:38,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:38,766 INFO L93 Difference]: Finished difference Result 169607 states and 494091 transitions. [2021-06-05 12:21:38,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 12:21:38,766 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:21:38,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:39,063 INFO L225 Difference]: With dead ends: 169607 [2021-06-05 12:21:39,063 INFO L226 Difference]: Without dead ends: 169607 [2021-06-05 12:21:39,063 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 1223.1ms TimeCoverageRelationStatistics Valid=329, Invalid=727, Unknown=0, NotChecked=0, Total=1056 [2021-06-05 12:21:40,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169607 states. [2021-06-05 12:21:41,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169607 to 70899. [2021-06-05 12:21:41,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70899 states, 70890 states have (on average 2.9062632247143463) internal successors, (206025), 70898 states have internal predecessors, (206025), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:42,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70899 states to 70899 states and 206025 transitions. [2021-06-05 12:21:42,089 INFO L78 Accepts]: Start accepts. Automaton has 70899 states and 206025 transitions. Word has length 128 [2021-06-05 12:21:42,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:42,089 INFO L482 AbstractCegarLoop]: Abstraction has 70899 states and 206025 transitions. [2021-06-05 12:21:42,089 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:42,089 INFO L276 IsEmpty]: Start isEmpty. Operand 70899 states and 206025 transitions. [2021-06-05 12:21:42,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:21:42,111 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:42,111 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:21:42,111 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2021-06-05 12:21:42,111 INFO L430 AbstractCegarLoop]: === Iteration 36 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:42,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:42,112 INFO L82 PathProgramCache]: Analyzing trace with hash 664703662, now seen corresponding path program 17 times [2021-06-05 12:21:42,112 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:42,112 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693483970] [2021-06-05 12:21:42,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:42,347 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:21:42,347 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:42,347 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693483970] [2021-06-05 12:21:42,347 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693483970] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:21:42,347 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:21:42,347 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 12:21:42,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127681368] [2021-06-05 12:21:42,347 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:21:42,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:42,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:21:42,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:21:42,348 INFO L87 Difference]: Start difference. First operand 70899 states and 206025 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:43,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:43,399 INFO L93 Difference]: Finished difference Result 137751 states and 400209 transitions. [2021-06-05 12:21:43,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 12:21:43,400 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:21:43,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:43,637 INFO L225 Difference]: With dead ends: 137751 [2021-06-05 12:21:43,637 INFO L226 Difference]: Without dead ends: 137751 [2021-06-05 12:21:43,638 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 380.2ms TimeCoverageRelationStatistics Valid=124, Invalid=218, Unknown=0, NotChecked=0, Total=342 [2021-06-05 12:21:44,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137751 states. [2021-06-05 12:21:45,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137751 to 70448. [2021-06-05 12:21:45,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70448 states, 70439 states have (on average 2.906088956401993) internal successors, (204702), 70447 states have internal predecessors, (204702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:46,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70448 states to 70448 states and 204702 transitions. [2021-06-05 12:21:46,017 INFO L78 Accepts]: Start accepts. Automaton has 70448 states and 204702 transitions. Word has length 128 [2021-06-05 12:21:46,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:46,017 INFO L482 AbstractCegarLoop]: Abstraction has 70448 states and 204702 transitions. [2021-06-05 12:21:46,017 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:46,017 INFO L276 IsEmpty]: Start isEmpty. Operand 70448 states and 204702 transitions. [2021-06-05 12:21:46,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:21:46,041 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:46,041 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:21:46,041 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2021-06-05 12:21:46,042 INFO L430 AbstractCegarLoop]: === Iteration 37 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:46,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:46,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1084010582, now seen corresponding path program 18 times [2021-06-05 12:21:46,042 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:46,042 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134970193] [2021-06-05 12:21:46,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:46,240 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:21:46,241 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:46,241 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134970193] [2021-06-05 12:21:46,241 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134970193] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:21:46,241 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:21:46,241 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 12:21:46,241 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74776329] [2021-06-05 12:21:46,241 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:21:46,241 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:46,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:21:46,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:21:46,242 INFO L87 Difference]: Start difference. First operand 70448 states and 204702 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:47,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:47,943 INFO L93 Difference]: Finished difference Result 190716 states and 555862 transitions. [2021-06-05 12:21:47,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 12:21:47,947 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:21:47,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:48,218 INFO L225 Difference]: With dead ends: 190716 [2021-06-05 12:21:48,219 INFO L226 Difference]: Without dead ends: 190716 [2021-06-05 12:21:48,219 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 585.7ms TimeCoverageRelationStatistics Valid=201, Invalid=399, Unknown=0, NotChecked=0, Total=600 [2021-06-05 12:21:49,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190716 states. [2021-06-05 12:21:50,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190716 to 70602. [2021-06-05 12:21:51,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70602 states, 70593 states have (on average 2.906407150850651) internal successors, (205172), 70601 states have internal predecessors, (205172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:51,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70602 states to 70602 states and 205172 transitions. [2021-06-05 12:21:51,134 INFO L78 Accepts]: Start accepts. Automaton has 70602 states and 205172 transitions. Word has length 128 [2021-06-05 12:21:51,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:51,135 INFO L482 AbstractCegarLoop]: Abstraction has 70602 states and 205172 transitions. [2021-06-05 12:21:51,135 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:51,135 INFO L276 IsEmpty]: Start isEmpty. Operand 70602 states and 205172 transitions. [2021-06-05 12:21:51,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:21:51,158 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:51,158 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:21:51,158 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2021-06-05 12:21:51,159 INFO L430 AbstractCegarLoop]: === Iteration 38 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:51,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:51,159 INFO L82 PathProgramCache]: Analyzing trace with hash -969056470, now seen corresponding path program 19 times [2021-06-05 12:21:51,159 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:51,159 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476670029] [2021-06-05 12:21:51,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:51,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:51,351 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:21:51,351 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:51,351 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476670029] [2021-06-05 12:21:51,351 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476670029] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:21:51,351 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:21:51,351 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 12:21:51,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239159772] [2021-06-05 12:21:51,351 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:21:51,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:51,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:21:51,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:21:51,352 INFO L87 Difference]: Start difference. First operand 70602 states and 205172 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:53,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:53,460 INFO L93 Difference]: Finished difference Result 199846 states and 581839 transitions. [2021-06-05 12:21:53,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 12:21:53,461 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:21:53,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:53,828 INFO L225 Difference]: With dead ends: 199846 [2021-06-05 12:21:53,829 INFO L226 Difference]: Without dead ends: 199846 [2021-06-05 12:21:53,829 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 890.2ms TimeCoverageRelationStatistics Valid=351, Invalid=839, Unknown=0, NotChecked=0, Total=1190 [2021-06-05 12:21:55,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199846 states. [2021-06-05 12:21:56,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199846 to 70580. [2021-06-05 12:21:56,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70580 states, 70571 states have (on average 2.906406314208386) internal successors, (205108), 70579 states have internal predecessors, (205108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:56,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70580 states to 70580 states and 205108 transitions. [2021-06-05 12:21:56,771 INFO L78 Accepts]: Start accepts. Automaton has 70580 states and 205108 transitions. Word has length 128 [2021-06-05 12:21:56,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:21:56,772 INFO L482 AbstractCegarLoop]: Abstraction has 70580 states and 205108 transitions. [2021-06-05 12:21:56,772 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:56,772 INFO L276 IsEmpty]: Start isEmpty. Operand 70580 states and 205108 transitions. [2021-06-05 12:21:56,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:21:56,795 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:21:56,796 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:21:56,796 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2021-06-05 12:21:56,796 INFO L430 AbstractCegarLoop]: === Iteration 39 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:21:56,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:21:56,796 INFO L82 PathProgramCache]: Analyzing trace with hash 358388940, now seen corresponding path program 20 times [2021-06-05 12:21:56,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:21:56,796 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206689472] [2021-06-05 12:21:56,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:21:56,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:21:57,178 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2021-06-05 12:21:57,178 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:21:57,178 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206689472] [2021-06-05 12:21:57,178 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206689472] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:21:57,178 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599132800] [2021-06-05 12:21:57,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:21:57,285 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-06-05 12:21:57,285 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:21:57,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 12:21:57,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:21:57,486 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 12:21:57,487 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:21:57,488 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:21:57,489 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:21:57,489 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2021-06-05 12:21:57,524 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:21:57,524 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599132800] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:21:57,524 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:21:57,524 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2021-06-05 12:21:57,524 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056151055] [2021-06-05 12:21:57,524 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 12:21:57,524 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:21:57,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 12:21:57,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=574, Unknown=0, NotChecked=0, Total=650 [2021-06-05 12:21:57,525 INFO L87 Difference]: Start difference. First operand 70580 states and 205108 transitions. Second operand has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:21:57,906 WARN L205 SmtUtils]: Spent 239.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2021-06-05 12:21:59,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:21:59,208 INFO L93 Difference]: Finished difference Result 227731 states and 663993 transitions. [2021-06-05 12:21:59,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2021-06-05 12:21:59,209 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:21:59,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:21:59,602 INFO L225 Difference]: With dead ends: 227731 [2021-06-05 12:21:59,602 INFO L226 Difference]: Without dead ends: 227731 [2021-06-05 12:21:59,602 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 149 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 832 ImplicationChecksByTransitivity, 1021.1ms TimeCoverageRelationStatistics Valid=372, Invalid=2280, Unknown=0, NotChecked=0, Total=2652 [2021-06-05 12:22:01,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227731 states. [2021-06-05 12:22:02,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227731 to 71625. [2021-06-05 12:22:02,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71625 states, 71616 states have (on average 2.899994414655943) internal successors, (207686), 71624 states have internal predecessors, (207686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:03,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71625 states to 71625 states and 207686 transitions. [2021-06-05 12:22:03,161 INFO L78 Accepts]: Start accepts. Automaton has 71625 states and 207686 transitions. Word has length 128 [2021-06-05 12:22:03,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:03,161 INFO L482 AbstractCegarLoop]: Abstraction has 71625 states and 207686 transitions. [2021-06-05 12:22:03,161 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:03,162 INFO L276 IsEmpty]: Start isEmpty. Operand 71625 states and 207686 transitions. [2021-06-05 12:22:03,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:22:03,184 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:03,185 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:22:03,385 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2021-06-05 12:22:03,385 INFO L430 AbstractCegarLoop]: === Iteration 40 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:03,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:03,385 INFO L82 PathProgramCache]: Analyzing trace with hash -290256028, now seen corresponding path program 21 times [2021-06-05 12:22:03,385 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:03,386 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158281752] [2021-06-05 12:22:03,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:03,828 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2021-06-05 12:22:03,828 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:03,828 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158281752] [2021-06-05 12:22:03,829 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158281752] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:03,829 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340382879] [2021-06-05 12:22:03,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:22:03,902 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-06-05 12:22:03,903 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:22:03,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 12:22:03,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:22:03,915 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 12:22:03,915 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:03,917 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:03,917 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:03,917 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:22:03,940 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:22:03,940 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 12:22:03,941 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:03,942 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:03,943 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:03,943 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 12:22:04,147 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 12:22:04,150 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:04,153 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:04,153 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:04,153 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2021-06-05 12:22:04,183 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 12:22:04,184 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:04,188 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:04,189 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:04,189 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 12:22:04,237 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-06-05 12:22:04,238 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:04,242 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:04,244 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:22:04,244 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2021-06-05 12:22:04,282 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:22:04,282 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340382879] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:22:04,282 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:22:04,282 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [19] total 30 [2021-06-05 12:22:04,283 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577148565] [2021-06-05 12:22:04,283 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:22:04,283 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:04,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:22:04,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=788, Unknown=0, NotChecked=0, Total=870 [2021-06-05 12:22:04,283 INFO L87 Difference]: Start difference. First operand 71625 states and 207686 transitions. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:07,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:07,588 INFO L93 Difference]: Finished difference Result 195963 states and 570026 transitions. [2021-06-05 12:22:07,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-06-05 12:22:07,589 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:22:07,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:07,885 INFO L225 Difference]: With dead ends: 195963 [2021-06-05 12:22:07,885 INFO L226 Difference]: Without dead ends: 195963 [2021-06-05 12:22:07,885 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 119 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1391 ImplicationChecksByTransitivity, 2188.1ms TimeCoverageRelationStatistics Valid=921, Invalid=4629, Unknown=0, NotChecked=0, Total=5550 [2021-06-05 12:22:09,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195963 states. [2021-06-05 12:22:10,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195963 to 70536. [2021-06-05 12:22:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70536 states, 70527 states have (on average 2.9064046393579765) internal successors, (204980), 70535 states have internal predecessors, (204980), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:10,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70536 states to 70536 states and 204980 transitions. [2021-06-05 12:22:10,695 INFO L78 Accepts]: Start accepts. Automaton has 70536 states and 204980 transitions. Word has length 128 [2021-06-05 12:22:10,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:10,695 INFO L482 AbstractCegarLoop]: Abstraction has 70536 states and 204980 transitions. [2021-06-05 12:22:10,695 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:10,695 INFO L276 IsEmpty]: Start isEmpty. Operand 70536 states and 204980 transitions. [2021-06-05 12:22:10,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:22:10,718 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:10,718 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:22:10,919 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,48 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:22:10,919 INFO L430 AbstractCegarLoop]: === Iteration 41 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:10,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:10,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1336137942, now seen corresponding path program 22 times [2021-06-05 12:22:10,919 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:10,919 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432421684] [2021-06-05 12:22:10,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:10,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:11,257 WARN L205 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 17 [2021-06-05 12:22:11,351 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:22:11,351 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:11,352 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432421684] [2021-06-05 12:22:11,352 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432421684] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:22:11,352 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:22:11,352 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 12:22:11,352 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137135228] [2021-06-05 12:22:11,352 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:22:11,352 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:11,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:22:11,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:22:11,352 INFO L87 Difference]: Start difference. First operand 70536 states and 204980 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:12,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:12,702 INFO L93 Difference]: Finished difference Result 191299 states and 556029 transitions. [2021-06-05 12:22:12,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-06-05 12:22:12,702 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:22:12,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:12,993 INFO L225 Difference]: With dead ends: 191299 [2021-06-05 12:22:12,993 INFO L226 Difference]: Without dead ends: 191299 [2021-06-05 12:22:12,993 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 697.6ms TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2021-06-05 12:22:14,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191299 states. [2021-06-05 12:22:15,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191299 to 70459. [2021-06-05 12:22:15,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70459 states, 70450 states have (on average 2.9060894251242018) internal successors, (204734), 70458 states have internal predecessors, (204734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:15,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70459 states to 70459 states and 204734 transitions. [2021-06-05 12:22:15,921 INFO L78 Accepts]: Start accepts. Automaton has 70459 states and 204734 transitions. Word has length 128 [2021-06-05 12:22:15,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:15,921 INFO L482 AbstractCegarLoop]: Abstraction has 70459 states and 204734 transitions. [2021-06-05 12:22:15,921 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:15,922 INFO L276 IsEmpty]: Start isEmpty. Operand 70459 states and 204734 transitions. [2021-06-05 12:22:15,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:22:15,945 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:15,945 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:22:15,945 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2021-06-05 12:22:15,945 INFO L430 AbstractCegarLoop]: === Iteration 42 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:15,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:15,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1221183830, now seen corresponding path program 23 times [2021-06-05 12:22:15,946 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:15,946 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603484815] [2021-06-05 12:22:15,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:15,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:16,150 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:22:16,150 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:16,150 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603484815] [2021-06-05 12:22:16,150 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603484815] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:22:16,150 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:22:16,150 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 12:22:16,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572691241] [2021-06-05 12:22:16,151 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:22:16,151 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:16,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:22:16,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:22:16,151 INFO L87 Difference]: Start difference. First operand 70459 states and 204734 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:18,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:18,090 INFO L93 Difference]: Finished difference Result 187867 states and 546100 transitions. [2021-06-05 12:22:18,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2021-06-05 12:22:18,091 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:22:18,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:18,362 INFO L225 Difference]: With dead ends: 187867 [2021-06-05 12:22:18,363 INFO L226 Difference]: Without dead ends: 187867 [2021-06-05 12:22:18,363 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 753.8ms TimeCoverageRelationStatistics Valid=293, Invalid=699, Unknown=0, NotChecked=0, Total=992 [2021-06-05 12:22:19,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187867 states. [2021-06-05 12:22:20,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187867 to 70437. [2021-06-05 12:22:21,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70437 states, 70428 states have (on average 2.9060884875333675) internal successors, (204670), 70436 states have internal predecessors, (204670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:21,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70437 states to 70437 states and 204670 transitions. [2021-06-05 12:22:21,141 INFO L78 Accepts]: Start accepts. Automaton has 70437 states and 204670 transitions. Word has length 128 [2021-06-05 12:22:21,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:21,141 INFO L482 AbstractCegarLoop]: Abstraction has 70437 states and 204670 transitions. [2021-06-05 12:22:21,141 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:21,141 INFO L276 IsEmpty]: Start isEmpty. Operand 70437 states and 204670 transitions. [2021-06-05 12:22:21,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:22:21,165 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:21,165 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:22:21,165 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70 [2021-06-05 12:22:21,165 INFO L430 AbstractCegarLoop]: === Iteration 43 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:21,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:21,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1333319992, now seen corresponding path program 24 times [2021-06-05 12:22:21,166 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:21,166 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281855176] [2021-06-05 12:22:21,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-06-05 12:22:21,367 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:21,367 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281855176] [2021-06-05 12:22:21,367 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281855176] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:22:21,367 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:22:21,367 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-05 12:22:21,367 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397350427] [2021-06-05 12:22:21,367 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-05 12:22:21,367 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:21,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-05 12:22:21,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2021-06-05 12:22:21,368 INFO L87 Difference]: Start difference. First operand 70437 states and 204670 transitions. Second operand has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:22,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:22,654 INFO L93 Difference]: Finished difference Result 145022 states and 421185 transitions. [2021-06-05 12:22:22,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 12:22:22,654 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:22:22,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:22,853 INFO L225 Difference]: With dead ends: 145022 [2021-06-05 12:22:22,853 INFO L226 Difference]: Without dead ends: 145022 [2021-06-05 12:22:22,853 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 342.3ms TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2021-06-05 12:22:24,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145022 states. [2021-06-05 12:22:25,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145022 to 69942. [2021-06-05 12:22:25,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69942 states, 69933 states have (on average 2.9059099423734147) internal successors, (203219), 69941 states have internal predecessors, (203219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:25,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69942 states to 69942 states and 203219 transitions. [2021-06-05 12:22:25,328 INFO L78 Accepts]: Start accepts. Automaton has 69942 states and 203219 transitions. Word has length 128 [2021-06-05 12:22:25,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:25,328 INFO L482 AbstractCegarLoop]: Abstraction has 69942 states and 203219 transitions. [2021-06-05 12:22:25,328 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.545454545454546) internal successors, (83), 11 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:25,328 INFO L276 IsEmpty]: Start isEmpty. Operand 69942 states and 203219 transitions. [2021-06-05 12:22:25,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:22:25,351 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:25,351 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:22:25,351 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2021-06-05 12:22:25,351 INFO L430 AbstractCegarLoop]: === Iteration 44 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:25,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:25,351 INFO L82 PathProgramCache]: Analyzing trace with hash -2076923721, now seen corresponding path program 2 times [2021-06-05 12:22:25,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:25,351 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291821558] [2021-06-05 12:22:25,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:25,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:25,580 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2021-06-05 12:22:25,580 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:25,580 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291821558] [2021-06-05 12:22:25,580 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291821558] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:22:25,580 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:22:25,580 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 12:22:25,580 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225730686] [2021-06-05 12:22:25,580 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 12:22:25,581 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:25,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 12:22:25,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-06-05 12:22:25,581 INFO L87 Difference]: Start difference. First operand 69942 states and 203219 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:27,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:27,037 INFO L93 Difference]: Finished difference Result 148944 states and 433538 transitions. [2021-06-05 12:22:27,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-05 12:22:27,038 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:22:27,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:27,250 INFO L225 Difference]: With dead ends: 148944 [2021-06-05 12:22:27,250 INFO L226 Difference]: Without dead ends: 148944 [2021-06-05 12:22:27,251 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 493.7ms TimeCoverageRelationStatistics Valid=145, Invalid=317, Unknown=0, NotChecked=0, Total=462 [2021-06-05 12:22:28,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148944 states. [2021-06-05 12:22:29,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148944 to 71571. [2021-06-05 12:22:29,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71571 states, 71562 states have (on average 2.9070735865403425) internal successors, (208036), 71570 states have internal predecessors, (208036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:29,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71571 states to 71571 states and 208036 transitions. [2021-06-05 12:22:29,636 INFO L78 Accepts]: Start accepts. Automaton has 71571 states and 208036 transitions. Word has length 128 [2021-06-05 12:22:29,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:29,636 INFO L482 AbstractCegarLoop]: Abstraction has 71571 states and 208036 transitions. [2021-06-05 12:22:29,636 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:29,636 INFO L276 IsEmpty]: Start isEmpty. Operand 71571 states and 208036 transitions. [2021-06-05 12:22:29,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:22:29,657 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:29,657 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:22:29,657 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable72 [2021-06-05 12:22:29,657 INFO L430 AbstractCegarLoop]: === Iteration 45 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:29,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:29,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1767645711, now seen corresponding path program 3 times [2021-06-05 12:22:29,658 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:29,658 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390018198] [2021-06-05 12:22:29,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:30,151 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2021-06-05 12:22:30,151 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:30,152 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390018198] [2021-06-05 12:22:30,152 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390018198] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:22:30,152 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:22:30,152 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 12:22:30,152 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780413204] [2021-06-05 12:22:30,152 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 12:22:30,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:30,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 12:22:30,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2021-06-05 12:22:30,152 INFO L87 Difference]: Start difference. First operand 71571 states and 208036 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:31,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:31,472 INFO L93 Difference]: Finished difference Result 155226 states and 451946 transitions. [2021-06-05 12:22:31,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 12:22:31,473 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:22:31,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:31,702 INFO L225 Difference]: With dead ends: 155226 [2021-06-05 12:22:31,702 INFO L226 Difference]: Without dead ends: 155226 [2021-06-05 12:22:31,702 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 825.2ms TimeCoverageRelationStatistics Valid=172, Invalid=380, Unknown=0, NotChecked=0, Total=552 [2021-06-05 12:22:32,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155226 states. [2021-06-05 12:22:34,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155226 to 71593. [2021-06-05 12:22:34,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71593 states, 71584 states have (on average 2.907074206526598) internal successors, (208100), 71592 states have internal predecessors, (208100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:34,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71593 states to 71593 states and 208100 transitions. [2021-06-05 12:22:34,278 INFO L78 Accepts]: Start accepts. Automaton has 71593 states and 208100 transitions. Word has length 128 [2021-06-05 12:22:34,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:34,278 INFO L482 AbstractCegarLoop]: Abstraction has 71593 states and 208100 transitions. [2021-06-05 12:22:34,278 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:34,278 INFO L276 IsEmpty]: Start isEmpty. Operand 71593 states and 208100 transitions. [2021-06-05 12:22:34,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:22:34,300 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:34,300 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:22:34,300 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73 [2021-06-05 12:22:34,300 INFO L430 AbstractCegarLoop]: === Iteration 46 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:34,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:34,300 INFO L82 PathProgramCache]: Analyzing trace with hash 916588732, now seen corresponding path program 25 times [2021-06-05 12:22:34,301 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:34,301 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488010058] [2021-06-05 12:22:34,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2021-06-05 12:22:34,707 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:34,707 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488010058] [2021-06-05 12:22:34,707 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488010058] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:34,707 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221298833] [2021-06-05 12:22:34,707 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 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:22:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:34,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 12:22:34,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:22:34,964 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 12:22:34,965 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:34,966 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:34,966 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:34,966 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2021-06-05 12:22:34,997 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2021-06-05 12:22:34,997 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221298833] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:22:34,997 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:22:34,997 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 26 [2021-06-05 12:22:34,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916697933] [2021-06-05 12:22:34,998 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-05 12:22:34,998 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:34,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-05 12:22:34,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=570, Unknown=0, NotChecked=0, Total=650 [2021-06-05 12:22:34,998 INFO L87 Difference]: Start difference. First operand 71593 states and 208100 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:36,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:36,594 INFO L93 Difference]: Finished difference Result 199578 states and 581927 transitions. [2021-06-05 12:22:36,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-06-05 12:22:36,595 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:22:36,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:36,936 INFO L225 Difference]: With dead ends: 199578 [2021-06-05 12:22:36,936 INFO L226 Difference]: Without dead ends: 199578 [2021-06-05 12:22:36,936 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 148 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 791.8ms TimeCoverageRelationStatistics Valid=377, Invalid=2173, Unknown=0, NotChecked=0, Total=2550 [2021-06-05 12:22:38,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199578 states. [2021-06-05 12:22:39,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199578 to 72638. [2021-06-05 12:22:39,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72638 states, 72629 states have (on average 2.90074212780019) internal successors, (210678), 72637 states have internal predecessors, (210678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:39,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72638 states to 72638 states and 210678 transitions. [2021-06-05 12:22:39,880 INFO L78 Accepts]: Start accepts. Automaton has 72638 states and 210678 transitions. Word has length 128 [2021-06-05 12:22:39,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:39,881 INFO L482 AbstractCegarLoop]: Abstraction has 72638 states and 210678 transitions. [2021-06-05 12:22:39,881 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 9 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:39,881 INFO L276 IsEmpty]: Start isEmpty. Operand 72638 states and 210678 transitions. [2021-06-05 12:22:39,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:22:39,903 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:39,903 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:22:40,103 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,49 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:22:40,104 INFO L430 AbstractCegarLoop]: === Iteration 47 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:40,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:40,104 INFO L82 PathProgramCache]: Analyzing trace with hash 267943764, now seen corresponding path program 26 times [2021-06-05 12:22:40,104 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:40,104 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598580026] [2021-06-05 12:22:40,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2021-06-05 12:22:40,799 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:40,800 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598580026] [2021-06-05 12:22:40,800 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598580026] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:40,800 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801289520] [2021-06-05 12:22:40,800 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:22:40,863 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-06-05 12:22:40,863 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:22:40,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 28 conjunts are in the unsatisfiable core [2021-06-05 12:22:40,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-06-05 12:22:40,879 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 12:22:40,880 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:40,882 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:40,882 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:40,882 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-06-05 12:22:40,906 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-06-05 12:22:40,907 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 12:22:40,911 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:40,912 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:40,912 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:40,912 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2021-06-05 12:22:41,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-06-05 12:22:41,112 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:41,115 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:41,115 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:41,115 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2021-06-05 12:22:41,147 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 12:22:41,148 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:41,152 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:41,153 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-06-05 12:22:41,153 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2021-06-05 12:22:41,190 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2021-06-05 12:22:41,191 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-06-05 12:22:41,195 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-06-05 12:22:41,196 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-06-05 12:22:41,197 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2021-06-05 12:22:41,232 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2021-06-05 12:22:41,232 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [801289520] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:22:41,232 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-06-05 12:22:41,232 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [19] total 30 [2021-06-05 12:22:41,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326694700] [2021-06-05 12:22:41,232 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-06-05 12:22:41,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:41,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-06-05 12:22:41,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=781, Unknown=0, NotChecked=0, Total=870 [2021-06-05 12:22:41,233 INFO L87 Difference]: Start difference. First operand 72638 states and 210678 transitions. Second operand has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:43,483 WARN L205 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2021-06-05 12:22:44,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:44,182 INFO L93 Difference]: Finished difference Result 168701 states and 490530 transitions. [2021-06-05 12:22:44,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2021-06-05 12:22:44,183 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:22:44,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:44,452 INFO L225 Difference]: With dead ends: 168701 [2021-06-05 12:22:44,452 INFO L226 Difference]: Without dead ends: 168701 [2021-06-05 12:22:44,452 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 119 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 2556.6ms TimeCoverageRelationStatistics Valid=953, Invalid=4597, Unknown=0, NotChecked=0, Total=5550 [2021-06-05 12:22:45,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168701 states. [2021-06-05 12:22:46,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168701 to 71571. [2021-06-05 12:22:47,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71571 states, 71562 states have (on average 2.9070735865403425) internal successors, (208036), 71570 states have internal predecessors, (208036), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:47,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71571 states to 71571 states and 208036 transitions. [2021-06-05 12:22:47,201 INFO L78 Accepts]: Start accepts. Automaton has 71571 states and 208036 transitions. Word has length 128 [2021-06-05 12:22:47,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:47,201 INFO L482 AbstractCegarLoop]: Abstraction has 71571 states and 208036 transitions. [2021-06-05 12:22:47,202 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.076923076923077) internal successors, (79), 13 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:47,202 INFO L276 IsEmpty]: Start isEmpty. Operand 71571 states and 208036 transitions. [2021-06-05 12:22:47,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:22:47,224 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:47,224 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:22:47,424 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable75 [2021-06-05 12:22:47,425 INFO L430 AbstractCegarLoop]: === Iteration 48 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:47,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:47,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1634566149, now seen corresponding path program 4 times [2021-06-05 12:22:47,425 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:47,425 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011551917] [2021-06-05 12:22:47,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:47,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:47,640 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2021-06-05 12:22:47,641 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:47,641 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011551917] [2021-06-05 12:22:47,641 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011551917] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-05 12:22:47,641 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-05 12:22:47,641 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-06-05 12:22:47,641 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80568861] [2021-06-05 12:22:47,641 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-06-05 12:22:47,642 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-05 12:22:47,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-06-05 12:22:47,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2021-06-05 12:22:47,642 INFO L87 Difference]: Start difference. First operand 71571 states and 208036 transitions. Second operand has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:49,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-05 12:22:49,205 INFO L93 Difference]: Finished difference Result 162915 states and 474149 transitions. [2021-06-05 12:22:49,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-06-05 12:22:49,206 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 128 [2021-06-05 12:22:49,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-05 12:22:49,448 INFO L225 Difference]: With dead ends: 162915 [2021-06-05 12:22:49,448 INFO L226 Difference]: Without dead ends: 162915 [2021-06-05 12:22:49,448 INFO L777 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 489.1ms TimeCoverageRelationStatistics Valid=170, Invalid=382, Unknown=0, NotChecked=0, Total=552 [2021-06-05 12:22:50,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162915 states. [2021-06-05 12:22:51,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162915 to 71637. [2021-06-05 12:22:51,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71637 states, 71628 states have (on average 2.9070754453565644) internal successors, (208228), 71636 states have internal predecessors, (208228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:52,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71637 states to 71637 states and 208228 transitions. [2021-06-05 12:22:52,180 INFO L78 Accepts]: Start accepts. Automaton has 71637 states and 208228 transitions. Word has length 128 [2021-06-05 12:22:52,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-05 12:22:52,180 INFO L482 AbstractCegarLoop]: Abstraction has 71637 states and 208228 transitions. [2021-06-05 12:22:52,180 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 6.583333333333333) internal successors, (79), 12 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-06-05 12:22:52,180 INFO L276 IsEmpty]: Start isEmpty. Operand 71637 states and 208228 transitions. [2021-06-05 12:22:52,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2021-06-05 12:22:52,199 INFO L513 BasicCegarLoop]: Found error trace [2021-06-05 12:22:52,199 INFO L521 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 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] [2021-06-05 12:22:52,199 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable76 [2021-06-05 12:22:52,199 INFO L430 AbstractCegarLoop]: === Iteration 49 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-05 12:22:52,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-05 12:22:52,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1049668294, now seen corresponding path program 27 times [2021-06-05 12:22:52,200 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-05 12:22:52,200 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526640865] [2021-06-05 12:22:52,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-05 12:22:52,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-05 12:22:52,605 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2021-06-05 12:22:52,605 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-05 12:22:52,605 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526640865] [2021-06-05 12:22:52,605 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526640865] provided 0 perfect and 1 imperfect interpolant sequences [2021-06-05 12:22:52,605 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713344733] [2021-06-05 12:22:52,605 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 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:22:52,667 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2021-06-05 12:22:52,667 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-06-05 12:22:52,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjunts are in the unsatisfiable core [2021-06-05 12:22:52,669 INFO L286 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2021-06-05 12:22:52,956 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable77,51 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-06-05 12:22:52,956 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 12:22:52,956 INFO L315 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was TIMEOUT (1/2) [2021-06-05 12:22:52,957 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-05 12:22:52,957 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-05 12:22:52,957 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-05 12:22:52,957 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-05 12:22:52,957 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-05 12:22:52,957 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-05 12:22:52,957 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-05 12:22:52,957 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-05 12:22:52,957 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == InUseError======== [2021-06-05 12:22:52,958 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 212 places, 255 transitions, 528 flow [2021-06-05 12:22:52,959 WARN L547 AbstractCegarLoop]: Verification canceled [2021-06-05 12:22:52,959 INFO L315 ceAbstractionStarter]: Result for error location InUseError was TIMEOUT (2/2) [2021-06-05 12:22:52,959 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2021-06-05 12:22:52,960 WARN L196 ceAbstractionStarter]: Timeout [2021-06-05 12:22:52,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.06 12:22:52 BasicIcfg [2021-06-05 12:22:52,960 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-05 12:22:52,961 INFO L168 Benchmark]: Toolchain (without parser) took 757061.90 ms. Allocated memory was 385.9 MB in the beginning and 16.0 GB in the end (delta: 15.6 GB). Free memory was 347.8 MB in the beginning and 9.2 GB in the end (delta: -8.8 GB). Peak memory consumption was 6.8 GB. Max. memory is 16.0 GB. [2021-06-05 12:22:52,961 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 385.9 MB. Free memory was 366.0 MB in the beginning and 366.0 MB in the end (delta: 71.2 kB). There was no memory consumed. Max. memory is 16.0 GB. [2021-06-05 12:22:52,961 INFO L168 Benchmark]: CACSL2BoogieTranslator took 481.85 ms. Allocated memory is still 385.9 MB. Free memory was 347.6 MB in the beginning and 323.8 MB in the end (delta: 23.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 16.0 GB. [2021-06-05 12:22:52,961 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.97 ms. Allocated memory is still 385.9 MB. Free memory was 323.8 MB in the beginning and 320.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 12:22:52,961 INFO L168 Benchmark]: Boogie Preprocessor took 39.13 ms. Allocated memory is still 385.9 MB. Free memory was 320.9 MB in the beginning and 318.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2021-06-05 12:22:52,961 INFO L168 Benchmark]: RCFGBuilder took 445.58 ms. Allocated memory is still 385.9 MB. Free memory was 318.8 MB in the beginning and 281.9 MB in the end (delta: 36.9 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.0 GB. [2021-06-05 12:22:52,961 INFO L168 Benchmark]: TraceAbstraction took 756035.24 ms. Allocated memory was 385.9 MB in the beginning and 16.0 GB in the end (delta: 15.6 GB). Free memory was 281.1 MB in the beginning and 9.2 GB in the end (delta: -8.9 GB). Peak memory consumption was 6.7 GB. Max. memory is 16.0 GB. [2021-06-05 12:22:52,961 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 385.9 MB. Free memory was 366.0 MB in the beginning and 366.0 MB in the end (delta: 71.2 kB). There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 481.85 ms. Allocated memory is still 385.9 MB. Free memory was 347.6 MB in the beginning and 323.8 MB in the end (delta: 23.8 MB). Peak memory consumption was 26.1 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 53.97 ms. Allocated memory is still 385.9 MB. Free memory was 323.8 MB in the beginning and 320.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 39.13 ms. Allocated memory is still 385.9 MB. Free memory was 320.9 MB in the beginning and 318.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 445.58 ms. Allocated memory is still 385.9 MB. Free memory was 318.8 MB in the beginning and 281.9 MB in the end (delta: 36.9 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.0 GB. * TraceAbstraction took 756035.24 ms. Allocated memory was 385.9 MB in the beginning and 16.0 GB in the end (delta: 15.6 GB). Free memory was 281.1 MB in the beginning and 9.2 GB in the end (delta: -8.9 GB). Peak memory consumption was 6.7 GB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 129 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was analyzing trace of length 129 with TraceHistMax 10,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 19 known predicates. - TimeoutResultAtElement [Line: 947]: 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 212 places, 255 transitions, 528 flow. Already constructed 2 states. Currently 1 states in worklist.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 208 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 249188.9ms, OverallIterations: 17, TraceHistogramMax: 10, EmptinessCheckTime: 46.9ms, AutomataDifference: 224917.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 127.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 2800 SDtfs, 11948 SDslu, 27936 SDs, 0 SdLazy, 7032 SolverSat, 725 SolverUnsat, 73 SolverUnknown, 0 SolverNotchecked, 30819.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2058 GetRequests, 1399 SyntacticMatches, 13 SemanticMatches, 646 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 11229 ImplicationChecksByTransitivity, 206281.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5354occurred in iteration=5, InterpolantAutomatonStates: 463, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 735.4ms AutomataMinimizationTime, 17 MinimizatonAttempts, 12291 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 247.0ms SsaConstructionTime, 651.9ms SatisfiabilityAnalysisTime, 18295.3ms InterpolantComputationTime, 3056 NumberOfCodeBlocks, 2946 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 3024 ConstructedInterpolants, 99 QuantifiedInterpolants, 25159 SizeOfPredicates, 200 NumberOfNonLiveVariables, 2930 ConjunctsInSsa, 267 ConjunctsInUnsatCore, 32 InterpolantComputations, 4 PerfectInterpolantSequences, 2208/3380 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, 262 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 501430.5ms, OverallIterations: 49, TraceHistogramMax: 10, EmptinessCheckTime: 1129.6ms, AutomataDifference: 118285.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 41437.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 22599 SDtfs, 73875 SDslu, 120463 SDs, 0 SdLazy, 31271 SolverSat, 3177 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 16758.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4218 GetRequests, 2600 SyntacticMatches, 87 SemanticMatches, 1531 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17689 ImplicationChecksByTransitivity, 33679.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=302441occurred in iteration=5, InterpolantAutomatonStates: 1163, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 311079.9ms AutomataMinimizationTime, 48 MinimizatonAttempts, 5245834 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 373.7ms SsaConstructionTime, 2081.0ms SatisfiabilityAnalysisTime, 18618.2ms InterpolantComputationTime, 7865 NumberOfCodeBlocks, 7556 NumberOfCodeBlocksAsserted, 105 NumberOfCheckSat, 7792 ConstructedInterpolants, 8 QuantifiedInterpolants, 62704 SizeOfPredicates, 258 NumberOfNonLiveVariables, 4822 ConjunctsInSsa, 432 ConjunctsInUnsatCore, 73 InterpolantComputations, 35 PerfectInterpolantSequences, 12057/13192 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, 208 locations, 4 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5222.8ms, OverallIterations: 12, TraceHistogramMax: 10, EmptinessCheckTime: 7.5ms, AutomataDifference: 1077.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 51.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 1038 SDtfs, 175 SDslu, 8130 SDs, 0 SdLazy, 658 SolverSat, 60 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 257.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 761 GetRequests, 553 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1112 ImplicationChecksByTransitivity, 1226.6ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=3874occurred in iteration=0, InterpolantAutomatonStates: 167, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 68.5ms AutomataMinimizationTime, 11 MinimizatonAttempts, 27 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 84.3ms SsaConstructionTime, 242.1ms SatisfiabilityAnalysisTime, 1303.1ms InterpolantComputationTime, 1277 NumberOfCodeBlocks, 1264 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 1170 ConstructedInterpolants, 0 QuantifiedInterpolants, 2108 SizeOfPredicates, 90 NumberOfNonLiveVariables, 1144 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 100/1390 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, 262 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 1.8ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1.4ms, 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