/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/list-properties/splice-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 17:42:01,799 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 17:42:01,800 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 17:42:01,850 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 17:42:01,850 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 17:42:01,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 17:42:01,852 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 17:42:01,854 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 17:42:01,854 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 17:42:01,855 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 17:42:01,856 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 17:42:01,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 17:42:01,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 17:42:01,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 17:42:01,858 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 17:42:01,858 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 17:42:01,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 17:42:01,859 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 17:42:01,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 17:42:01,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 17:42:01,862 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 17:42:01,863 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 17:42:01,863 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 17:42:01,864 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 17:42:01,865 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 17:42:01,866 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 17:42:01,866 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 17:42:01,866 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 17:42:01,866 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 17:42:01,867 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 17:42:01,867 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 17:42:01,868 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 17:42:01,868 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 17:42:01,868 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 17:42:01,869 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 17:42:01,869 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 17:42:01,870 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 17:42:01,870 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 17:42:01,870 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 17:42:01,870 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 17:42:01,871 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 17:42:01,872 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 17:42:01,900 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 17:42:01,900 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 17:42:01,900 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 17:42:01,900 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 17:42:01,901 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 17:42:01,901 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 17:42:01,901 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 17:42:01,901 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 17:42:01,901 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 17:42:01,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 17:42:01,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 17:42:01,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 17:42:01,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 17:42:01,902 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 17:42:01,902 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 17:42:01,902 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 17:42:01,902 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 17:42:01,902 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 17:42:01,902 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 17:42:01,903 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 17:42:01,903 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 17:42:01,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:42:01,903 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 17:42:01,903 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 17:42:01,903 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 17:42:01,903 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 17:42:01,903 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 17:42:01,904 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 17:42:01,904 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 17:42:01,904 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 17:42:01,904 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 17:42:01,904 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 17:42:01,904 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 17:42:01,905 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 17:42:02,074 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 17:42:02,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 17:42:02,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 17:42:02,105 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 17:42:02,106 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 17:42:02,107 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/splice-2.i [2022-01-10 17:42:02,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c70a9209/b681f8505c0a4ac59196c6ef5774a819/FLAGbab7a267f [2022-01-10 17:42:02,538 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 17:42:02,539 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/splice-2.i [2022-01-10 17:42:02,546 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c70a9209/b681f8505c0a4ac59196c6ef5774a819/FLAGbab7a267f [2022-01-10 17:42:02,942 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c70a9209/b681f8505c0a4ac59196c6ef5774a819 [2022-01-10 17:42:02,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 17:42:02,945 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 17:42:02,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 17:42:02,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 17:42:02,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 17:42:02,952 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:42:02" (1/1) ... [2022-01-10 17:42:02,953 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4384221d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:42:02, skipping insertion in model container [2022-01-10 17:42:02,953 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:42:02" (1/1) ... [2022-01-10 17:42:02,957 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 17:42:02,976 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 17:42:03,175 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/splice-2.i[23721,23734] [2022-01-10 17:42:03,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:42:03,183 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 17:42:03,222 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-properties/splice-2.i[23721,23734] [2022-01-10 17:42:03,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:42:03,239 INFO L208 MainTranslator]: Completed translation [2022-01-10 17:42:03,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:42:03 WrapperNode [2022-01-10 17:42:03,240 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 17:42:03,241 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 17:42:03,241 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 17:42:03,241 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 17:42:03,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:42:03" (1/1) ... [2022-01-10 17:42:03,260 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:42:03" (1/1) ... [2022-01-10 17:42:03,277 INFO L137 Inliner]: procedures = 127, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 110 [2022-01-10 17:42:03,278 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 17:42:03,278 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 17:42:03,278 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 17:42:03,278 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 17:42:03,283 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:42:03" (1/1) ... [2022-01-10 17:42:03,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:42:03" (1/1) ... [2022-01-10 17:42:03,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:42:03" (1/1) ... [2022-01-10 17:42:03,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:42:03" (1/1) ... [2022-01-10 17:42:03,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:42:03" (1/1) ... [2022-01-10 17:42:03,293 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:42:03" (1/1) ... [2022-01-10 17:42:03,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:42:03" (1/1) ... [2022-01-10 17:42:03,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 17:42:03,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 17:42:03,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 17:42:03,296 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 17:42:03,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:42:03" (1/1) ... [2022-01-10 17:42:03,310 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:42:03,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:42:03,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 17:42:03,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 17:42:03,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 17:42:03,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 17:42:03,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 17:42:03,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 17:42:03,351 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 17:42:03,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 17:42:03,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 17:42:03,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 17:42:03,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 17:42:03,415 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 17:42:03,416 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 17:42:03,611 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 17:42:03,615 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 17:42:03,615 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-10 17:42:03,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:42:03 BoogieIcfgContainer [2022-01-10 17:42:03,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 17:42:03,617 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 17:42:03,617 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 17:42:03,618 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 17:42:03,619 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:42:03" (1/1) ... [2022-01-10 17:42:03,683 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:42:03 BasicIcfg [2022-01-10 17:42:03,683 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 17:42:03,684 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 17:42:03,684 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 17:42:03,686 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 17:42:03,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 05:42:02" (1/4) ... [2022-01-10 17:42:03,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b422941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:42:03, skipping insertion in model container [2022-01-10 17:42:03,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:42:03" (2/4) ... [2022-01-10 17:42:03,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b422941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:42:03, skipping insertion in model container [2022-01-10 17:42:03,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:42:03" (3/4) ... [2022-01-10 17:42:03,687 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b422941 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 05:42:03, skipping insertion in model container [2022-01-10 17:42:03,687 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:42:03" (4/4) ... [2022-01-10 17:42:03,688 INFO L111 eAbstractionObserver]: Analyzing ICFG splice-2.iTransformedIcfg [2022-01-10 17:42:03,691 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 17:42:03,692 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 17:42:03,722 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 17:42:03,728 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 17:42:03,728 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 17:42:03,738 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:03,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 17:42:03,742 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:42:03,743 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:42:03,743 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:42:03,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:42:03,750 INFO L85 PathProgramCache]: Analyzing trace with hash 904625206, now seen corresponding path program 1 times [2022-01-10 17:42:03,755 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:42:03,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382439110] [2022-01-10 17:42:03,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:03,757 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:42:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:03,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:42:03,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:42:03,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382439110] [2022-01-10 17:42:03,885 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382439110] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:42:03,885 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:42:03,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 17:42:03,886 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124998991] [2022-01-10 17:42:03,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:42:03,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 17:42:03,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:42:03,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 17:42:03,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 17:42:03,937 INFO L87 Difference]: Start difference. First operand has 28 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 27 states have internal predecessors, (42), 0 states have call successors, (0), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:03,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:42:03,952 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2022-01-10 17:42:03,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 17:42:03,954 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-01-10 17:42:03,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:42:03,960 INFO L225 Difference]: With dead ends: 45 [2022-01-10 17:42:03,960 INFO L226 Difference]: Without dead ends: 22 [2022-01-10 17:42:03,962 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 17:42:03,965 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:42:03,967 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:42:03,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-01-10 17:42:03,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-01-10 17:42:03,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:03,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-01-10 17:42:03,997 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 12 [2022-01-10 17:42:03,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:42:03,997 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-01-10 17:42:03,997 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:03,998 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-01-10 17:42:03,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 17:42:03,999 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:42:03,999 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:42:03,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 17:42:03,999 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:42:04,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:42:04,001 INFO L85 PathProgramCache]: Analyzing trace with hash 495463428, now seen corresponding path program 1 times [2022-01-10 17:42:04,002 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:42:04,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561370294] [2022-01-10 17:42:04,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:04,002 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:42:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:04,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:42:04,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:42:04,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561370294] [2022-01-10 17:42:04,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561370294] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:42:04,126 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:42:04,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 17:42:04,126 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346726089] [2022-01-10 17:42:04,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:42:04,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 17:42:04,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:42:04,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 17:42:04,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 17:42:04,128 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:04,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:42:04,182 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-01-10 17:42:04,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 17:42:04,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-10 17:42:04,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:42:04,183 INFO L225 Difference]: With dead ends: 39 [2022-01-10 17:42:04,183 INFO L226 Difference]: Without dead ends: 32 [2022-01-10 17:42:04,183 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 17:42:04,184 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:42:04,184 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 59 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:42:04,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-10 17:42:04,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2022-01-10 17:42:04,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:04,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-01-10 17:42:04,188 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 13 [2022-01-10 17:42:04,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:42:04,188 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-01-10 17:42:04,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:04,188 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-01-10 17:42:04,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 17:42:04,189 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:42:04,189 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:42:04,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 17:42:04,189 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:42:04,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:42:04,190 INFO L85 PathProgramCache]: Analyzing trace with hash -601965088, now seen corresponding path program 1 times [2022-01-10 17:42:04,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:42:04,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116939820] [2022-01-10 17:42:04,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:04,190 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:42:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:04,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:42:04,288 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:42:04,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116939820] [2022-01-10 17:42:04,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116939820] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:42:04,290 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:42:04,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 17:42:04,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650616682] [2022-01-10 17:42:04,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:42:04,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 17:42:04,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:42:04,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 17:42:04,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 17:42:04,293 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:04,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:42:04,347 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2022-01-10 17:42:04,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 17:42:04,348 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-10 17:42:04,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:42:04,351 INFO L225 Difference]: With dead ends: 46 [2022-01-10 17:42:04,352 INFO L226 Difference]: Without dead ends: 38 [2022-01-10 17:42:04,356 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 17:42:04,358 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 6 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:42:04,359 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 60 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:42:04,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-10 17:42:04,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-01-10 17:42:04,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 35 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:04,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 48 transitions. [2022-01-10 17:42:04,363 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 48 transitions. Word has length 15 [2022-01-10 17:42:04,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:42:04,364 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 48 transitions. [2022-01-10 17:42:04,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:04,364 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-01-10 17:42:04,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 17:42:04,364 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:42:04,364 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:42:04,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 17:42:04,365 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:42:04,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:42:04,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1523204959, now seen corresponding path program 1 times [2022-01-10 17:42:04,365 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:42:04,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489789055] [2022-01-10 17:42:04,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:04,366 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:42:04,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:04,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 17:42:04,508 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:42:04,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489789055] [2022-01-10 17:42:04,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489789055] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:42:04,508 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:42:04,508 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 17:42:04,508 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049440278] [2022-01-10 17:42:04,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:42:04,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-10 17:42:04,509 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:42:04,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-10 17:42:04,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-10 17:42:04,510 INFO L87 Difference]: Start difference. First operand 36 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:04,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:42:04,581 INFO L93 Difference]: Finished difference Result 68 states and 92 transitions. [2022-01-10 17:42:04,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 17:42:04,581 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-10 17:42:04,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:42:04,582 INFO L225 Difference]: With dead ends: 68 [2022-01-10 17:42:04,582 INFO L226 Difference]: Without dead ends: 41 [2022-01-10 17:42:04,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-10 17:42:04,588 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 40 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:42:04,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 43 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:42:04,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-10 17:42:04,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2022-01-10 17:42:04,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.3611111111111112) internal successors, (49), 36 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:04,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-01-10 17:42:04,592 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 16 [2022-01-10 17:42:04,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:42:04,593 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2022-01-10 17:42:04,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:04,593 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-01-10 17:42:04,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 17:42:04,593 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:42:04,593 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:42:04,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 17:42:04,594 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:42:04,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:42:04,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1773103351, now seen corresponding path program 1 times [2022-01-10 17:42:04,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:42:04,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882503987] [2022-01-10 17:42:04,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:04,594 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:42:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:04,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:42:04,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:42:04,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882503987] [2022-01-10 17:42:04,879 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882503987] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:42:04,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624141150] [2022-01-10 17:42:04,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:04,881 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:42:04,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:42:04,882 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:42:04,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 17:42:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:05,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 45 conjunts are in the unsatisfiable core [2022-01-10 17:42:05,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:42:05,087 INFO L387 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 [2022-01-10 17:42:05,174 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 17:42:05,219 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 17:42:05,220 INFO L387 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 [2022-01-10 17:42:05,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:42:05,284 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-10 17:42:05,358 INFO L387 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 14 treesize of output 16 [2022-01-10 17:42:05,436 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-01-10 17:42:05,436 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2022-01-10 17:42:05,499 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 17:42:05,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:42:05,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:42:09,659 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_104 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1| Int) (v_ArrVal_102 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1|)) (= (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_102) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1| 4) 18446744073709551616) v_ArrVal_104) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1|) 1))) is different from false [2022-01-10 17:42:09,696 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_104 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1| Int) (v_ArrVal_99 Int) (v_ArrVal_102 (Array Int Int))) (or (= (select (store (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_99)) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_102) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1| 4) 18446744073709551616) v_ArrVal_104) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1|) 1) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1|)))) is different from false [2022-01-10 17:42:09,824 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-10 17:42:09,827 INFO L387 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 38 [2022-01-10 17:42:09,846 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:42:09,846 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 48 [2022-01-10 17:42:09,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:42:09,851 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 7 [2022-01-10 17:42:09,920 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:42:09,922 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2022-01-10 17:42:09,933 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:42:09,938 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:42:09,939 INFO L387 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 20 treesize of output 24 [2022-01-10 17:42:10,162 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-10 17:42:10,163 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624141150] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:42:10,163 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:42:10,163 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 30 [2022-01-10 17:42:10,163 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300820772] [2022-01-10 17:42:10,164 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:42:10,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-10 17:42:10,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:42:10,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-10 17:42:10,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=636, Unknown=6, NotChecked=106, Total=870 [2022-01-10 17:42:10,167 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:10,758 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) 1) (forall ((v_ArrVal_104 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1| Int) (v_ArrVal_99 Int) (v_ArrVal_102 (Array Int Int))) (or (= (select (store (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_99)) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_102) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1| 4) 18446744073709551616) v_ArrVal_104) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1|) 1) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1|)))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|))) is different from false [2022-01-10 17:42:11,286 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1) (forall ((v_ArrVal_104 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1| Int) (v_ArrVal_102 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1|)) (= (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_102) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1| 4) 18446744073709551616) v_ArrVal_104) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_1|) 1)))) is different from false [2022-01-10 17:42:20,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:42:20,768 INFO L93 Difference]: Finished difference Result 56 states and 73 transitions. [2022-01-10 17:42:20,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 17:42:20,769 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-01-10 17:42:20,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:42:20,770 INFO L225 Difference]: With dead ends: 56 [2022-01-10 17:42:20,770 INFO L226 Difference]: Without dead ends: 54 [2022-01-10 17:42:20,771 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=151, Invalid=777, Unknown=18, NotChecked=244, Total=1190 [2022-01-10 17:42:20,771 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:42:20,771 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 97 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 67 Invalid, 0 Unknown, 149 Unchecked, 0.1s Time] [2022-01-10 17:42:20,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-10 17:42:20,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-01-10 17:42:20,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:20,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 68 transitions. [2022-01-10 17:42:20,776 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 68 transitions. Word has length 21 [2022-01-10 17:42:20,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:42:20,777 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 68 transitions. [2022-01-10 17:42:20,777 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.8333333333333333) internal successors, (55), 30 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:20,777 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 68 transitions. [2022-01-10 17:42:20,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 17:42:20,777 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:42:20,778 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:42:20,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 17:42:20,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:42:20,984 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:42:20,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:42:20,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1262569174, now seen corresponding path program 1 times [2022-01-10 17:42:20,985 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:42:20,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412321530] [2022-01-10 17:42:20,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:20,985 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:42:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:21,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 17:42:21,034 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:42:21,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412321530] [2022-01-10 17:42:21,034 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412321530] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:42:21,035 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:42:21,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:42:21,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208652277] [2022-01-10 17:42:21,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:42:21,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:42:21,037 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:42:21,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:42:21,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:42:21,037 INFO L87 Difference]: Start difference. First operand 52 states and 68 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:21,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:42:21,055 INFO L93 Difference]: Finished difference Result 97 states and 129 transitions. [2022-01-10 17:42:21,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:42:21,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-01-10 17:42:21,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:42:21,057 INFO L225 Difference]: With dead ends: 97 [2022-01-10 17:42:21,058 INFO L226 Difference]: Without dead ends: 65 [2022-01-10 17:42:21,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:42:21,060 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 18 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:42:21,061 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 58 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:42:21,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-10 17:42:21,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2022-01-10 17:42:21,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:21,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2022-01-10 17:42:21,074 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 21 [2022-01-10 17:42:21,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:42:21,074 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2022-01-10 17:42:21,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:21,074 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2022-01-10 17:42:21,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-01-10 17:42:21,075 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:42:21,075 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:42:21,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 17:42:21,075 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:42:21,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:42:21,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1149670574, now seen corresponding path program 1 times [2022-01-10 17:42:21,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:42:21,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298440599] [2022-01-10 17:42:21,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:21,076 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:42:21,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:21,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:42:21,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:42:21,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298440599] [2022-01-10 17:42:21,478 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298440599] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:42:21,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172349723] [2022-01-10 17:42:21,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:21,478 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:42:21,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:42:21,479 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:42:21,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 17:42:21,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:21,624 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 36 conjunts are in the unsatisfiable core [2022-01-10 17:42:21,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:42:21,759 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 17:42:21,767 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 17:42:21,851 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 17:42:21,853 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 17:42:21,874 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:42:21,874 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:42:22,067 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:42:22,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172349723] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:42:22,067 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:42:22,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8, 7] total 21 [2022-01-10 17:42:22,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956338408] [2022-01-10 17:42:22,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:42:22,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-10 17:42:22,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:42:22,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-10 17:42:22,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=366, Unknown=0, NotChecked=0, Total=420 [2022-01-10 17:42:22,068 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:22,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:42:22,872 INFO L93 Difference]: Finished difference Result 90 states and 112 transitions. [2022-01-10 17:42:22,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-10 17:42:22,872 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-01-10 17:42:22,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:42:22,873 INFO L225 Difference]: With dead ends: 90 [2022-01-10 17:42:22,873 INFO L226 Difference]: Without dead ends: 81 [2022-01-10 17:42:22,873 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=225, Invalid=1107, Unknown=0, NotChecked=0, Total=1332 [2022-01-10 17:42:22,874 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 177 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 17:42:22,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 131 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 17:42:22,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-01-10 17:42:22,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 57. [2022-01-10 17:42:22,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.25) internal successors, (70), 56 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:22,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2022-01-10 17:42:22,879 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 23 [2022-01-10 17:42:22,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:42:22,879 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2022-01-10 17:42:22,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.857142857142857) internal successors, (60), 21 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:22,879 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-01-10 17:42:22,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 17:42:22,880 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:42:22,880 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:42:22,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 17:42:23,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-01-10 17:42:23,086 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:42:23,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:42:23,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1352436018, now seen corresponding path program 2 times [2022-01-10 17:42:23,086 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:42:23,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980482513] [2022-01-10 17:42:23,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:23,087 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:42:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:23,122 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:42:23,122 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:42:23,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980482513] [2022-01-10 17:42:23,123 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980482513] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:42:23,123 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:42:23,123 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:42:23,123 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999430226] [2022-01-10 17:42:23,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:42:23,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:42:23,123 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:42:23,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:42:23,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:42:23,124 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:23,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:42:23,134 INFO L93 Difference]: Finished difference Result 102 states and 127 transitions. [2022-01-10 17:42:23,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:42:23,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-01-10 17:42:23,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:42:23,135 INFO L225 Difference]: With dead ends: 102 [2022-01-10 17:42:23,135 INFO L226 Difference]: Without dead ends: 62 [2022-01-10 17:42:23,135 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:42:23,136 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 17 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:42:23,136 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 62 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:42:23,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-10 17:42:23,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 51. [2022-01-10 17:42:23,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.18) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:23,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-01-10 17:42:23,140 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 24 [2022-01-10 17:42:23,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:42:23,140 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-01-10 17:42:23,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:23,141 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-01-10 17:42:23,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 17:42:23,141 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:42:23,141 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:42:23,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 17:42:23,141 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:42:23,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:42:23,142 INFO L85 PathProgramCache]: Analyzing trace with hash -464932337, now seen corresponding path program 1 times [2022-01-10 17:42:23,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:42:23,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580498289] [2022-01-10 17:42:23,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:23,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:42:23,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:42:23,449 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:42:23,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580498289] [2022-01-10 17:42:23,449 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580498289] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:42:23,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [791737369] [2022-01-10 17:42:23,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:23,449 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:42:23,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:42:23,450 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:42:23,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 17:42:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:23,666 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 47 conjunts are in the unsatisfiable core [2022-01-10 17:42:23,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:42:23,676 INFO L387 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 [2022-01-10 17:42:23,768 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 17:42:23,768 INFO L387 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 [2022-01-10 17:42:23,818 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 17:42:23,828 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 17:42:23,915 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 17:42:23,915 INFO L387 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 73 [2022-01-10 17:42:23,926 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2022-01-10 17:42:23,929 INFO L387 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 38 treesize of output 40 [2022-01-10 17:42:24,050 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:42:24,051 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 39 [2022-01-10 17:42:24,061 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:42:24,061 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 27 [2022-01-10 17:42:24,284 INFO L387 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 14 treesize of output 16 [2022-01-10 17:42:24,365 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:42:24,365 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2022-01-10 17:42:24,539 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:42:24,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:42:24,719 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_304 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_20| Int)) (or (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_20|)) (= 3 (let ((.cse0 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_20| 4) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| v_ArrVal_304) (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse0)) (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse0)))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_20| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)))) is different from false [2022-01-10 17:42:24,729 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:42:24,729 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 41 [2022-01-10 17:42:24,736 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:42:24,737 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2022-01-10 17:42:24,743 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 31 treesize of output 18 [2022-01-10 17:42:26,966 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:42:26,966 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 81 [2022-01-10 17:42:26,972 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:42:26,972 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 69 [2022-01-10 17:42:26,980 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:42:26,980 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 88 [2022-01-10 17:42:26,990 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:42:26,990 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 115 [2022-01-10 17:42:26,996 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 68 treesize of output 62 [2022-01-10 17:42:27,000 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 62 treesize of output 56 [2022-01-10 17:42:27,005 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 56 treesize of output 50 [2022-01-10 17:42:27,494 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:42:27,494 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [791737369] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:42:27,495 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:42:27,495 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 34 [2022-01-10 17:42:27,495 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416037415] [2022-01-10 17:42:27,495 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:42:27,495 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-01-10 17:42:27,495 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:42:27,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-01-10 17:42:27,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=955, Unknown=5, NotChecked=62, Total=1122 [2022-01-10 17:42:27,496 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:28,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:42:28,020 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-01-10 17:42:28,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 17:42:28,021 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-01-10 17:42:28,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:42:28,021 INFO L225 Difference]: With dead ends: 66 [2022-01-10 17:42:28,021 INFO L226 Difference]: Without dead ends: 45 [2022-01-10 17:42:28,022 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=211, Invalid=1765, Unknown=8, NotChecked=86, Total=2070 [2022-01-10 17:42:28,022 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 43 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 328 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 144 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:42:28,022 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 183 Invalid, 328 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 156 Invalid, 0 Unknown, 144 Unchecked, 0.1s Time] [2022-01-10 17:42:28,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-10 17:42:28,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2022-01-10 17:42:28,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:28,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-01-10 17:42:28,026 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 24 [2022-01-10 17:42:28,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:42:28,026 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-01-10 17:42:28,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.911764705882353) internal successors, (65), 34 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:28,026 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-01-10 17:42:28,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 17:42:28,027 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:42:28,027 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:42:28,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 17:42:28,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:42:28,233 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:42:28,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:42:28,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2125717568, now seen corresponding path program 1 times [2022-01-10 17:42:28,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:42:28,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108412912] [2022-01-10 17:42:28,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:28,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:42:28,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:28,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:42:28,534 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:42:28,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108412912] [2022-01-10 17:42:28,534 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108412912] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:42:28,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545707426] [2022-01-10 17:42:28,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:28,534 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:42:28,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:42:28,535 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:42:28,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 17:42:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:28,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 58 conjunts are in the unsatisfiable core [2022-01-10 17:42:28,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:42:28,659 INFO L387 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 [2022-01-10 17:42:28,696 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 17:42:28,721 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 17:42:28,721 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-10 17:42:28,775 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-01-10 17:42:28,820 INFO L387 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 14 treesize of output 16 [2022-01-10 17:42:28,858 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-10 17:42:28,858 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-01-10 17:42:28,907 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 17:42:28,927 INFO L387 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 14 treesize of output 16 [2022-01-10 17:42:29,001 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-01-10 17:42:29,001 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2022-01-10 17:42:29,061 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 17:42:29,075 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:42:29,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:42:29,377 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| Int)) (or (and (forall ((v_ArrVal_401 (Array Int Int)) (v_ArrVal_402 Int)) (<= (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_401) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 4) 18446744073709551616) v_ArrVal_402) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|) 1)) (forall ((v_ArrVal_401 (Array Int Int)) (v_ArrVal_402 Int)) (< 0 (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_401) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 4) 18446744073709551616) v_ArrVal_402) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|)))) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)))) is different from false [2022-01-10 17:42:34,776 INFO L353 Elim1Store]: treesize reduction 50, result has 45.1 percent of original size [2022-01-10 17:42:34,776 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 82 [2022-01-10 17:42:34,788 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:42:34,788 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 232 [2022-01-10 17:42:34,798 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:42:34,798 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 382 treesize of output 382 [2022-01-10 17:42:34,811 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:42:34,814 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 319 treesize of output 315 [2022-01-10 17:42:34,819 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:42:34,822 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 287 treesize of output 279 [2022-01-10 17:42:34,827 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:42:34,829 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 251 treesize of output 243 [2022-01-10 17:42:34,833 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:42:34,836 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 229 treesize of output 225 [2022-01-10 17:42:34,850 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2022-01-10 17:42:34,871 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2022-01-10 17:42:35,088 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:42:35,095 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:42:35,096 INFO L387 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 37 treesize of output 41 [2022-01-10 17:42:35,145 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2022-01-10 17:42:37,547 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 1 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-10 17:42:37,548 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545707426] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:42:37,548 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:42:37,548 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 16] total 36 [2022-01-10 17:42:37,548 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027263557] [2022-01-10 17:42:37,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:42:37,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-01-10 17:42:37,549 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:42:37,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-01-10 17:42:37,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1027, Unknown=14, NotChecked=66, Total=1260 [2022-01-10 17:42:37,549 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 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) [2022-01-10 17:42:39,800 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_12| Int)) (or (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|)) (and (forall ((v_ArrVal_401 (Array Int Int)) (v_ArrVal_400 (Array Int Int)) (v_ArrVal_402 Int)) (<= (select (store (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_400) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_12| v_ArrVal_401) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 4) 18446744073709551616) v_ArrVal_402) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|) 1)) (forall ((v_ArrVal_401 (Array Int Int)) (v_ArrVal_400 (Array Int Int)) (v_ArrVal_402 Int)) (< 0 (select (store (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_400) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_12| v_ArrVal_401) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 4) 18446744073709551616) v_ArrVal_402) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|)))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (= (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_12|) 0)))) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0) 1) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| Int)) (or (and (forall ((v_ArrVal_401 (Array Int Int)) (v_ArrVal_402 Int)) (<= (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_401) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 4) 18446744073709551616) v_ArrVal_402) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|) 1)) (forall ((v_ArrVal_401 (Array Int Int)) (v_ArrVal_402 Int)) (< 0 (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_401) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 4) 18446744073709551616) v_ArrVal_402) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|)))) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)) is different from false [2022-01-10 17:42:41,813 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0) 1) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| Int)) (or (and (forall ((v_ArrVal_401 (Array Int Int)) (v_ArrVal_402 Int)) (<= (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_401) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 4) 18446744073709551616) v_ArrVal_402) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|) 1)) (forall ((v_ArrVal_401 (Array Int Int)) (v_ArrVal_402 Int)) (< 0 (select (store (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_401) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| 4) 18446744073709551616) v_ArrVal_402) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|)))) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt_11| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0)) is different from false [2022-01-10 17:42:42,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:42:42,882 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2022-01-10 17:42:42,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 17:42:42,883 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 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 26 [2022-01-10 17:42:42,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:42:42,883 INFO L225 Difference]: With dead ends: 63 [2022-01-10 17:42:42,883 INFO L226 Difference]: Without dead ends: 58 [2022-01-10 17:42:42,884 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 31 SyntacticMatches, 5 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 607 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=330, Invalid=2014, Unknown=20, NotChecked=288, Total=2652 [2022-01-10 17:42:42,884 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 37 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 253 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:42:42,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 218 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 156 Invalid, 0 Unknown, 253 Unchecked, 0.1s Time] [2022-01-10 17:42:42,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-01-10 17:42:42,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-01-10 17:42:42,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.1636363636363636) internal successors, (64), 55 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:42:42,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2022-01-10 17:42:42,888 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 26 [2022-01-10 17:42:42,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:42:42,888 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2022-01-10 17:42:42,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9166666666666667) internal successors, (69), 36 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) [2022-01-10 17:42:42,888 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2022-01-10 17:42:42,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-10 17:42:42,889 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:42:42,889 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:42:42,906 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-10 17:42:43,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:42:43,103 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:42:43,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:42:43,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1224799706, now seen corresponding path program 1 times [2022-01-10 17:42:43,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:42:43,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956884324] [2022-01-10 17:42:43,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:43,104 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:42:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:43,680 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:42:43,680 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:42:43,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956884324] [2022-01-10 17:42:43,680 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956884324] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:42:43,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836151957] [2022-01-10 17:42:43,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:42:43,681 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:42:43,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:42:43,682 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:42:43,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 17:42:44,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:42:44,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 70 conjunts are in the unsatisfiable core [2022-01-10 17:42:44,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:42:44,082 INFO L387 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 [2022-01-10 17:42:44,114 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 17:42:44,128 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 17:42:44,129 INFO L387 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 [2022-01-10 17:42:44,167 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-01-10 17:42:44,174 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 17:42:44,214 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 17:42:44,215 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2022-01-10 17:42:44,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:42:44,220 INFO L387 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 14 treesize of output 16 [2022-01-10 17:42:44,274 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 17:42:44,274 INFO L387 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-01-10 17:42:44,277 INFO L387 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 18 treesize of output 20 [2022-01-10 17:42:44,323 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 17:42:44,323 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2022-01-10 17:42:44,333 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-10 17:42:44,333 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-01-10 17:42:44,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 6 treesize of output 4 [2022-01-10 17:42:44,522 INFO L387 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 20 treesize of output 12 [2022-01-10 17:42:44,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:42:44,581 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 17:42:44,581 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2022-01-10 17:42:44,664 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-01-10 17:42:44,664 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 30 [2022-01-10 17:42:44,730 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 17:42:44,732 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:42:44,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:42:45,259 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:42:45,259 INFO L387 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 125 [2022-01-10 17:42:45,275 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:42:45,275 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 918 treesize of output 913 [2022-01-10 17:42:45,283 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 445 treesize of output 433 [2022-01-10 17:42:45,288 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 878 treesize of output 854