/usr/bin/java -Xmx8000000000 -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.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9e34d99ae2c6837f487980c721c4b6acf9d9b15c-9e34d99 [2021-07-09 17:07:08,538 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-09 17:07:08,539 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-09 17:07:08,576 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-09 17:07:08,576 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-09 17:07:08,579 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-09 17:07:08,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-09 17:07:08,585 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-09 17:07:08,587 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-09 17:07:08,592 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-09 17:07:08,592 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-09 17:07:08,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-09 17:07:08,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-09 17:07:08,595 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-09 17:07:08,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-09 17:07:08,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-09 17:07:08,600 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-09 17:07:08,600 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-09 17:07:08,602 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-09 17:07:08,605 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-09 17:07:08,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-09 17:07:08,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-09 17:07:08,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-09 17:07:08,610 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-09 17:07:08,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-09 17:07:08,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-09 17:07:08,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-09 17:07:08,614 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-09 17:07:08,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-09 17:07:08,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-09 17:07:08,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-09 17:07:08,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-09 17:07:08,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-09 17:07:08,617 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-09 17:07:08,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-09 17:07:08,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-09 17:07:08,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-09 17:07:08,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-09 17:07:08,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-09 17:07:08,618 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-09 17:07:08,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-09 17:07:08,620 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.epf [2021-07-09 17:07:08,649 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-09 17:07:08,649 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-09 17:07:08,649 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-07-09 17:07:08,649 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-07-09 17:07:08,651 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-09 17:07:08,651 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-09 17:07:08,651 INFO L138 SettingsManager]: * Use SBE=true [2021-07-09 17:07:08,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-09 17:07:08,652 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-09 17:07:08,652 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-09 17:07:08,652 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-09 17:07:08,652 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-09 17:07:08,653 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-09 17:07:08,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-09 17:07:08,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-09 17:07:08,653 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-09 17:07:08,653 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-09 17:07:08,653 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-09 17:07:08,653 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-09 17:07:08,653 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-09 17:07:08,653 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-09 17:07:08,653 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-09 17:07:08,653 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-09 17:07:08,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-09 17:07:08,654 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-09 17:07:08,654 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-09 17:07:08,654 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-09 17:07:08,654 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-09 17:07:08,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-09 17:07:08,654 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-09 17:07:08,654 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-09 17:07:08,654 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-07-09 17:07:08,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-09 17:07:08,902 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-09 17:07:08,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-09 17:07:08,904 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-09 17:07:08,904 INFO L275 PluginConnector]: CDTParser initialized [2021-07-09 17:07:08,905 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2021-07-09 17:07:08,962 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d95342f9b/989954f386e248eb885e080e5b47b0d1/FLAGf06f8b308 [2021-07-09 17:07:09,383 INFO L306 CDTParser]: Found 1 translation units. [2021-07-09 17:07:09,384 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_71-funloop_racing.i [2021-07-09 17:07:09,394 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d95342f9b/989954f386e248eb885e080e5b47b0d1/FLAGf06f8b308 [2021-07-09 17:07:09,413 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d95342f9b/989954f386e248eb885e080e5b47b0d1 [2021-07-09 17:07:09,414 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-09 17:07:09,415 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-09 17:07:09,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-09 17:07:09,417 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-09 17:07:09,419 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-09 17:07:09,419 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 05:07:09" (1/1) ... [2021-07-09 17:07:09,420 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a113223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 05:07:09, skipping insertion in model container [2021-07-09 17:07:09,420 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 05:07:09" (1/1) ... [2021-07-09 17:07:09,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-09 17:07:09,447 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-09 17:07:09,690 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_71-funloop_racing.i[41060,41073] [2021-07-09 17:07:09,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 17:07:09,717 INFO L203 MainTranslator]: Completed pre-run [2021-07-09 17:07:09,737 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_71-funloop_racing.i[41060,41073] [2021-07-09 17:07:09,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 17:07:09,780 INFO L208 MainTranslator]: Completed translation [2021-07-09 17:07:09,781 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 05:07:09 WrapperNode [2021-07-09 17:07:09,781 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-09 17:07:09,781 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-09 17:07:09,782 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-09 17:07:09,782 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-09 17:07:09,786 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 05:07:09" (1/1) ... [2021-07-09 17:07:09,797 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 05:07:09" (1/1) ... [2021-07-09 17:07:09,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-09 17:07:09,815 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-09 17:07:09,815 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-09 17:07:09,815 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-09 17:07:09,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 05:07:09" (1/1) ... [2021-07-09 17:07:09,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 05:07:09" (1/1) ... [2021-07-09 17:07:09,824 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 05:07:09" (1/1) ... [2021-07-09 17:07:09,824 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 05:07:09" (1/1) ... [2021-07-09 17:07:09,829 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 05:07:09" (1/1) ... [2021-07-09 17:07:09,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 05:07:09" (1/1) ... [2021-07-09 17:07:09,835 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 05:07:09" (1/1) ... [2021-07-09 17:07:09,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-09 17:07:09,838 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-09 17:07:09,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-09 17:07:09,838 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-09 17:07:09,838 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 05:07:09" (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-07-09 17:07:09,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-09 17:07:09,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-09 17:07:09,902 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-07-09 17:07:09,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-09 17:07:09,903 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2021-07-09 17:07:09,904 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2021-07-09 17:07:09,904 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2021-07-09 17:07:09,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-09 17:07:09,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-09 17:07:09,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-09 17:07:09,905 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-09 17:07:10,386 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-09 17:07:10,386 INFO L299 CfgBuilder]: Removed 49 assume(true) statements. [2021-07-09 17:07:10,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 05:07:10 BoogieIcfgContainer [2021-07-09 17:07:10,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-09 17:07:10,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-09 17:07:10,389 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-09 17:07:10,391 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-09 17:07:10,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.07 05:07:09" (1/3) ... [2021-07-09 17:07:10,391 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60519ea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 05:07:10, skipping insertion in model container [2021-07-09 17:07:10,391 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 05:07:09" (2/3) ... [2021-07-09 17:07:10,392 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60519ea4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 05:07:10, skipping insertion in model container [2021-07-09 17:07:10,392 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 05:07:10" (3/3) ... [2021-07-09 17:07:10,393 INFO L111 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2021-07-09 17:07:10,396 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-09 17:07:10,396 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-09 17:07:10,396 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2021-07-09 17:07:10,397 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-09 17:07:10,444 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,444 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,444 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,444 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,444 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,444 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,444 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,444 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,445 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,445 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,445 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,445 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,445 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,445 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,449 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,450 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,450 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,450 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,450 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,450 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,450 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,450 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,450 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,450 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,450 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,451 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,451 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,451 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,451 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,451 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,451 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,451 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,451 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,451 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,451 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,451 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,451 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,452 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,452 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,452 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,452 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,452 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,452 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,452 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,452 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,452 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,452 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,452 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,452 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,452 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,453 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,453 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,453 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,453 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,453 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,453 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,453 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,453 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,453 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,453 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,453 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,454 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,454 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,454 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,454 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,454 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,454 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,454 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,454 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,454 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,455 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,455 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,455 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,455 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,455 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,455 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,455 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,455 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,455 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,456 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,456 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,456 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,456 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,456 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,456 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,456 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,457 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,457 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,457 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,457 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,457 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,457 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,457 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,457 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,458 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,458 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,458 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,458 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,458 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,458 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,458 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,458 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,458 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,459 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,459 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,459 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,459 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,459 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,459 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,459 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,459 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,459 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,460 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,460 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,460 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,460 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,460 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,460 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,468 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,471 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,472 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,472 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,472 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,472 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,472 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,472 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,472 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,472 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,472 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,473 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,473 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,473 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,473 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,473 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,473 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,473 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,473 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,473 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,474 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,474 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,474 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,474 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,474 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,474 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,474 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,474 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,475 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,475 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,475 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,475 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,475 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,475 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,475 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,475 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,476 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,476 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,476 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,476 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,476 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,476 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,476 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,477 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,477 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,477 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,479 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,479 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,479 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,479 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,479 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#t~post43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,479 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,479 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,480 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_cache_entry_addref_~entry.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,480 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~nondet35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,480 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,480 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,480 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,480 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,496 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,497 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~mem42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,497 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0___VERIFIER_assert_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,497 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#t~post40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,497 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,497 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0___VERIFIER_assert_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,497 WARN L313 ript$VariableManager]: TermVariabe t_funThread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,497 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,498 WARN L313 ript$VariableManager]: TermVariabe |t_funThread1of1ForFork0_cache_entry_addref_#in~entry.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 17:07:10,503 INFO L149 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2021-07-09 17:07:10,517 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-07-09 17:07:10,545 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 17:07:10,546 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 17:07:10,546 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 17:07:10,546 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 17:07:10,546 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 17:07:10,546 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 17:07:10,546 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 17:07:10,546 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == t_funThread1of1ForFork0======== [2021-07-09 17:07:10,555 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 194 places, 236 transitions, 480 flow [2021-07-09 17:07:10,679 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5569 states, 5563 states have (on average 2.4786985439511056) internal successors, (13789), 5568 states have internal predecessors, (13789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:10,692 INFO L276 IsEmpty]: Start isEmpty. Operand has 5569 states, 5563 states have (on average 2.4786985439511056) internal successors, (13789), 5568 states have internal predecessors, (13789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:10,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-07-09 17:07:10,704 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:10,705 INFO L508 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] [2021-07-09 17:07:10,705 INFO L430 AbstractCegarLoop]: === Iteration 1 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:10,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:10,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1269470051, now seen corresponding path program 1 times [2021-07-09 17:07:10,714 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:10,714 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189765378] [2021-07-09 17:07:10,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:10,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:10,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:07:10,830 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:10,830 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189765378] [2021-07-09 17:07:10,831 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189765378] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:07:10,831 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:07:10,831 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-07-09 17:07:10,831 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491649697] [2021-07-09 17:07:10,834 INFO L462 AbstractCegarLoop]: Interpolant automaton has 2 states [2021-07-09 17:07:10,834 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:10,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-07-09 17:07:10,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-07-09 17:07:10,855 INFO L87 Difference]: Start difference. First operand has 5569 states, 5563 states have (on average 2.4786985439511056) internal successors, (13789), 5568 states have internal predecessors, (13789), 0 states have call successors, (0), 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 23.5) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:10,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:10,915 INFO L93 Difference]: Finished difference Result 5361 states and 10895 transitions. [2021-07-09 17:07:10,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-07-09 17:07:10,916 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-07-09 17:07:10,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:10,945 INFO L225 Difference]: With dead ends: 5361 [2021-07-09 17:07:10,945 INFO L226 Difference]: Without dead ends: 5331 [2021-07-09 17:07:10,946 INFO L764 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-07-09 17:07:10,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5331 states. [2021-07-09 17:07:11,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5331 to 5331. [2021-07-09 17:07:11,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5331 states, 5326 states have (on average 2.034923019151333) internal successors, (10838), 5330 states have internal predecessors, (10838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:11,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5331 states to 5331 states and 10838 transitions. [2021-07-09 17:07:11,214 INFO L78 Accepts]: Start accepts. Automaton has 5331 states and 10838 transitions. Word has length 47 [2021-07-09 17:07:11,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:11,215 INFO L482 AbstractCegarLoop]: Abstraction has 5331 states and 10838 transitions. [2021-07-09 17:07:11,215 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:11,215 INFO L276 IsEmpty]: Start isEmpty. Operand 5331 states and 10838 transitions. [2021-07-09 17:07:11,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-07-09 17:07:11,217 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:11,217 INFO L508 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] [2021-07-09 17:07:11,218 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-09 17:07:11,218 INFO L430 AbstractCegarLoop]: === Iteration 2 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:11,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:11,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1962571748, now seen corresponding path program 1 times [2021-07-09 17:07:11,220 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:11,221 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055540555] [2021-07-09 17:07:11,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:11,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:07:11,308 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:11,308 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055540555] [2021-07-09 17:07:11,309 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055540555] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:07:11,309 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 17:07:11,309 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-07-09 17:07:11,309 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049933388] [2021-07-09 17:07:11,311 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-09 17:07:11,311 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:11,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-09 17:07:11,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-09 17:07:11,313 INFO L87 Difference]: Start difference. First operand 5331 states and 10838 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:11,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:11,373 INFO L93 Difference]: Finished difference Result 5335 states and 10842 transitions. [2021-07-09 17:07:11,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-09 17:07:11,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-07-09 17:07:11,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:11,390 INFO L225 Difference]: With dead ends: 5335 [2021-07-09 17:07:11,391 INFO L226 Difference]: Without dead ends: 5335 [2021-07-09 17:07:11,392 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-07-09 17:07:11,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5335 states. [2021-07-09 17:07:11,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5335 to 5332. [2021-07-09 17:07:11,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5332 states, 5327 states have (on average 2.0347287403792005) internal successors, (10839), 5331 states have internal predecessors, (10839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:11,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5332 states to 5332 states and 10839 transitions. [2021-07-09 17:07:11,557 INFO L78 Accepts]: Start accepts. Automaton has 5332 states and 10839 transitions. Word has length 47 [2021-07-09 17:07:11,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:11,557 INFO L482 AbstractCegarLoop]: Abstraction has 5332 states and 10839 transitions. [2021-07-09 17:07:11,558 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:11,558 INFO L276 IsEmpty]: Start isEmpty. Operand 5332 states and 10839 transitions. [2021-07-09 17:07:11,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-07-09 17:07:11,560 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:11,561 INFO L508 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-07-09 17:07:11,561 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-09 17:07:11,561 INFO L430 AbstractCegarLoop]: === Iteration 3 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:11,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:11,568 INFO L82 PathProgramCache]: Analyzing trace with hash -2115124251, now seen corresponding path program 1 times [2021-07-09 17:07:11,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:11,568 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527875305] [2021-07-09 17:07:11,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:11,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:11,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:07:11,665 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:11,665 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527875305] [2021-07-09 17:07:11,665 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527875305] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:11,666 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1672269595] [2021-07-09 17:07:11,666 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-07-09 17:07:11,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:11,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2021-07-09 17:07:11,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:11,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:07:11,988 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1672269595] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:11,988 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:07:11,988 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2021-07-09 17:07:11,988 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572323204] [2021-07-09 17:07:11,989 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 17:07:11,989 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:11,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 17:07:11,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-07-09 17:07:11,989 INFO L87 Difference]: Start difference. First operand 5332 states and 10839 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-07-09 17:07:12,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:12,047 INFO L93 Difference]: Finished difference Result 5340 states and 10847 transitions. [2021-07-09 17:07:12,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-07-09 17:07:12,047 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-07-09 17:07:12,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:12,064 INFO L225 Difference]: With dead ends: 5340 [2021-07-09 17:07:12,064 INFO L226 Difference]: Without dead ends: 5340 [2021-07-09 17:07:12,065 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 28.2ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-07-09 17:07:12,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5340 states. [2021-07-09 17:07:12,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5340 to 5337. [2021-07-09 17:07:12,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5337 states, 5332 states have (on average 2.0337584396099024) internal successors, (10844), 5336 states have internal predecessors, (10844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:12,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5337 states to 5337 states and 10844 transitions. [2021-07-09 17:07:12,185 INFO L78 Accepts]: Start accepts. Automaton has 5337 states and 10844 transitions. Word has length 52 [2021-07-09 17:07:12,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:12,185 INFO L482 AbstractCegarLoop]: Abstraction has 5337 states and 10844 transitions. [2021-07-09 17:07:12,185 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-07-09 17:07:12,186 INFO L276 IsEmpty]: Start isEmpty. Operand 5337 states and 10844 transitions. [2021-07-09 17:07:12,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-07-09 17:07:12,187 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:12,188 INFO L508 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-07-09 17:07:12,401 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-07-09 17:07:12,403 INFO L430 AbstractCegarLoop]: === Iteration 4 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:12,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:12,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1189007492, now seen corresponding path program 2 times [2021-07-09 17:07:12,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:12,404 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265008679] [2021-07-09 17:07:12,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:12,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:12,528 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 17:07:12,529 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:12,529 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265008679] [2021-07-09 17:07:12,529 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265008679] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:12,529 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112116970] [2021-07-09 17:07:12,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:12,657 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-07-09 17:07:12,658 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:07:12,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 14 conjunts are in the unsatisfiable core [2021-07-09 17:07:12,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:12,696 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2021-07-09 17:07:12,697 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:12,698 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:12,699 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:12,699 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-09 17:07:12,711 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-07-09 17:07:12,712 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:12,715 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:12,716 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:12,716 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-09 17:07:12,762 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-09 17:07:12,762 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-07-09 17:07:12,764 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:12,767 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:12,767 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:12,767 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-09 17:07:12,798 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-07-09 17:07:12,802 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-07-09 17:07:12,803 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:12,806 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:12,807 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:12,811 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:12,813 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:12,813 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-07-09 17:07:12,862 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-07-09 17:07:12,863 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:12,864 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:12,865 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-07-09 17:07:12,866 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-07-09 17:07:12,907 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-07-09 17:07:12,907 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112116970] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:07:12,907 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-07-09 17:07:12,908 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [7] total 16 [2021-07-09 17:07:12,908 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529558501] [2021-07-09 17:07:12,908 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-09 17:07:12,908 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:12,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-09 17:07:12,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2021-07-09 17:07:12,909 INFO L87 Difference]: Start difference. First operand 5337 states and 10844 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-07-09 17:07:13,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:13,866 INFO L93 Difference]: Finished difference Result 15159 states and 30816 transitions. [2021-07-09 17:07:13,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2021-07-09 17:07:13,867 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-07-09 17:07:13,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:13,925 INFO L225 Difference]: With dead ends: 15159 [2021-07-09 17:07:13,925 INFO L226 Difference]: Without dead ends: 15159 [2021-07-09 17:07:13,926 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 519.3ms TimeCoverageRelationStatistics Valid=389, Invalid=1503, Unknown=0, NotChecked=0, Total=1892 [2021-07-09 17:07:13,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15159 states. [2021-07-09 17:07:14,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15159 to 7811. [2021-07-09 17:07:14,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7811 states, 7806 states have (on average 2.0397130412503204) internal successors, (15922), 7810 states have internal predecessors, (15922), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:14,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7811 states to 7811 states and 15922 transitions. [2021-07-09 17:07:14,164 INFO L78 Accepts]: Start accepts. Automaton has 7811 states and 15922 transitions. Word has length 57 [2021-07-09 17:07:14,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:14,164 INFO L482 AbstractCegarLoop]: Abstraction has 7811 states and 15922 transitions. [2021-07-09 17:07:14,164 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-07-09 17:07:14,165 INFO L276 IsEmpty]: Start isEmpty. Operand 7811 states and 15922 transitions. [2021-07-09 17:07:14,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2021-07-09 17:07:14,168 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:14,168 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:07:14,380 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:14,381 INFO L430 AbstractCegarLoop]: === Iteration 5 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:14,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:14,381 INFO L82 PathProgramCache]: Analyzing trace with hash 259410582, now seen corresponding path program 1 times [2021-07-09 17:07:14,382 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:14,382 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874323023] [2021-07-09 17:07:14,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:14,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:14,478 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-07-09 17:07:14,478 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:14,478 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874323023] [2021-07-09 17:07:14,479 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874323023] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:14,479 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329828501] [2021-07-09 17:07:14,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:14,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2021-07-09 17:07:14,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:14,661 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-07-09 17:07:14,661 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329828501] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:14,662 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:07:14,662 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2021-07-09 17:07:14,662 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336656141] [2021-07-09 17:07:14,662 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-09 17:07:14,662 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:14,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-09 17:07:14,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-07-09 17:07:14,663 INFO L87 Difference]: Start difference. First operand 7811 states and 15922 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:14,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:14,729 INFO L93 Difference]: Finished difference Result 7819 states and 15930 transitions. [2021-07-09 17:07:14,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 17:07:14,729 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2021-07-09 17:07:14,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:14,744 INFO L225 Difference]: With dead ends: 7819 [2021-07-09 17:07:14,744 INFO L226 Difference]: Without dead ends: 7819 [2021-07-09 17:07:14,744 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 44.3ms TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2021-07-09 17:07:14,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7819 states. [2021-07-09 17:07:14,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7819 to 7816. [2021-07-09 17:07:14,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7816 states, 7811 states have (on average 2.039047497119447) internal successors, (15927), 7815 states have internal predecessors, (15927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:14,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7816 states to 7816 states and 15927 transitions. [2021-07-09 17:07:14,931 INFO L78 Accepts]: Start accepts. Automaton has 7816 states and 15927 transitions. Word has length 66 [2021-07-09 17:07:14,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:14,931 INFO L482 AbstractCegarLoop]: Abstraction has 7816 states and 15927 transitions. [2021-07-09 17:07:14,931 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:14,931 INFO L276 IsEmpty]: Start isEmpty. Operand 7816 states and 15927 transitions. [2021-07-09 17:07:14,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-07-09 17:07:14,934 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:14,934 INFO L508 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-07-09 17:07:15,149 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:15,149 INFO L430 AbstractCegarLoop]: === Iteration 6 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:15,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:15,150 INFO L82 PathProgramCache]: Analyzing trace with hash -219589387, now seen corresponding path program 2 times [2021-07-09 17:07:15,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:15,150 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72318539] [2021-07-09 17:07:15,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:15,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:15,201 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-07-09 17:07:15,201 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:15,202 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72318539] [2021-07-09 17:07:15,202 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72318539] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:15,202 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277007431] [2021-07-09 17:07:15,202 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 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-07-09 17:07:15,283 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-07-09 17:07:15,283 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:07:15,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 8 conjunts are in the unsatisfiable core [2021-07-09 17:07:15,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:15,365 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-07-09 17:07:15,366 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [277007431] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:15,366 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:07:15,366 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2021-07-09 17:07:15,366 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121702959] [2021-07-09 17:07:15,366 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-09 17:07:15,366 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:15,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-09 17:07:15,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-07-09 17:07:15,367 INFO L87 Difference]: Start difference. First operand 7816 states and 15927 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-07-09 17:07:15,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:15,444 INFO L93 Difference]: Finished difference Result 7824 states and 15935 transitions. [2021-07-09 17:07:15,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-09 17:07:15,444 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-07-09 17:07:15,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:15,458 INFO L225 Difference]: With dead ends: 7824 [2021-07-09 17:07:15,458 INFO L226 Difference]: Without dead ends: 7824 [2021-07-09 17:07:15,458 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 62.0ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-07-09 17:07:15,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7824 states. [2021-07-09 17:07:15,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7824 to 7821. [2021-07-09 17:07:15,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7821 states, 7816 states have (on average 2.0383828045035823) internal successors, (15932), 7820 states have internal predecessors, (15932), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:15,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7821 states to 7821 states and 15932 transitions. [2021-07-09 17:07:15,588 INFO L78 Accepts]: Start accepts. Automaton has 7821 states and 15932 transitions. Word has length 71 [2021-07-09 17:07:15,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:15,588 INFO L482 AbstractCegarLoop]: Abstraction has 7821 states and 15932 transitions. [2021-07-09 17:07:15,588 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-07-09 17:07:15,588 INFO L276 IsEmpty]: Start isEmpty. Operand 7821 states and 15932 transitions. [2021-07-09 17:07:15,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-07-09 17:07:15,591 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:15,591 INFO L508 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-07-09 17:07:15,811 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:15,811 INFO L430 AbstractCegarLoop]: === Iteration 7 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:15,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:15,811 INFO L82 PathProgramCache]: Analyzing trace with hash -236392970, now seen corresponding path program 3 times [2021-07-09 17:07:15,812 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:15,812 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932492857] [2021-07-09 17:07:15,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:15,872 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-07-09 17:07:15,873 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:15,873 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932492857] [2021-07-09 17:07:15,873 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932492857] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:15,873 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1333081073] [2021-07-09 17:07:15,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:15,960 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-07-09 17:07:15,961 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:07:15,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 15 conjunts are in the unsatisfiable core [2021-07-09 17:07:15,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:15,980 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-07-09 17:07:15,981 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:15,982 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:15,982 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:15,983 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-09 17:07:15,993 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-07-09 17:07:15,994 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:15,997 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:15,997 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:15,997 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-09 17:07:16,108 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-09 17:07:16,108 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-07-09 17:07:16,113 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:16,115 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:16,116 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:16,116 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-09 17:07:16,145 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-07-09 17:07:16,149 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-09 17:07:16,150 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:16,153 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:16,154 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:16,157 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:16,158 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:16,158 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-07-09 17:07:16,220 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-07-09 17:07:16,224 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-07-09 17:07:16,225 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:16,228 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:16,229 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:16,232 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:16,233 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:16,234 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-07-09 17:07:16,249 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-07-09 17:07:16,250 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:16,251 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:16,252 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-07-09 17:07:16,252 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-07-09 17:07:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2021-07-09 17:07:16,291 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1333081073] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:16,291 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:07:16,291 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2021-07-09 17:07:16,291 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109260965] [2021-07-09 17:07:16,292 INFO L462 AbstractCegarLoop]: Interpolant automaton has 20 states [2021-07-09 17:07:16,292 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:16,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-07-09 17:07:16,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2021-07-09 17:07:16,292 INFO L87 Difference]: Start difference. First operand 7821 states and 15932 transitions. Second operand has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:17,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:17,450 INFO L93 Difference]: Finished difference Result 15227 states and 30937 transitions. [2021-07-09 17:07:17,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-07-09 17:07:17,451 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have 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-07-09 17:07:17,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:17,474 INFO L225 Difference]: With dead ends: 15227 [2021-07-09 17:07:17,474 INFO L226 Difference]: Without dead ends: 15227 [2021-07-09 17:07:17,475 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 576.5ms TimeCoverageRelationStatistics Valid=481, Invalid=2599, Unknown=0, NotChecked=0, Total=3080 [2021-07-09 17:07:17,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15227 states. [2021-07-09 17:07:17,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15227 to 7798. [2021-07-09 17:07:17,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7798 states, 7793 states have (on average 2.03913768766842) internal successors, (15891), 7797 states have internal predecessors, (15891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:17,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7798 states to 7798 states and 15891 transitions. [2021-07-09 17:07:17,631 INFO L78 Accepts]: Start accepts. Automaton has 7798 states and 15891 transitions. Word has length 76 [2021-07-09 17:07:17,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:17,631 INFO L482 AbstractCegarLoop]: Abstraction has 7798 states and 15891 transitions. [2021-07-09 17:07:17,632 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 20 states, 20 states have (on average 5.95) internal successors, (119), 20 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:17,632 INFO L276 IsEmpty]: Start isEmpty. Operand 7798 states and 15891 transitions. [2021-07-09 17:07:17,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-07-09 17:07:17,636 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:17,636 INFO L508 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:07:17,855 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2021-07-09 17:07:17,855 INFO L430 AbstractCegarLoop]: === Iteration 8 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:17,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:17,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1814809251, now seen corresponding path program 1 times [2021-07-09 17:07:17,856 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:17,856 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489304117] [2021-07-09 17:07:17,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:17,920 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-07-09 17:07:17,920 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:17,920 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489304117] [2021-07-09 17:07:17,920 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489304117] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:17,920 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901541819] [2021-07-09 17:07:17,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:17,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 2 conjunts are in the unsatisfiable core [2021-07-09 17:07:17,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:18,086 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2021-07-09 17:07:18,086 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1901541819] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 17:07:18,086 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2021-07-09 17:07:18,086 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2021-07-09 17:07:18,086 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450162116] [2021-07-09 17:07:18,086 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-07-09 17:07:18,086 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:18,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-07-09 17:07:18,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-07-09 17:07:18,087 INFO L87 Difference]: Start difference. First operand 7798 states and 15891 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:18,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:18,160 INFO L93 Difference]: Finished difference Result 10950 states and 22347 transitions. [2021-07-09 17:07:18,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-07-09 17:07:18,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2021-07-09 17:07:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:18,171 INFO L225 Difference]: With dead ends: 10950 [2021-07-09 17:07:18,171 INFO L226 Difference]: Without dead ends: 10950 [2021-07-09 17:07:18,171 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 10.4ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-07-09 17:07:18,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10950 states. [2021-07-09 17:07:18,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10950 to 7872. [2021-07-09 17:07:18,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7872 states, 7867 states have (on average 2.0390237701792295) internal successors, (16041), 7871 states have internal predecessors, (16041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:18,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7872 states to 7872 states and 16041 transitions. [2021-07-09 17:07:18,319 INFO L78 Accepts]: Start accepts. Automaton has 7872 states and 16041 transitions. Word has length 89 [2021-07-09 17:07:18,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:18,319 INFO L482 AbstractCegarLoop]: Abstraction has 7872 states and 16041 transitions. [2021-07-09 17:07:18,319 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:18,319 INFO L276 IsEmpty]: Start isEmpty. Operand 7872 states and 16041 transitions. [2021-07-09 17:07:18,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-07-09 17:07:18,323 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:18,323 INFO L508 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 17:07:18,541 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:18,542 INFO L430 AbstractCegarLoop]: === Iteration 9 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:18,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:18,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1681592716, now seen corresponding path program 1 times [2021-07-09 17:07:18,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:18,542 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009312642] [2021-07-09 17:07:18,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:18,574 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2021-07-09 17:07:18,574 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:18,574 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009312642] [2021-07-09 17:07:18,574 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009312642] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:18,574 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833699983] [2021-07-09 17:07:18,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:18,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:18,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 12 conjunts are in the unsatisfiable core [2021-07-09 17:07:18,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-07-09 17:07:18,816 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833699983] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:18,816 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:07:18,817 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 13] total 16 [2021-07-09 17:07:18,817 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059950436] [2021-07-09 17:07:18,817 INFO L462 AbstractCegarLoop]: Interpolant automaton has 16 states [2021-07-09 17:07:18,817 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:18,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2021-07-09 17:07:18,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2021-07-09 17:07:18,818 INFO L87 Difference]: Start difference. First operand 7872 states and 16041 transitions. Second operand has 16 states, 16 states have (on average 8.0625) internal successors, (129), 16 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-07-09 17:07:18,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:18,968 INFO L93 Difference]: Finished difference Result 874 states and 1637 transitions. [2021-07-09 17:07:18,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-07-09 17:07:18,968 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.0625) internal successors, (129), 16 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 94 [2021-07-09 17:07:18,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:18,969 INFO L225 Difference]: With dead ends: 874 [2021-07-09 17:07:18,969 INFO L226 Difference]: Without dead ends: 874 [2021-07-09 17:07:18,970 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 167.8ms TimeCoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2021-07-09 17:07:18,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2021-07-09 17:07:18,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 871. [2021-07-09 17:07:18,979 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-07-09 17:07:18,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1634 transitions. [2021-07-09 17:07:18,980 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1634 transitions. Word has length 94 [2021-07-09 17:07:18,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:18,980 INFO L482 AbstractCegarLoop]: Abstraction has 871 states and 1634 transitions. [2021-07-09 17:07:18,980 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 16 states, 16 states have (on average 8.0625) internal successors, (129), 16 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-07-09 17:07:18,980 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1634 transitions. [2021-07-09 17:07:18,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2021-07-09 17:07:18,981 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:18,981 INFO L508 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-07-09 17:07:19,198 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:19,199 INFO L430 AbstractCegarLoop]: === Iteration 10 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:19,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:19,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1506381164, now seen corresponding path program 1 times [2021-07-09 17:07:19,199 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:19,199 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571822380] [2021-07-09 17:07:19,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:19,297 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-07-09 17:07:19,298 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:19,298 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571822380] [2021-07-09 17:07:19,298 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571822380] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:19,298 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037468812] [2021-07-09 17:07:19,298 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-07-09 17:07:19,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:19,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 14 conjunts are in the unsatisfiable core [2021-07-09 17:07:19,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:19,571 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-07-09 17:07:19,571 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037468812] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:19,571 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:07:19,572 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 17 [2021-07-09 17:07:19,572 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128435060] [2021-07-09 17:07:19,572 INFO L462 AbstractCegarLoop]: Interpolant automaton has 17 states [2021-07-09 17:07:19,572 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:19,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-07-09 17:07:19,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2021-07-09 17:07:19,573 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-07-09 17:07:19,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:19,709 INFO L93 Difference]: Finished difference Result 879 states and 1642 transitions. [2021-07-09 17:07:19,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-07-09 17:07:19,710 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-07-09 17:07:19,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:19,710 INFO L225 Difference]: With dead ends: 879 [2021-07-09 17:07:19,710 INFO L226 Difference]: Without dead ends: 879 [2021-07-09 17:07:19,711 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 168.2ms TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2021-07-09 17:07:19,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2021-07-09 17:07:19,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 876. [2021-07-09 17:07:19,719 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-07-09 17:07:19,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1639 transitions. [2021-07-09 17:07:19,721 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1639 transitions. Word has length 111 [2021-07-09 17:07:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:19,721 INFO L482 AbstractCegarLoop]: Abstraction has 876 states and 1639 transitions. [2021-07-09 17:07:19,721 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-07-09 17:07:19,721 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1639 transitions. [2021-07-09 17:07:19,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2021-07-09 17:07:19,722 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:19,722 INFO L508 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-07-09 17:07:19,940 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-07-09 17:07:19,943 INFO L430 AbstractCegarLoop]: === Iteration 11 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:19,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:19,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1064749419, now seen corresponding path program 2 times [2021-07-09 17:07:19,943 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:19,943 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697510979] [2021-07-09 17:07:19,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:19,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:20,049 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-07-09 17:07:20,050 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:20,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697510979] [2021-07-09 17:07:20,050 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697510979] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:20,050 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578839805] [2021-07-09 17:07:20,050 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-07-09 17:07:20,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-07-09 17:07:20,143 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:07:20,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 16 conjunts are in the unsatisfiable core [2021-07-09 17:07:20,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:20,266 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-07-09 17:07:20,267 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578839805] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:20,267 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:07:20,267 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 19 [2021-07-09 17:07:20,267 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346116390] [2021-07-09 17:07:20,267 INFO L462 AbstractCegarLoop]: Interpolant automaton has 19 states [2021-07-09 17:07:20,267 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:20,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2021-07-09 17:07:20,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2021-07-09 17:07:20,268 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-07-09 17:07:20,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:20,424 INFO L93 Difference]: Finished difference Result 884 states and 1647 transitions. [2021-07-09 17:07:20,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2021-07-09 17:07:20,425 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-07-09 17:07:20,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:20,439 INFO L225 Difference]: With dead ends: 884 [2021-07-09 17:07:20,439 INFO L226 Difference]: Without dead ends: 884 [2021-07-09 17:07:20,439 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 193.5ms TimeCoverageRelationStatistics Valid=340, Invalid=716, Unknown=0, NotChecked=0, Total=1056 [2021-07-09 17:07:20,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2021-07-09 17:07:20,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 881. [2021-07-09 17:07:20,447 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-07-09 17:07:20,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1644 transitions. [2021-07-09 17:07:20,448 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1644 transitions. Word has length 116 [2021-07-09 17:07:20,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:20,448 INFO L482 AbstractCegarLoop]: Abstraction has 881 states and 1644 transitions. [2021-07-09 17:07:20,448 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-07-09 17:07:20,448 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1644 transitions. [2021-07-09 17:07:20,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-07-09 17:07:20,450 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:20,450 INFO L508 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-07-09 17:07:20,667 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:20,668 INFO L430 AbstractCegarLoop]: === Iteration 12 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:20,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:20,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1056584908, now seen corresponding path program 3 times [2021-07-09 17:07:20,668 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:20,668 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922236459] [2021-07-09 17:07:20,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:20,818 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-07-09 17:07:20,818 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:20,818 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922236459] [2021-07-09 17:07:20,818 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922236459] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:20,818 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439106087] [2021-07-09 17:07:20,818 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-07-09 17:07:20,894 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-07-09 17:07:20,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:07:20,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 28 conjunts are in the unsatisfiable core [2021-07-09 17:07:20,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:20,914 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-07-09 17:07:20,915 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:20,916 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:20,917 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:20,917 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-09 17:07:20,930 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-07-09 17:07:20,930 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:20,933 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:20,934 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:20,934 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-09 17:07:21,008 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-09 17:07:21,009 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-07-09 17:07:21,010 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:21,013 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:21,013 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:21,013 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-09 17:07:21,048 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-07-09 17:07:21,051 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-07-09 17:07:21,052 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:21,055 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:21,056 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:21,059 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:21,061 INFO L550 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:21,061 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:26, output treesize:6 [2021-07-09 17:07:21,160 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-07-09 17:07:21,161 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:21,164 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:21,164 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:21,164 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:18 [2021-07-09 17:07:21,241 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-07-09 17:07:21,242 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:21,243 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:21,244 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-07-09 17:07:21,244 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:12 [2021-07-09 17:07:21,309 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-07-09 17:07:21,310 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:21,311 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:21,312 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-07-09 17:07:21,312 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:14, output treesize:6 [2021-07-09 17:07:21,367 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2021-07-09 17:07:21,367 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439106087] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:21,368 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:07:21,368 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2021-07-09 17:07:21,368 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921284682] [2021-07-09 17:07:21,368 INFO L462 AbstractCegarLoop]: Interpolant automaton has 35 states [2021-07-09 17:07:21,368 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:21,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2021-07-09 17:07:21,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1044, Unknown=0, NotChecked=0, Total=1190 [2021-07-09 17:07:21,370 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-07-09 17:07:23,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:23,101 INFO L93 Difference]: Finished difference Result 1884 states and 3499 transitions. [2021-07-09 17:07:23,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2021-07-09 17:07:23,102 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-07-09 17:07:23,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:23,105 INFO L225 Difference]: With dead ends: 1884 [2021-07-09 17:07:23,105 INFO L226 Difference]: Without dead ends: 1590 [2021-07-09 17:07:23,107 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 105 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2426 ImplicationChecksByTransitivity, 1542.4ms TimeCoverageRelationStatistics Valid=1233, Invalid=7887, Unknown=0, NotChecked=0, Total=9120 [2021-07-09 17:07:23,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2021-07-09 17:07:23,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 885. [2021-07-09 17:07:23,116 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-07-09 17:07:23,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1634 transitions. [2021-07-09 17:07:23,117 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1634 transitions. Word has length 121 [2021-07-09 17:07:23,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:23,117 INFO L482 AbstractCegarLoop]: Abstraction has 885 states and 1634 transitions. [2021-07-09 17:07:23,117 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-07-09 17:07:23,117 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1634 transitions. [2021-07-09 17:07:23,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-07-09 17:07:23,119 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:23,119 INFO L508 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-07-09 17:07:23,336 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:07:23,336 INFO L430 AbstractCegarLoop]: === Iteration 13 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:23,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:23,337 INFO L82 PathProgramCache]: Analyzing trace with hash -697132275, now seen corresponding path program 1 times [2021-07-09 17:07:23,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:23,337 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484635191] [2021-07-09 17:07:23,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:23,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:23,501 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-07-09 17:07:23,501 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:23,501 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484635191] [2021-07-09 17:07:23,501 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484635191] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:23,501 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284334226] [2021-07-09 17:07:23,502 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-07-09 17:07:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:23,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 20 conjunts are in the unsatisfiable core [2021-07-09 17:07:23,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:23,733 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2021-07-09 17:07:23,733 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284334226] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:23,734 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:07:23,734 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 23 [2021-07-09 17:07:23,734 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195597498] [2021-07-09 17:07:23,734 INFO L462 AbstractCegarLoop]: Interpolant automaton has 23 states [2021-07-09 17:07:23,734 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:23,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2021-07-09 17:07:23,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2021-07-09 17:07:23,735 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-07-09 17:07:23,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:07:23,946 INFO L93 Difference]: Finished difference Result 890 states and 1639 transitions. [2021-07-09 17:07:23,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2021-07-09 17:07:23,946 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-07-09 17:07:23,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:07:23,948 INFO L225 Difference]: With dead ends: 890 [2021-07-09 17:07:23,948 INFO L226 Difference]: Without dead ends: 890 [2021-07-09 17:07:23,948 INFO L764 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-07-09 17:07:23,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2021-07-09 17:07:23,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 890. [2021-07-09 17:07:23,957 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-07-09 17:07:23,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1639 transitions. [2021-07-09 17:07:23,958 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1639 transitions. Word has length 135 [2021-07-09 17:07:23,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:07:23,958 INFO L482 AbstractCegarLoop]: Abstraction has 890 states and 1639 transitions. [2021-07-09 17:07:23,958 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-07-09 17:07:23,958 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1639 transitions. [2021-07-09 17:07:23,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-07-09 17:07:23,960 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:07:23,960 INFO L508 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-07-09 17:07:24,177 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2021-07-09 17:07:24,178 INFO L430 AbstractCegarLoop]: === Iteration 14 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:07:24,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:07:24,178 INFO L82 PathProgramCache]: Analyzing trace with hash 434744334, now seen corresponding path program 2 times [2021-07-09 17:07:24,178 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:07:24,178 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266481519] [2021-07-09 17:07:24,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:07:24,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:07:24,548 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-09 17:07:24,548 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:07:24,548 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266481519] [2021-07-09 17:07:24,548 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266481519] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:24,548 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604329199] [2021-07-09 17:07:24,548 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-07-09 17:07:24,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-07-09 17:07:24,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:07:24,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 27 conjunts are in the unsatisfiable core [2021-07-09 17:07:24,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:07:24,651 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-07-09 17:07:24,652 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:24,653 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:24,653 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:24,653 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-09 17:07:24,658 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-07-09 17:07:24,659 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:24,661 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:24,662 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:24,662 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-09 17:07:24,740 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-09 17:07:24,740 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-07-09 17:07:24,741 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:24,744 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:24,744 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:24,744 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-09 17:07:24,755 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-07-09 17:07:24,758 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-07-09 17:07:24,759 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:24,762 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:24,762 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:24,766 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:24,767 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:24,767 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-07-09 17:07:24,844 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-07-09 17:07:24,845 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:24,850 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:24,851 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-07-09 17:07:24,851 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2021-07-09 17:07:25,771 WARN L205 SmtUtils]: Spent 309.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2021-07-09 17:07:25,784 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-07-09 17:07:25,789 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-07-09 17:07:25,789 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:25,793 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:25,794 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:07:25,801 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:25,803 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-07-09 17:07:25,803 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:41, output treesize:22 [2021-07-09 17:07:27,008 WARN L205 SmtUtils]: Spent 313.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2021-07-09 17:07:27,050 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-07-09 17:07:27,051 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:27,055 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:27,057 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-07-09 17:07:27,057 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:19 [2021-07-09 17:07:32,441 WARN L205 SmtUtils]: Spent 466.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2021-07-09 17:07:33,160 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-07-09 17:07:33,766 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-07-09 17:07:34,257 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-07-09 17:07:34,889 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-07-09 17:07:35,071 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-07-09 17:07:35,072 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:07:35,082 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:07:35,092 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-07-09 17:07:35,092 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:52, output treesize:45 [2021-07-09 17:07:35,163 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 235 trivial. 8 not checked. [2021-07-09 17:07:35,163 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604329199] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:07:35,163 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:07:35,163 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 29 [2021-07-09 17:07:35,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379408218] [2021-07-09 17:07:35,164 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-07-09 17:07:35,164 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:07:35,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-07-09 17:07:35,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=488, Unknown=21, NotChecked=196, Total=812 [2021-07-09 17:07:35,165 INFO L87 Difference]: Start difference. First operand 890 states and 1639 transitions. Second operand has 29 states, 29 states have (on average 5.310344827586207) internal successors, (154), 29 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:07:46,838 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 58 [2021-07-09 17:07:50,085 WARN L205 SmtUtils]: Spent 409.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2021-07-09 17:08:11,477 WARN L205 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 68 DAG size of output: 54 [2021-07-09 17:08:19,466 WARN L205 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 57 DAG size of output: 36 [2021-07-09 17:08:24,534 WARN L205 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2021-07-09 17:08:29,918 WARN L205 SmtUtils]: Spent 745.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 29 [2021-07-09 17:08:32,619 WARN L205 SmtUtils]: Spent 909.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2021-07-09 17:08:40,419 WARN L205 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2021-07-09 17:08:52,667 WARN L205 SmtUtils]: Spent 3.29 s on a formula simplification. DAG size of input: 73 DAG size of output: 52 [2021-07-09 17:09:01,403 WARN L205 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 53 DAG size of output: 45 [2021-07-09 17:09:22,393 WARN L205 SmtUtils]: Spent 4.73 s on a formula simplification. DAG size of input: 78 DAG size of output: 68 [2021-07-09 17:09:37,510 WARN L205 SmtUtils]: Spent 2.55 s on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2021-07-09 17:10:34,105 WARN L205 SmtUtils]: Spent 1.43 s on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2021-07-09 17:10:46,816 WARN L205 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2021-07-09 17:11:19,726 WARN L205 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2021-07-09 17:11:43,658 WARN L205 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2021-07-09 17:12:31,602 WARN L205 SmtUtils]: Spent 4.62 s on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2021-07-09 17:12:40,398 WARN L205 SmtUtils]: Spent 1.34 s on a formula simplification that was a NOOP. DAG size: 41 [2021-07-09 17:13:01,572 WARN L205 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2021-07-09 17:13:15,058 WARN L205 SmtUtils]: Spent 943.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 33 [2021-07-09 17:13:26,467 WARN L205 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 41 DAG size of output: 33 [2021-07-09 17:13:59,198 WARN L205 SmtUtils]: Spent 4.77 s on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2021-07-09 17:14:22,419 WARN L205 SmtUtils]: Spent 4.00 s on a formula simplification. DAG size of input: 77 DAG size of output: 56 [2021-07-09 17:14:36,767 WARN L205 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2021-07-09 17:15:15,265 WARN L205 SmtUtils]: Spent 6.87 s on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2021-07-09 17:15:36,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:15:36,459 INFO L93 Difference]: Finished difference Result 3833 states and 7318 transitions. [2021-07-09 17:15:36,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2021-07-09 17:15:36,461 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 5.310344827586207) internal successors, (154), 29 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have 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-07-09 17:15:36,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:15:36,466 INFO L225 Difference]: With dead ends: 3833 [2021-07-09 17:15:36,467 INFO L226 Difference]: Without dead ends: 3833 [2021-07-09 17:15:36,468 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 134 SyntacticMatches, 3 SemanticMatches, 87 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 2273 ImplicationChecksByTransitivity, 322961.0ms TimeCoverageRelationStatistics Valid=1457, Invalid=5460, Unknown=239, NotChecked=676, Total=7832 [2021-07-09 17:15:36,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3833 states. [2021-07-09 17:15:36,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3833 to 1390. [2021-07-09 17:15:36,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1389 states have (on average 1.8610511159107272) internal successors, (2585), 1389 states have internal predecessors, (2585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:15:36,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 2585 transitions. [2021-07-09 17:15:36,498 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 2585 transitions. Word has length 140 [2021-07-09 17:15:36,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:15:36,498 INFO L482 AbstractCegarLoop]: Abstraction has 1390 states and 2585 transitions. [2021-07-09 17:15:36,498 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 29 states, 29 states have (on average 5.310344827586207) internal successors, (154), 29 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:15:36,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 2585 transitions. [2021-07-09 17:15:36,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-07-09 17:15:36,500 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:15:36,500 INFO L508 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-07-09 17:15:36,701 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-07-09 17:15:36,701 INFO L430 AbstractCegarLoop]: === Iteration 15 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:15:36,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:15:36,701 INFO L82 PathProgramCache]: Analyzing trace with hash 37532416, now seen corresponding path program 3 times [2021-07-09 17:15:36,702 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:15:36,702 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640611059] [2021-07-09 17:15:36,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:15:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:15:37,118 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-09 17:15:37,118 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:15:37,118 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640611059] [2021-07-09 17:15:37,118 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640611059] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:15:37,118 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161754615] [2021-07-09 17:15:37,119 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-07-09 17:15:37,199 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2021-07-09 17:15:37,200 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:15:37,201 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 35 conjunts are in the unsatisfiable core [2021-07-09 17:15:37,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:15:37,219 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-07-09 17:15:37,220 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:15:37,222 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:15:37,223 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:15:37,223 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2021-07-09 17:15:37,243 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-07-09 17:15:37,244 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:15:37,248 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:15:37,248 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:15:37,248 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2021-07-09 17:15:37,342 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-09 17:15:37,342 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-07-09 17:15:37,344 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:15:37,347 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:15:37,348 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:15:37,348 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2021-07-09 17:15:37,372 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-07-09 17:15:37,375 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-07-09 17:15:37,376 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:15:37,379 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:15:37,380 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:15:37,385 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:15:37,385 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:15:37,386 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:14 [2021-07-09 17:15:37,494 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-07-09 17:15:37,495 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:15:37,503 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:15:37,504 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-07-09 17:15:37,504 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:40, output treesize:32 [2021-07-09 17:15:38,193 WARN L205 SmtUtils]: Spent 351.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2021-07-09 17:15:38,247 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-07-09 17:15:38,248 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:15:38,253 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:15:38,254 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2021-07-09 17:15:38,254 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:26 [2021-07-09 17:15:38,987 WARN L205 SmtUtils]: Spent 354.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2021-07-09 17:15:39,397 WARN L205 SmtUtils]: Spent 355.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2021-07-09 17:15:39,777 WARN L205 SmtUtils]: Spent 352.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2021-07-09 17:15:39,789 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-07-09 17:15:39,793 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-07-09 17:15:39,794 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:15:39,798 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:15:39,798 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:15:39,806 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:15:39,807 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-07-09 17:15:39,807 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:37, output treesize:18 [2021-07-09 17:15:40,184 WARN L205 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2021-07-09 17:15:40,593 WARN L205 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2021-07-09 17:15:40,997 WARN L205 SmtUtils]: Spent 364.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2021-07-09 17:15:41,034 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-07-09 17:15:41,035 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:15:41,041 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:15:41,046 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-07-09 17:15:41,046 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:25 [2021-07-09 17:15:41,124 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-09 17:15:41,124 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161754615] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:15:41,124 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:15:41,124 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2021-07-09 17:15:41,124 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065222863] [2021-07-09 17:15:41,125 INFO L462 AbstractCegarLoop]: Interpolant automaton has 33 states [2021-07-09 17:15:41,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:15:41,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2021-07-09 17:15:41,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=911, Unknown=2, NotChecked=0, Total=1056 [2021-07-09 17:15:41,125 INFO L87 Difference]: Start difference. First operand 1390 states and 2585 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-07-09 17:15:50,549 WARN L205 SmtUtils]: Spent 770.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2021-07-09 17:15:51,844 WARN L205 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2021-07-09 17:15:52,666 WARN L205 SmtUtils]: Spent 804.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2021-07-09 17:15:54,406 WARN L205 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2021-07-09 17:15:55,346 WARN L205 SmtUtils]: Spent 866.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2021-07-09 17:15:56,311 WARN L205 SmtUtils]: Spent 912.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2021-07-09 17:15:56,717 WARN L205 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-07-09 17:15:57,581 WARN L205 SmtUtils]: Spent 810.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2021-07-09 17:15:59,294 WARN L205 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2021-07-09 17:16:00,647 WARN L205 SmtUtils]: Spent 1.29 s on a formula simplification that was a NOOP. DAG size: 39 [2021-07-09 17:16:02,392 WARN L205 SmtUtils]: Spent 1.73 s on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2021-07-09 17:16:05,606 WARN L205 SmtUtils]: Spent 1.40 s on a formula simplification that was a NOOP. DAG size: 41 [2021-07-09 17:16:07,396 WARN L205 SmtUtils]: Spent 1.76 s on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2021-07-09 17:16:09,340 WARN L205 SmtUtils]: Spent 1.33 s on a formula simplification that was a NOOP. DAG size: 43 [2021-07-09 17:16:10,842 WARN L205 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 45 [2021-07-09 17:16:12,259 WARN L205 SmtUtils]: Spent 1.36 s on a formula simplification that was a NOOP. DAG size: 43 [2021-07-09 17:16:13,430 WARN L205 SmtUtils]: Spent 399.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2021-07-09 17:16:14,413 WARN L205 SmtUtils]: Spent 382.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2021-07-09 17:16:15,840 WARN L205 SmtUtils]: Spent 1.39 s on a formula simplification that was a NOOP. DAG size: 45 [2021-07-09 17:16:16,257 WARN L205 SmtUtils]: Spent 375.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-07-09 17:16:17,764 WARN L205 SmtUtils]: Spent 822.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2021-07-09 17:16:18,232 WARN L205 SmtUtils]: Spent 376.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-07-09 17:16:19,636 WARN L205 SmtUtils]: Spent 813.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-07-09 17:16:20,993 WARN L205 SmtUtils]: Spent 1.32 s on a formula simplification that was a NOOP. DAG size: 42 [2021-07-09 17:16:22,502 WARN L205 SmtUtils]: Spent 1.40 s on a formula simplification that was a NOOP. DAG size: 44 [2021-07-09 17:16:23,911 WARN L205 SmtUtils]: Spent 1.38 s on a formula simplification that was a NOOP. DAG size: 46 [2021-07-09 17:16:24,339 WARN L205 SmtUtils]: Spent 397.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2021-07-09 17:16:24,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 17:16:24,351 INFO L93 Difference]: Finished difference Result 3350 states and 6237 transitions. [2021-07-09 17:16:24,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2021-07-09 17:16:24,352 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-07-09 17:16:24,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 17:16:24,357 INFO L225 Difference]: With dead ends: 3350 [2021-07-09 17:16:24,357 INFO L226 Difference]: Without dead ends: 3350 [2021-07-09 17:16:24,359 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 126 SyntacticMatches, 3 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1766 ImplicationChecksByTransitivity, 33876.7ms TimeCoverageRelationStatistics Valid=1142, Invalid=4860, Unknown=4, NotChecked=0, Total=6006 [2021-07-09 17:16:24,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3350 states. [2021-07-09 17:16:24,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3350 to 1590. [2021-07-09 17:16:24,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1590 states, 1589 states have (on average 1.8860918816865953) internal successors, (2997), 1589 states have internal predecessors, (2997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:16:24,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 2997 transitions. [2021-07-09 17:16:24,390 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 2997 transitions. Word has length 140 [2021-07-09 17:16:24,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 17:16:24,390 INFO L482 AbstractCegarLoop]: Abstraction has 1590 states and 2997 transitions. [2021-07-09 17:16:24,390 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-07-09 17:16:24,390 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2997 transitions. [2021-07-09 17:16:24,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2021-07-09 17:16:24,392 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 17:16:24,392 INFO L508 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-07-09 17:16:24,609 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2021-07-09 17:16:24,609 INFO L430 AbstractCegarLoop]: === Iteration 16 === [t_funErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 17:16:24,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 17:16:24,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1937316018, now seen corresponding path program 4 times [2021-07-09 17:16:24,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 17:16:24,609 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805239387] [2021-07-09 17:16:24,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 17:16:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 17:16:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2021-07-09 17:16:25,026 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 17:16:25,026 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805239387] [2021-07-09 17:16:25,026 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805239387] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:16:25,026 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423659277] [2021-07-09 17:16:25,026 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-07-09 17:16:25,125 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-07-09 17:16:25,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-07-09 17:16:25,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 27 conjunts are in the unsatisfiable core [2021-07-09 17:16:25,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-07-09 17:16:25,146 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-07-09 17:16:25,147 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:16:25,148 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:16:25,148 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:16:25,148 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2021-07-09 17:16:25,154 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-07-09 17:16:25,154 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:16:25,158 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:16:25,158 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:16:25,158 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2021-07-09 17:16:25,233 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-07-09 17:16:25,234 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-07-09 17:16:25,235 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:16:25,238 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:16:25,239 INFO L550 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:16:25,239 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2021-07-09 17:16:25,250 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-07-09 17:16:25,253 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-07-09 17:16:25,254 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:16:25,257 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:16:25,258 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:16:25,262 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:16:25,263 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:16:25,263 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2021-07-09 17:16:25,343 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-07-09 17:16:25,344 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:16:25,349 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:16:25,350 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-07-09 17:16:25,350 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:26 [2021-07-09 17:16:26,417 WARN L205 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2021-07-09 17:16:26,456 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 25 treesize of output 20 [2021-07-09 17:16:26,457 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:16:26,462 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:16:26,464 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-07-09 17:16:26,464 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:23 [2021-07-09 17:16:30,075 WARN L205 SmtUtils]: Spent 422.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2021-07-09 17:16:36,559 WARN L205 SmtUtils]: Spent 653.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2021-07-09 17:16:47,477 WARN L205 SmtUtils]: Spent 651.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2021-07-09 17:16:48,980 WARN L205 SmtUtils]: Spent 501.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2021-07-09 17:16:53,032 WARN L205 SmtUtils]: Spent 570.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2021-07-09 17:16:53,092 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 40 treesize of output 40 [2021-07-09 17:16:53,097 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2021-07-09 17:16:53,098 INFO L550 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-07-09 17:16:53,102 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:16:53,103 INFO L550 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2021-07-09 17:16:53,115 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:16:53,122 INFO L550 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2021-07-09 17:16:53,123 INFO L247 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:64, output treesize:45 [2021-07-09 17:16:53,962 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-07-09 17:16:54,119 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-07-09 17:16:54,120 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-07-09 17:16:54,130 INFO L628 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 17:16:54,140 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-07-09 17:16:54,141 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:52, output treesize:45 [2021-07-09 17:16:54,212 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 235 trivial. 3 not checked. [2021-07-09 17:16:54,213 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423659277] provided 0 perfect and 1 imperfect interpolant sequences [2021-07-09 17:16:54,213 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-07-09 17:16:54,213 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 29 [2021-07-09 17:16:54,213 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686423895] [2021-07-09 17:16:54,213 INFO L462 AbstractCegarLoop]: Interpolant automaton has 29 states [2021-07-09 17:16:54,213 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 17:16:54,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2021-07-09 17:16:54,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=614, Unknown=31, NotChecked=52, Total=812 [2021-07-09 17:16:54,214 INFO L87 Difference]: Start difference. First operand 1590 states and 2997 transitions. Second operand has 29 states, 29 states have (on average 5.310344827586207) internal successors, (154), 29 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-07-09 17:17:12,018 WARN L205 SmtUtils]: Spent 487.00 ms on a formula simplification that was a NOOP. DAG size: 41 [2021-07-09 17:17:15,495 WARN L205 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2021-07-09 17:17:21,168 WARN L205 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2021-07-09 17:17:30,719 WARN L205 SmtUtils]: Spent 2.64 s on a formula simplification that was a NOOP. DAG size: 50 [2021-07-09 17:18:06,948 WARN L205 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2021-07-09 17:18:25,130 WARN L205 SmtUtils]: Spent 3.71 s on a formula simplification that was a NOOP. DAG size: 52 [2021-07-09 17:18:31,556 WARN L205 SmtUtils]: Spent 3.26 s on a formula simplification that was a NOOP. DAG size: 54 [2021-07-09 17:18:33,976 WARN L205 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 28 [2021-07-09 17:18:36,842 WARN L205 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2021-07-09 17:18:49,284 WARN L205 SmtUtils]: Spent 2.74 s on a formula simplification that was a NOOP. DAG size: 56 [2021-07-09 17:19:06,093 WARN L205 SmtUtils]: Spent 4.03 s on a formula simplification that was a NOOP. DAG size: 54 [2021-07-09 17:19:34,339 WARN L205 SmtUtils]: Spent 6.04 s on a formula simplification that was a NOOP. DAG size: 64 [2021-07-09 17:19:41,813 WARN L205 SmtUtils]: Spent 873.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2021-07-09 17:19:43,492 WARN L205 SmtUtils]: Spent 549.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2021-07-09 17:19:44,068 WARN L205 SmtUtils]: Spent 549.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2021-07-09 17:19:47,226 WARN L205 SmtUtils]: Spent 433.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2021-07-09 17:20:21,150 WARN L205 SmtUtils]: Spent 3.51 s on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2021-07-09 17:20:24,200 WARN L205 SmtUtils]: Spent 3.01 s on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2021-07-09 17:20:37,243 WARN L205 SmtUtils]: Spent 4.04 s on a formula simplification that was a NOOP. DAG size: 56 [2021-07-09 17:21:01,533 WARN L205 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2021-07-09 17:21:08,022 WARN L205 SmtUtils]: Spent 2.02 s on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2021-07-09 17:21:21,943 WARN L205 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 54 DAG size of output: 44 Received shutdown request... [2021-07-09 17:21:51,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2021-07-09 17:21:52,107 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-07-09 17:21:52,108 WARN L547 AbstractCegarLoop]: Verification canceled [2021-07-09 17:21:52,108 INFO L301 ceAbstractionStarter]: Result for error location t_funThread1of1ForFork0 was TIMEOUT (1/2) [2021-07-09 17:21:52,110 INFO L255 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-07-09 17:21:52,110 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 17:21:52,110 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 17:21:52,110 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 17:21:52,110 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 17:21:52,110 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 17:21:52,110 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 17:21:52,111 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 17:21:52,111 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-09 17:21:52,113 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 194 places, 236 transitions, 480 flow [2021-07-09 17:21:52,113 WARN L547 AbstractCegarLoop]: Verification canceled [2021-07-09 17:21:52,113 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was TIMEOUT (2/2) [2021-07-09 17:21:52,114 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-09 17:21:52,115 WARN L196 ceAbstractionStarter]: Timeout [2021-07-09 17:21:52,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.07 05:21:52 BasicIcfg [2021-07-09 17:21:52,115 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-09 17:21:52,116 INFO L168 Benchmark]: Toolchain (without parser) took 882700.49 ms. Allocated memory was 178.3 MB in the beginning and 879.8 MB in the end (delta: 701.5 MB). Free memory was 139.9 MB in the beginning and 363.0 MB in the end (delta: -223.1 MB). Peak memory consumption was 479.3 MB. Max. memory is 8.0 GB. [2021-07-09 17:21:52,116 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 178.3 MB. Free memory is still 158.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-07-09 17:21:52,116 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.45 ms. Allocated memory is still 178.3 MB. Free memory was 139.7 MB in the beginning and 141.4 MB in the end (delta: -1.7 MB). Peak memory consumption was 11.4 MB. Max. memory is 8.0 GB. [2021-07-09 17:21:52,116 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.34 ms. Allocated memory is still 178.3 MB. Free memory was 141.4 MB in the beginning and 138.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-07-09 17:21:52,116 INFO L168 Benchmark]: Boogie Preprocessor took 22.05 ms. Allocated memory is still 178.3 MB. Free memory was 138.7 MB in the beginning and 136.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-09 17:21:52,116 INFO L168 Benchmark]: RCFGBuilder took 550.00 ms. Allocated memory is still 178.3 MB. Free memory was 136.7 MB in the beginning and 94.2 MB in the end (delta: 42.5 MB). Peak memory consumption was 41.9 MB. Max. memory is 8.0 GB. [2021-07-09 17:21:52,116 INFO L168 Benchmark]: TraceAbstraction took 881726.68 ms. Allocated memory was 178.3 MB in the beginning and 879.8 MB in the end (delta: 701.5 MB). Free memory was 93.7 MB in the beginning and 363.0 MB in the end (delta: -269.3 MB). Peak memory consumption was 433.2 MB. Max. memory is 8.0 GB. [2021-07-09 17:21:52,116 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.15 ms. Allocated memory is still 178.3 MB. Free memory is still 158.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 364.45 ms. Allocated memory is still 178.3 MB. Free memory was 139.7 MB in the beginning and 141.4 MB in the end (delta: -1.7 MB). Peak memory consumption was 11.4 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 33.34 ms. Allocated memory is still 178.3 MB. Free memory was 141.4 MB in the beginning and 138.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 22.05 ms. Allocated memory is still 178.3 MB. Free memory was 138.7 MB in the beginning and 136.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 550.00 ms. Allocated memory is still 178.3 MB. Free memory was 136.7 MB in the beginning and 94.2 MB in the end (delta: 42.5 MB). Peak memory consumption was 41.9 MB. Max. memory is 8.0 GB. * TraceAbstraction took 881726.68 ms. Allocated memory was 178.3 MB in the beginning and 879.8 MB in the end (delta: 701.5 MB). Free memory was 93.7 MB in the beginning and 363.0 MB in the end (delta: -269.3 MB). Peak memory consumption was 433.2 MB. Max. memory is 8.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 constructing difference of abstraction (1590states) and FLOYD_HOARE automaton (currently 45 states, 29 states before enhancement),while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 70 known predicates. - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 194 places, 236 transitions, 480 flow. Already constructed 2 states. Currently 1 states in worklist.. - TimeoutResultAtElement [Line: 922]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while BasicCegarLoop was constructing initial abstraction,while PetriNet2FiniteAutomaton was constructing automaton for Petri net that has has 194 places, 236 transitions, 480 flow. Already constructed 2 states. Currently 1 states in worklist.. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t_funThread1of1ForFork0 with 1 thread instances CFG has 3 procedures, 246 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 881564.1ms, OverallIterations: 16, TraceHistogramMax: 10, EmptinessCheckTime: 59.0ms, AutomataDifference: 827369.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 133.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3503 SDtfs, 12568 SDslu, 25800 SDs, 0 SdLazy, 5944 SolverSat, 615 SolverUnsat, 500 SolverUnknown, 0 SolverNotchecked, 355909.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1934 GetRequests, 1339 SyntacticMatches, 12 SemanticMatches, 582 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 9726 ImplicationChecksByTransitivity, 495285.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=7872occurred in iteration=8, InterpolantAutomatonStates: 386, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1508.1ms AutomataMinimizationTime, 15 MinimizatonAttempts, 22784 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 233.5ms SsaConstructionTime, 550.4ms SatisfiabilityAnalysisTime, 47696.4ms InterpolantComputationTime, 2910 NumberOfCodeBlocks, 2805 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2880 ConstructedInterpolants, 99 QuantifiedInterpolants, 20391 SizeOfPredicates, 181 NumberOfNonLiveVariables, 2778 ConjunctsInSsa, 228 ConjunctsInUnsatCore, 30 InterpolantComputations, 4 PerfectInterpolantSequences, 1870/2996 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 errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 3 procedures, 246 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: TIMEOUT, OverallTime: 3.2ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 0.0ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 2.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown