/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_BITWISE.epf -i ../../../trunk/examples/svcomp/list-properties/list-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 11:51:03,467 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 11:51:03,468 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 11:51:03,522 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 11:51:03,523 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 11:51:03,523 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 11:51:03,524 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 11:51:03,525 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 11:51:03,526 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 11:51:03,527 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 11:51:03,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 11:51:03,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 11:51:03,528 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 11:51:03,529 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 11:51:03,529 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 11:51:03,530 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 11:51:03,530 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 11:51:03,531 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 11:51:03,532 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 11:51:03,533 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 11:51:03,534 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 11:51:03,534 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 11:51:03,535 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 11:51:03,535 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 11:51:03,553 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 11:51:03,553 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 11:51:03,553 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 11:51:03,554 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 11:51:03,554 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 11:51:03,555 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 11:51:03,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 11:51:03,555 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 11:51:03,556 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 11:51:03,556 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 11:51:03,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 11:51:03,557 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 11:51:03,557 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 11:51:03,557 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 11:51:03,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 11:51:03,558 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 11:51:03,558 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 11:51:03,560 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 11:51:03,582 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 11:51:03,583 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 11:51:03,583 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 11:51:03,583 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 11:51:03,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 11:51:03,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 11:51:03,584 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 11:51:03,584 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 11:51:03,584 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 11:51:03,587 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 11:51:03,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 11:51:03,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 11:51:03,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 11:51:03,588 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 11:51:03,588 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 11:51:03,588 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 11:51:03,588 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 11:51:03,588 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 11:51:03,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 11:51:03,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 11:51:03,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 11:51:03,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 11:51:03,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 11:51:03,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 11:51:03,589 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 11:51:03,589 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 11:51:03,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 11:51:03,589 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 11:51:03,589 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 11:51:03,589 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 11:51:03,589 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 11:51:03,590 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 11:51:03,590 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 11:51:03,590 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE 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 11:51:03,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 11:51:03,813 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 11:51:03,815 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 11:51:03,815 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 11:51:03,816 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 11:51:03,817 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list-1.i [2022-01-10 11:51:03,860 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0821be2be/aab4452ac7884e40b1cbc8c8bfbbe4fd/FLAG341840afa [2022-01-10 11:51:04,210 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 11:51:04,211 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list-1.i [2022-01-10 11:51:04,218 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0821be2be/aab4452ac7884e40b1cbc8c8bfbbe4fd/FLAG341840afa [2022-01-10 11:51:04,610 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0821be2be/aab4452ac7884e40b1cbc8c8bfbbe4fd [2022-01-10 11:51:04,615 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 11:51:04,616 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 11:51:04,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 11:51:04,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 11:51:04,620 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 11:51:04,621 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:51:04" (1/1) ... [2022-01-10 11:51:04,622 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ae985f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:51:04, skipping insertion in model container [2022-01-10 11:51:04,622 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:51:04" (1/1) ... [2022-01-10 11:51:04,626 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 11:51:04,647 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 11:51:04,833 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/list-1.i[23408,23421] [2022-01-10 11:51:04,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 11:51:04,850 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 11:51:04,902 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/list-1.i[23408,23421] [2022-01-10 11:51:04,903 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 11:51:04,921 INFO L208 MainTranslator]: Completed translation [2022-01-10 11:51:04,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:51:04 WrapperNode [2022-01-10 11:51:04,922 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 11:51:04,922 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 11:51:04,922 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 11:51:04,922 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 11:51:04,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:51:04" (1/1) ... [2022-01-10 11:51:04,944 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:51:04" (1/1) ... [2022-01-10 11:51:04,959 INFO L137 Inliner]: procedures = 127, calls = 24, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 89 [2022-01-10 11:51:04,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 11:51:04,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 11:51:04,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 11:51:04,960 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 11:51:04,965 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:51:04" (1/1) ... [2022-01-10 11:51:04,965 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:51:04" (1/1) ... [2022-01-10 11:51:04,977 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:51:04" (1/1) ... [2022-01-10 11:51:04,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:51:04" (1/1) ... [2022-01-10 11:51:04,989 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:51:04" (1/1) ... [2022-01-10 11:51:04,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:51:04" (1/1) ... [2022-01-10 11:51:05,000 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:51:04" (1/1) ... [2022-01-10 11:51:05,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 11:51:05,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 11:51:05,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 11:51:05,003 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 11:51:05,008 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:51:04" (1/1) ... [2022-01-10 11:51:05,013 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 11:51:05,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:51:05,045 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 11:51:05,077 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 11:51:05,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 11:51:05,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 11:51:05,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 11:51:05,102 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 11:51:05,103 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 11:51:05,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 11:51:05,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 11:51:05,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 11:51:05,103 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 11:51:05,192 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 11:51:05,193 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 11:51:05,384 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 11:51:05,388 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 11:51:05,388 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-10 11:51:05,389 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:51:05 BoogieIcfgContainer [2022-01-10 11:51:05,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 11:51:05,390 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 11:51:05,390 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 11:51:05,397 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 11:51:05,399 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:51:05" (1/1) ... [2022-01-10 11:51:05,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:51:05 BasicIcfg [2022-01-10 11:51:05,484 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 11:51:05,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 11:51:05,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 11:51:05,492 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 11:51:05,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:51:04" (1/4) ... [2022-01-10 11:51:05,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454ff4b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:51:05, skipping insertion in model container [2022-01-10 11:51:05,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:51:04" (2/4) ... [2022-01-10 11:51:05,493 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454ff4b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:51:05, skipping insertion in model container [2022-01-10 11:51:05,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:51:05" (3/4) ... [2022-01-10 11:51:05,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@454ff4b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:51:05, skipping insertion in model container [2022-01-10 11:51:05,494 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:51:05" (4/4) ... [2022-01-10 11:51:05,495 INFO L111 eAbstractionObserver]: Analyzing ICFG list-1.iTransformedIcfg [2022-01-10 11:51:05,498 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 11:51:05,499 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 11:51:05,544 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 11:51:05,550 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 11:51:05,550 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 11:51:05,560 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 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 11:51:05,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 11:51:05,564 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:05,564 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:51:05,565 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:05,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:05,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1064698670, now seen corresponding path program 1 times [2022-01-10 11:51:05,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:05,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367633597] [2022-01-10 11:51:05,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:05,575 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:05,715 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 11:51:05,716 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:05,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367633597] [2022-01-10 11:51:05,716 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367633597] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:51:05,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:51:05,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 11:51:05,718 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333542580] [2022-01-10 11:51:05,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:51:05,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 11:51:05,721 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:05,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 11:51:05,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 11:51:05,743 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 25 states have internal predecessors, (37), 0 states have call successors, (0), 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 11:51:05,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:05,757 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2022-01-10 11:51:05,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 11:51:05,759 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 11:51:05,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:05,764 INFO L225 Difference]: With dead ends: 43 [2022-01-10 11:51:05,764 INFO L226 Difference]: Without dead ends: 19 [2022-01-10 11:51:05,766 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 11:51:05,770 INFO L933 BasicCegarLoop]: 32 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, 32 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 11:51:05,772 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:51:05,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-01-10 11:51:05,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-01-10 11:51:05,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 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 11:51:05,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-01-10 11:51:05,795 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2022-01-10 11:51:05,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:05,796 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-01-10 11:51:05,796 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 11:51:05,797 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-01-10 11:51:05,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 11:51:05,798 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:05,798 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:51:05,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 11:51:05,799 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:05,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:05,801 INFO L85 PathProgramCache]: Analyzing trace with hash -2035242419, now seen corresponding path program 1 times [2022-01-10 11:51:05,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:05,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811896924] [2022-01-10 11:51:05,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:05,802 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:05,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:05,981 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 11:51:05,982 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:05,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811896924] [2022-01-10 11:51:05,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811896924] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:51:05,982 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:51:05,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 11:51:05,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223894644] [2022-01-10 11:51:05,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:51:05,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 11:51:05,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:05,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 11:51:05,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-10 11:51:05,984 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 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 11:51:06,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:06,096 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-01-10 11:51:06,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 11:51:06,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-01-10 11:51:06,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:06,098 INFO L225 Difference]: With dead ends: 48 [2022-01-10 11:51:06,098 INFO L226 Difference]: Without dead ends: 38 [2022-01-10 11:51:06,099 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-01-10 11:51:06,100 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 48 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:51:06,100 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 40 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 11:51:06,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-10 11:51:06,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 26. [2022-01-10 11:51:06,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 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 11:51:06,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-01-10 11:51:06,104 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 14 [2022-01-10 11:51:06,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:06,104 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-01-10 11:51:06,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 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 11:51:06,105 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-01-10 11:51:06,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 11:51:06,105 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:06,105 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:51:06,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 11:51:06,106 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:06,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:06,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1632046840, now seen corresponding path program 1 times [2022-01-10 11:51:06,106 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:06,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216323573] [2022-01-10 11:51:06,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:06,106 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:06,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:06,228 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:06,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216323573] [2022-01-10 11:51:06,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216323573] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:51:06,230 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:51:06,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 11:51:06,231 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928785826] [2022-01-10 11:51:06,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:51:06,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 11:51:06,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:06,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 11:51:06,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-01-10 11:51:06,232 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 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 11:51:06,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:06,320 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-01-10 11:51:06,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 11:51:06,320 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have 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 11:51:06,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:06,323 INFO L225 Difference]: With dead ends: 44 [2022-01-10 11:51:06,323 INFO L226 Difference]: Without dead ends: 33 [2022-01-10 11:51:06,327 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-01-10 11:51:06,329 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 51 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:51:06,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 28 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:51:06,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-10 11:51:06,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 21. [2022-01-10 11:51:06,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 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 11:51:06,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-01-10 11:51:06,337 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 16 [2022-01-10 11:51:06,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:06,338 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-01-10 11:51:06,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 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 11:51:06,338 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-01-10 11:51:06,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 11:51:06,339 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:06,339 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:51:06,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 11:51:06,339 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:06,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:06,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1190548993, now seen corresponding path program 1 times [2022-01-10 11:51:06,340 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:06,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143151025] [2022-01-10 11:51:06,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:06,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:06,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:06,632 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:06,632 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:06,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143151025] [2022-01-10 11:51:06,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143151025] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:51:06,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [991987652] [2022-01-10 11:51:06,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:06,633 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:06,633 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:51:06,634 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 11:51:06,649 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 11:51:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:06,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-10 11:51:06,774 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:51:06,844 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 11:51:06,940 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 11:51:06,940 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 11:51:06,953 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 11:51:07,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:07,019 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 11:51:07,106 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 11:51:07,154 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 11:51:07,170 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:07,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:51:07,302 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-10 11:51:07,303 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 25 treesize of output 31 [2022-01-10 11:51:07,312 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:07,312 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 30 treesize of output 33 [2022-01-10 11:51:07,317 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 11:51:07,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:07,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [991987652] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:51:07,434 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:51:07,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2022-01-10 11:51:07,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685148642] [2022-01-10 11:51:07,434 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:51:07,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-10 11:51:07,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:07,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-10 11:51:07,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=387, Unknown=2, NotChecked=0, Total=462 [2022-01-10 11:51:07,436 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 0 states have call successors, (0), 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 11:51:07,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:07,702 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-01-10 11:51:07,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 11:51:07,710 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-01-10 11:51:07,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:07,711 INFO L225 Difference]: With dead ends: 49 [2022-01-10 11:51:07,711 INFO L226 Difference]: Without dead ends: 41 [2022-01-10 11:51:07,711 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=160, Invalid=650, Unknown=2, NotChecked=0, Total=812 [2022-01-10 11:51:07,712 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 99 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:51:07,712 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 80 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 133 Invalid, 0 Unknown, 66 Unchecked, 0.1s Time] [2022-01-10 11:51:07,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-10 11:51:07,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2022-01-10 11:51:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 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 11:51:07,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-01-10 11:51:07,715 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 17 [2022-01-10 11:51:07,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:07,715 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-01-10 11:51:07,716 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 0 states have call successors, (0), 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 11:51:07,716 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-01-10 11:51:07,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 11:51:07,716 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:07,716 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:51:07,750 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 11:51:07,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:07,917 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:07,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:07,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1871986705, now seen corresponding path program 1 times [2022-01-10 11:51:07,918 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:07,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304659254] [2022-01-10 11:51:07,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:07,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:07,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:08,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:08,051 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:08,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304659254] [2022-01-10 11:51:08,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304659254] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:51:08,051 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647786755] [2022-01-10 11:51:08,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:08,051 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:08,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:51:08,052 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 11:51:08,054 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 11:51:08,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:08,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-10 11:51:08,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:51:08,143 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 11:51:08,191 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 11:51:08,191 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 11:51:08,196 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 11:51:08,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:08,243 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 11:51:08,289 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 11:51:08,311 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 11:51:08,319 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:08,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:51:08,417 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-10 11:51:08,417 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 25 treesize of output 31 [2022-01-10 11:51:08,423 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:08,424 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 30 treesize of output 33 [2022-01-10 11:51:08,427 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 11:51:08,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:08,506 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647786755] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:51:08,506 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:51:08,506 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-01-10 11:51:08,506 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186396440] [2022-01-10 11:51:08,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:51:08,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 11:51:08,506 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:08,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 11:51:08,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=249, Unknown=1, NotChecked=0, Total=306 [2022-01-10 11:51:08,507 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 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 11:51:08,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:08,680 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2022-01-10 11:51:08,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 11:51:08,681 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-01-10 11:51:08,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:08,681 INFO L225 Difference]: With dead ends: 50 [2022-01-10 11:51:08,682 INFO L226 Difference]: Without dead ends: 44 [2022-01-10 11:51:08,682 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=461, Unknown=1, NotChecked=0, Total=600 [2022-01-10 11:51:08,682 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 97 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:51:08,683 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 91 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 86 Invalid, 0 Unknown, 59 Unchecked, 0.1s Time] [2022-01-10 11:51:08,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-10 11:51:08,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2022-01-10 11:51:08,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2285714285714286) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-01-10 11:51:08,686 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 17 [2022-01-10 11:51:08,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:08,686 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-01-10 11:51:08,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 18 states have internal predecessors, (37), 0 states have call successors, (0), 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 11:51:08,686 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-01-10 11:51:08,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 11:51:08,687 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:08,687 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:51:08,707 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 11:51:08,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:08,888 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:08,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:08,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1630483398, now seen corresponding path program 1 times [2022-01-10 11:51:08,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:08,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591271189] [2022-01-10 11:51:08,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:08,889 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:09,064 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 11:51:09,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:09,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591271189] [2022-01-10 11:51:09,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591271189] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:51:09,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186447998] [2022-01-10 11:51:09,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:09,065 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:09,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:51:09,066 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 11:51:09,067 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 11:51:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:09,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 38 conjunts are in the unsatisfiable core [2022-01-10 11:51:09,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:51:09,169 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 11:51:09,218 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 11:51:09,219 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 11:51:09,279 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 11:51:09,284 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 11:51:09,329 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 11:51:09,329 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 11:51:09,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 0 case distinctions, treesize of input 50 treesize of output 52 [2022-01-10 11:51:09,336 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 11:51:09,390 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 47 treesize of output 23 [2022-01-10 11:51:09,393 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-01-10 11:51:09,408 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 17 treesize of output 9 [2022-01-10 11:51:09,432 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 11:51:09,432 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:51:09,474 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 121 treesize of output 85 [2022-01-10 11:51:09,480 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_180 (Array Int Int))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_180) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4 (* (- 18446744073709551616) (div (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616)))))) (forall ((v_ArrVal_181 (Array Int Int))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_181) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4 (* (- 18446744073709551616) (div (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))))))) is different from false [2022-01-10 11:51:09,493 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:09,493 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 31 treesize of output 32 [2022-01-10 11:51:09,499 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:09,499 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 56 treesize of output 51 [2022-01-10 11:51:09,502 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 18 treesize of output 7 [2022-01-10 11:51:09,527 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-10 11:51:09,527 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 1 [2022-01-10 11:51:09,628 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 11:51:09,628 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186447998] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:51:09,629 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:51:09,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2022-01-10 11:51:09,629 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294236960] [2022-01-10 11:51:09,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:51:09,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 11:51:09,629 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:09,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 11:51:09,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=231, Unknown=1, NotChecked=30, Total=306 [2022-01-10 11:51:09,630 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:09,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:09,900 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2022-01-10 11:51:09,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 11:51:09,900 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-01-10 11:51:09,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:09,901 INFO L225 Difference]: With dead ends: 56 [2022-01-10 11:51:09,901 INFO L226 Difference]: Without dead ends: 52 [2022-01-10 11:51:09,901 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=442, Unknown=1, NotChecked=44, Total=600 [2022-01-10 11:51:09,902 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 104 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:51:09,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 94 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 191 Invalid, 0 Unknown, 65 Unchecked, 0.1s Time] [2022-01-10 11:51:09,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-01-10 11:51:09,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2022-01-10 11:51:09,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 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 11:51:09,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2022-01-10 11:51:09,906 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 19 [2022-01-10 11:51:09,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:09,906 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2022-01-10 11:51:09,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 18 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:09,906 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2022-01-10 11:51:09,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 11:51:09,906 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:09,906 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:51:09,937 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 11:51:10,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:10,107 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:10,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:10,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1142082291, now seen corresponding path program 2 times [2022-01-10 11:51:10,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:10,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556225968] [2022-01-10 11:51:10,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:10,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:10,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:10,378 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 11:51:10,378 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:10,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556225968] [2022-01-10 11:51:10,378 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556225968] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:51:10,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1314878593] [2022-01-10 11:51:10,379 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 11:51:10,379 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:10,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:51:10,380 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 11:51:10,381 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 11:51:10,466 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 11:51:10,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 11:51:10,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 44 conjunts are in the unsatisfiable core [2022-01-10 11:51:10,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:51:10,477 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 11:51:10,549 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 11:51:10,549 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 11:51:10,558 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 11:51:10,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:10,615 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 11:51:10,652 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 11:51:10,666 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-10 11:51:10,666 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 11:51:10,718 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 11:51:10,753 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 11:51:10,789 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 11:51:10,802 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:10,803 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:51:10,829 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_266 (Array Int Int))) (= 2 (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_266) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) is different from false [2022-01-10 11:51:10,837 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int))) (= (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_265) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_266) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 2)) is different from false [2022-01-10 11:51:10,850 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_265 (Array Int Int)) (v_ArrVal_266 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_10| Int)) (or (= 2 (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_265) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_10| v_ArrVal_266) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)) (not (= (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_10|) 0)))) is different from false [2022-01-10 11:51:10,905 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-10 11:51:10,905 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 28 treesize of output 34 [2022-01-10 11:51:10,913 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:10,914 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 122 treesize of output 121 [2022-01-10 11:51:10,919 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 106 treesize of output 102 [2022-01-10 11:51:10,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 102 treesize of output 94 [2022-01-10 11:51:11,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-01-10 11:51:11,180 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1314878593] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:51:11,180 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:51:11,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 27 [2022-01-10 11:51:11,181 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912323670] [2022-01-10 11:51:11,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:51:11,181 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-01-10 11:51:11,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:11,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-01-10 11:51:11,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=461, Unknown=5, NotChecked=138, Total=702 [2022-01-10 11:51:11,182 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:11,619 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 1) (let ((.cse0 (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|))) (or (and (not .cse0) (= 2 (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0))) (and .cse0 (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0)))) (forall ((v_ArrVal_266 (Array Int Int))) (= 2 (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_266) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)))) is different from false [2022-01-10 11:51:11,628 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (let ((.cse0 (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|))) (or (and (not .cse0) (= 2 (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0))) (and .cse0 (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0)))) (forall ((v_ArrVal_266 (Array Int Int))) (= 2 (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_266) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)))) is different from false [2022-01-10 11:51:11,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:11,842 INFO L93 Difference]: Finished difference Result 96 states and 115 transitions. [2022-01-10 11:51:11,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-01-10 11:51:11,843 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-01-10 11:51:11,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:11,843 INFO L225 Difference]: With dead ends: 96 [2022-01-10 11:51:11,843 INFO L226 Difference]: Without dead ends: 86 [2022-01-10 11:51:11,844 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=358, Invalid=1539, Unknown=15, NotChecked=440, Total=2352 [2022-01-10 11:51:11,845 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 112 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 11:51:11,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 126 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 280 Invalid, 0 Unknown, 193 Unchecked, 0.2s Time] [2022-01-10 11:51:11,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-01-10 11:51:11,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 46. [2022-01-10 11:51:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.2222222222222223) internal successors, (55), 45 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 11:51:11,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2022-01-10 11:51:11,849 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 20 [2022-01-10 11:51:11,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:11,849 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2022-01-10 11:51:11,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.962962962962963) internal successors, (53), 27 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:11,849 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2022-01-10 11:51:11,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 11:51:11,850 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:11,850 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:51:11,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-10 11:51:12,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:12,051 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:12,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:12,051 INFO L85 PathProgramCache]: Analyzing trace with hash 457447709, now seen corresponding path program 1 times [2022-01-10 11:51:12,051 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:12,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012602742] [2022-01-10 11:51:12,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:12,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:12,233 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:12,233 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:12,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012602742] [2022-01-10 11:51:12,233 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012602742] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:51:12,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044863242] [2022-01-10 11:51:12,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:12,233 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:12,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:51:12,234 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 11:51:12,236 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 11:51:12,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:12,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 45 conjunts are in the unsatisfiable core [2022-01-10 11:51:12,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:51:12,330 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 11:51:12,423 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 11:51:12,424 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 11:51:12,432 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 11:51:12,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:12,484 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 11:51:12,528 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 11:51:12,538 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-10 11:51:12,538 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 11:51:12,583 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 11:51:12,614 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 11:51:12,635 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 11:51:12,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:12,652 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:51:12,674 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_351) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)) is different from false [2022-01-10 11:51:12,680 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int)) (v_ArrVal_350 (Array Int Int))) (= (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_350) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_351) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)) is different from false [2022-01-10 11:51:12,694 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_351 (Array Int Int)) (v_ArrVal_350 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| Int)) (or (= (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_350) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| v_ArrVal_351) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1) (not (= (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14|) 0)))) is different from false [2022-01-10 11:51:12,758 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-10 11:51:12,758 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 28 treesize of output 34 [2022-01-10 11:51:12,764 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:12,764 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 60 treesize of output 63 [2022-01-10 11:51:12,768 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 48 treesize of output 44 [2022-01-10 11:51:12,771 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 22 treesize of output 20 [2022-01-10 11:51:12,978 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-01-10 11:51:12,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044863242] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:51:12,979 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:51:12,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 10] total 28 [2022-01-10 11:51:12,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766705333] [2022-01-10 11:51:12,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:51:12,979 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-10 11:51:12,979 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:12,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-10 11:51:12,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=508, Unknown=5, NotChecked=144, Total=756 [2022-01-10 11:51:12,980 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 28 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 28 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:13,389 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|))) (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 |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 1) (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (= (select .cse0 0) 1) (= (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1) (= (select |c_#validInt| 1) 1) (forall ((v_ArrVal_351 (Array Int Int)) (v_ArrVal_350 (Array Int Int))) (= (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_350) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_351) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)))) is different from false [2022-01-10 11:51:13,407 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) (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0) 1) (forall ((v_ArrVal_351 (Array Int Int)) (v_ArrVal_350 (Array Int Int))) (= (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_350) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_351) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1))) is different from false [2022-01-10 11:51:13,441 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (let ((.cse0 (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|))) (or (and .cse0 (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0)) (and (not .cse0) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0) 1)))) (forall ((v_ArrVal_351 (Array Int Int))) (= (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_351) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1))) is different from false [2022-01-10 11:51:13,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:13,682 INFO L93 Difference]: Finished difference Result 104 states and 125 transitions. [2022-01-10 11:51:13,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-01-10 11:51:13,683 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 28 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-01-10 11:51:13,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:13,683 INFO L225 Difference]: With dead ends: 104 [2022-01-10 11:51:13,683 INFO L226 Difference]: Without dead ends: 96 [2022-01-10 11:51:13,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=366, Invalid=1453, Unknown=11, NotChecked=522, Total=2352 [2022-01-10 11:51:13,685 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 118 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 11:51:13,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 193 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 276 Invalid, 0 Unknown, 218 Unchecked, 0.2s Time] [2022-01-10 11:51:13,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-01-10 11:51:13,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 63. [2022-01-10 11:51:13,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.2419354838709677) internal successors, (77), 62 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:13,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2022-01-10 11:51:13,690 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 20 [2022-01-10 11:51:13,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:13,690 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2022-01-10 11:51:13,690 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.8571428571428572) internal successors, (52), 28 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:13,690 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-01-10 11:51:13,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 11:51:13,690 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:13,691 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:51:13,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 11:51:13,908 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:13,908 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:13,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:13,909 INFO L85 PathProgramCache]: Analyzing trace with hash 794315701, now seen corresponding path program 2 times [2022-01-10 11:51:13,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:13,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327244291] [2022-01-10 11:51:13,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:13,909 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:13,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:14,104 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:14,104 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:14,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327244291] [2022-01-10 11:51:14,104 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327244291] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:51:14,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703481846] [2022-01-10 11:51:14,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 11:51:14,104 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:14,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:51:14,132 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 11:51:14,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 11:51:14,228 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 11:51:14,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 11:51:14,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-10 11:51:14,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:51:14,237 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 11:51:14,302 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 11:51:14,302 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 11:51:14,349 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 11:51:14,356 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 11:51:14,409 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 11:51:14,410 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 11:51:14,413 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 11:51:14,415 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 11:51:14,474 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 47 treesize of output 23 [2022-01-10 11:51:14,477 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-01-10 11:51:14,493 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 11:51:14,511 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:14,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:51:14,566 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 60 treesize of output 34 [2022-01-10 11:51:14,572 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_401 (Array Int Int))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_401) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616)))) (forall ((v_ArrVal_403 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_403) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616)) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|))) is different from false [2022-01-10 11:51:14,583 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:14,584 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 26 treesize of output 27 [2022-01-10 11:51:14,590 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:14,590 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 46 treesize of output 41 [2022-01-10 11:51:14,593 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 13 treesize of output 7 [2022-01-10 11:51:14,622 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-10 11:51:14,622 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2022-01-10 11:51:14,718 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-10 11:51:14,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703481846] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:51:14,718 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:51:14,718 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-01-10 11:51:14,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75149102] [2022-01-10 11:51:14,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:51:14,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-10 11:51:14,719 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:14,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-10 11:51:14,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=441, Unknown=1, NotChecked=42, Total=552 [2022-01-10 11:51:14,720 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:15,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:15,121 INFO L93 Difference]: Finished difference Result 83 states and 99 transitions. [2022-01-10 11:51:15,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 11:51:15,121 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-01-10 11:51:15,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:15,121 INFO L225 Difference]: With dead ends: 83 [2022-01-10 11:51:15,121 INFO L226 Difference]: Without dead ends: 70 [2022-01-10 11:51:15,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=867, Unknown=1, NotChecked=62, Total=1122 [2022-01-10 11:51:15,122 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 115 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 11:51:15,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [115 Valid, 150 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 249 Invalid, 0 Unknown, 64 Unchecked, 0.2s Time] [2022-01-10 11:51:15,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-01-10 11:51:15,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 58. [2022-01-10 11:51:15,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 57 states have internal predecessors, (71), 0 states have call successors, (0), 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 11:51:15,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2022-01-10 11:51:15,126 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 21 [2022-01-10 11:51:15,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:15,126 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2022-01-10 11:51:15,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:15,127 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2022-01-10 11:51:15,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 11:51:15,127 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:15,127 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:51:15,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-10 11:51:15,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:15,344 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:15,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:15,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1275447459, now seen corresponding path program 1 times [2022-01-10 11:51:15,345 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:15,345 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917383102] [2022-01-10 11:51:15,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:15,345 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:15,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:15,480 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:15,480 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:15,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917383102] [2022-01-10 11:51:15,481 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917383102] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:51:15,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911554514] [2022-01-10 11:51:15,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:15,481 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:15,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:51:15,482 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 11:51:15,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-10 11:51:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:15,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-10 11:51:15,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:51:15,596 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 11:51:15,646 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 11:51:15,647 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 11:51:15,686 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 11:51:15,725 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 11:51:15,796 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 11:51:15,797 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 11:51:15,800 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 50 treesize of output 52 [2022-01-10 11:51:15,803 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 11:51:15,860 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 47 treesize of output 23 [2022-01-10 11:51:15,863 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-01-10 11:51:15,883 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 11:51:15,905 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:15,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:51:15,971 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 60 treesize of output 34 [2022-01-10 11:51:15,977 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_456 (Array Int Int))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_456) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616)))) (forall ((v_ArrVal_457 (Array Int Int))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_457) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))))) is different from false [2022-01-10 11:51:15,998 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:15,998 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 26 treesize of output 27 [2022-01-10 11:51:16,004 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:16,004 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 46 treesize of output 41 [2022-01-10 11:51:16,007 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 13 treesize of output 7 [2022-01-10 11:51:16,033 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-10 11:51:16,033 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 1 [2022-01-10 11:51:16,121 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-10 11:51:16,122 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911554514] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:51:16,122 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:51:16,122 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 23 [2022-01-10 11:51:16,122 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40560818] [2022-01-10 11:51:16,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:51:16,122 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-10 11:51:16,122 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:16,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-10 11:51:16,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=403, Unknown=1, NotChecked=40, Total=506 [2022-01-10 11:51:16,123 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:16,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:16,500 INFO L93 Difference]: Finished difference Result 78 states and 93 transitions. [2022-01-10 11:51:16,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 11:51:16,501 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-01-10 11:51:16,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:16,501 INFO L225 Difference]: With dead ends: 78 [2022-01-10 11:51:16,501 INFO L226 Difference]: Without dead ends: 65 [2022-01-10 11:51:16,502 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=722, Unknown=1, NotChecked=56, Total=930 [2022-01-10 11:51:16,502 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 51 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:51:16,502 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 142 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 220 Invalid, 0 Unknown, 58 Unchecked, 0.1s Time] [2022-01-10 11:51:16,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-10 11:51:16,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2022-01-10 11:51:16,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 54 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:16,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2022-01-10 11:51:16,506 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 21 [2022-01-10 11:51:16,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:16,506 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2022-01-10 11:51:16,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 23 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:16,506 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2022-01-10 11:51:16,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 11:51:16,506 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:16,506 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:51:16,525 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-10 11:51:16,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:16,719 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:16,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:16,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1996344264, now seen corresponding path program 3 times [2022-01-10 11:51:16,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:16,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318481787] [2022-01-10 11:51:16,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:16,720 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:17,111 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:17,111 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:17,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318481787] [2022-01-10 11:51:17,112 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318481787] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:51:17,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369458367] [2022-01-10 11:51:17,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-10 11:51:17,112 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:17,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:51:17,113 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 11:51:17,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-10 11:51:17,250 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-10 11:51:17,250 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 11:51:17,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 66 conjunts are in the unsatisfiable core [2022-01-10 11:51:17,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:51:17,260 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 11:51:17,332 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 11:51:17,332 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 11:51:17,393 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 11:51:17,401 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 11:51:17,445 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 11:51:17,445 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 30 treesize of output 30 [2022-01-10 11:51:17,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:17,455 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 40 treesize of output 38 [2022-01-10 11:51:17,463 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 11:51:17,568 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 11:51:17,569 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 155 treesize of output 146 [2022-01-10 11:51:17,574 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:17,575 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 63 treesize of output 54 [2022-01-10 11:51:17,579 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 74 [2022-01-10 11:51:17,684 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 11:51:17,684 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 131 treesize of output 129 [2022-01-10 11:51:17,704 INFO L353 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-01-10 11:51:17,704 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 133 treesize of output 126 [2022-01-10 11:51:17,710 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:17,719 INFO L353 Elim1Store]: treesize reduction 31, result has 48.3 percent of original size [2022-01-10 11:51:17,720 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 43 treesize of output 52 [2022-01-10 11:51:17,808 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 50 treesize of output 14 [2022-01-10 11:51:17,907 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 111 treesize of output 75 [2022-01-10 11:51:18,224 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 366 treesize of output 282 [2022-01-10 11:51:19,242 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 358 treesize of output 302 [2022-01-10 11:51:19,280 INFO L353 Elim1Store]: treesize reduction 60, result has 32.6 percent of original size [2022-01-10 11:51:19,280 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 313 treesize of output 156 [2022-01-10 11:51:19,828 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:19,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:19,836 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-01-10 11:51:19,837 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 17 [2022-01-10 11:51:19,854 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:19,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:51:22,068 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (or (not (= (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 2)) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_544 (Array Int Int))) (let ((.cse0 (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) (select (select (store |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_544) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse1)) (select (select (store |c_#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_546) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse1))))) (or (= .cse0 2) (and (<= 3 .cse0) (<= .cse0 3))))))) is different from false [2022-01-10 11:51:22,213 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_62| Int) (v_ArrVal_546 (Array Int Int)) (v_ArrVal_539 Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_544 (Array Int Int))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse1 (let ((.cse4 (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|) .cse3 v_ArrVal_539)))) (store .cse4 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_62| (store (select .cse4 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_62|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))))) (let ((.cse0 (let ((.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (select (select .cse1 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_542) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_62| v_ArrVal_544) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse2)) (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|)) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_62| v_ArrVal_546) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse2))))) (or (and (<= 3 .cse0) (<= .cse0 3)) (not (= 2 (select (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (= 2 .cse0)))))) is different from false [2022-01-10 11:51:22,367 INFO L353 Elim1Store]: treesize reduction 4, result has 91.3 percent of original size [2022-01-10 11:51:22,367 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 3513 treesize of output 3313 [2022-01-10 11:51:22,391 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:22,392 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 2194 treesize of output 1868 [2022-01-10 11:51:26,873 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 34 treesize of output 16 [2022-01-10 11:51:27,481 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 34 treesize of output 16 [2022-01-10 11:51:28,717 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 34 treesize of output 16 [2022-01-10 11:51:28,759 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 34 treesize of output 16 [2022-01-10 11:51:31,544 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_62| Int) (v_arrayElimArr_11 (Array Int Int)) (v_ArrVal_546 (Array Int Int)) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_544 (Array Int Int))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_arrayElimArr_11) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_62| v_ArrVal_546) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse5)) (.cse2 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_542) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_62| v_ArrVal_544) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse5)) (.cse0 (select v_arrayElimArr_11 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616)))) (or (not (<= .cse0 0)) (not (<= 0 .cse0)) (and (= .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| .cse2)) (let ((.cse3 (let ((.cse4 (and (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_62|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| .cse0)))) (and (or .cse4 (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| .cse1)) (or (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| .cse2) .cse4))))) (and (or (= .cse1 .cse0) .cse3) (or .cse3 (= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_62| .cse2)))))))) is different from false [2022-01-10 11:51:31,587 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:31,588 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 301 treesize of output 265 [2022-01-10 11:51:31,594 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:31,594 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 253 treesize of output 217 [2022-01-10 11:51:31,606 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:31,606 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 418 treesize of output 397 [2022-01-10 11:51:31,614 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 374 treesize of output 350 [2022-01-10 11:51:31,620 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 350 treesize of output 302 [2022-01-10 11:51:31,642 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:31,643 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 869 treesize of output 816 [2022-01-10 11:51:31,661 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:31,662 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 813 treesize of output 697 [2022-01-10 11:51:31,671 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 673 treesize of output 577 [2022-01-10 11:51:33,024 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-01-10 11:51:33,024 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369458367] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:51:33,024 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:51:33,024 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 38 [2022-01-10 11:51:33,024 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652860400] [2022-01-10 11:51:33,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:51:33,025 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-01-10 11:51:33,025 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:33,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-01-10 11:51:33,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1063, Unknown=3, NotChecked=204, Total=1406 [2022-01-10 11:51:33,025 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 38 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 38 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 11:51:33,351 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse7 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse1 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse7)) (.cse0 (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse7))) (and (= (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|) 2) (<= 0 .cse0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 1) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (<= .cse0 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| .cse1) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_62| Int) (v_ArrVal_546 (Array Int Int)) (v_ArrVal_539 Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_544 (Array Int Int))) (let ((.cse5 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse3 (let ((.cse6 (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|) .cse5 v_ArrVal_539)))) (store .cse6 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_62| (store (select .cse6 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_62|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))))) (let ((.cse2 (let ((.cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (select (select .cse3 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_542) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_62| v_ArrVal_544) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse4)) (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse5 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|)) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_62| v_ArrVal_546) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse4))))) (or (and (<= 3 .cse2) (<= .cse2 3)) (not (= 2 (select (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (= 2 .cse2)))))) (= (select |c_#validInt| 1) 1) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| .cse1)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| .cse0)))) is different from false [2022-01-10 11:51:35,370 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse3 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse5)) (.cse4 (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse5))) (let ((.cse0 (select (select |c_#memory_$Pointer$.offsetInt| .cse3) (mod (+ .cse4 4) 18446744073709551616)))) (and (<= 0 .cse0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| .cse0) (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (or (not (= (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 2)) (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_544 (Array Int Int))) (let ((.cse1 (let ((.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) (select (select (store |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_544) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse2)) (select (select (store |c_#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_546) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse2))))) (or (= .cse1 2) (and (<= 3 .cse1) (<= .cse1 3))))))) (= 2 (select (select |c_#memory_intInt| .cse3) .cse4)) (<= 0 .cse4) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (<= .cse4 0) (<= .cse0 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| .cse3)))))) is different from false [2022-01-10 11:51:35,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:35,670 INFO L93 Difference]: Finished difference Result 88 states and 106 transitions. [2022-01-10 11:51:35,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-01-10 11:51:35,671 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 38 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 22 [2022-01-10 11:51:35,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:35,671 INFO L225 Difference]: With dead ends: 88 [2022-01-10 11:51:35,671 INFO L226 Difference]: Without dead ends: 84 [2022-01-10 11:51:35,672 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 559 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=253, Invalid=1742, Unknown=5, NotChecked=450, Total=2450 [2022-01-10 11:51:35,672 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 56 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 163 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 11:51:35,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 118 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 191 Invalid, 0 Unknown, 163 Unchecked, 0.2s Time] [2022-01-10 11:51:35,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-01-10 11:51:35,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 63. [2022-01-10 11:51:35,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 62 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:35,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-01-10 11:51:35,677 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 22 [2022-01-10 11:51:35,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:35,677 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-01-10 11:51:35,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.5789473684210527) internal successors, (60), 38 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 11:51:35,677 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-01-10 11:51:35,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 11:51:35,678 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:35,678 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, 1] [2022-01-10 11:51:35,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-10 11:51:35,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-01-10 11:51:35,879 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:35,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:35,879 INFO L85 PathProgramCache]: Analyzing trace with hash -375338697, now seen corresponding path program 1 times [2022-01-10 11:51:35,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:35,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956985715] [2022-01-10 11:51:35,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:35,879 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:36,174 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:36,175 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:36,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956985715] [2022-01-10 11:51:36,175 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956985715] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:51:36,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541593431] [2022-01-10 11:51:36,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:36,175 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:36,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:51:36,180 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 11:51:36,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-10 11:51:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:36,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 55 conjunts are in the unsatisfiable core [2022-01-10 11:51:36,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:51:36,341 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 11:51:36,395 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 11:51:36,395 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 11:51:36,442 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 11:51:36,448 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 11:51:36,513 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 11:51:36,514 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 43 treesize of output 41 [2022-01-10 11:51:36,525 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-01-10 11:51:36,525 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 24 treesize of output 26 [2022-01-10 11:51:36,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:36,537 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 18 treesize of output 20 [2022-01-10 11:51:36,543 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 11:51:36,613 INFO L353 Elim1Store]: treesize reduction 61, result has 15.3 percent of original size [2022-01-10 11:51:36,614 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 105 [2022-01-10 11:51:36,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:36,620 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 63 treesize of output 54 [2022-01-10 11:51:36,624 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 129 treesize of output 125 [2022-01-10 11:51:36,725 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-01-10 11:51:36,725 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 190 treesize of output 155 [2022-01-10 11:51:36,740 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 11:51:36,740 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 148 treesize of output 145 [2022-01-10 11:51:36,746 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 54 treesize of output 56 [2022-01-10 11:51:36,814 INFO L353 Elim1Store]: treesize reduction 27, result has 3.6 percent of original size [2022-01-10 11:51:36,814 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 34 [2022-01-10 11:51:36,817 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-01-10 11:51:36,826 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 11:51:36,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:36,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:51:36,905 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_636 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_637 (Array Int Int))) (= (let ((.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_636) (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_635) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse0)) (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_637) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse0))) 2)) is different from false [2022-01-10 11:51:36,916 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_636 (Array Int Int)) (v_ArrVal_635 (Array Int Int)) (v_ArrVal_637 (Array Int Int)) (v_ArrVal_630 (Array Int Int)) (v_ArrVal_634 Int)) (= 2 (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (select (let ((.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616))) (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|) .cse0 v_ArrVal_634)) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_636) (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_635) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse1))) (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_630) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_637) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse1))))) is different from false [2022-01-10 11:51:36,931 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:36,932 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 64 [2022-01-10 11:51:36,935 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:36,939 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:36,939 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 77 [2022-01-10 11:51:36,948 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:36,948 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 142 treesize of output 145 [2022-01-10 11:51:36,953 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 55 treesize of output 33 [2022-01-10 11:51:37,014 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 36 treesize of output 24 [2022-01-10 11:51:37,075 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 36 treesize of output 24 [2022-01-10 11:51:37,101 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:37,101 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 113 treesize of output 102 [2022-01-10 11:51:37,106 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:37,107 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 102 treesize of output 102 [2022-01-10 11:51:37,115 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:37,116 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 171 treesize of output 174 [2022-01-10 11:51:37,126 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:37,126 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 540 treesize of output 519 [2022-01-10 11:51:37,135 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:37,135 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 531 treesize of output 373 [2022-01-10 11:51:37,142 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 304 treesize of output 292 [2022-01-10 11:51:37,148 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 292 treesize of output 286 [2022-01-10 11:51:37,153 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 286 treesize of output 262 [2022-01-10 11:51:37,158 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 262 treesize of output 238 [2022-01-10 11:51:37,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-10 11:51:37,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541593431] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:51:37,612 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:51:37,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 28 [2022-01-10 11:51:37,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294588046] [2022-01-10 11:51:37,612 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:51:37,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-01-10 11:51:37,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:37,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-01-10 11:51:37,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=569, Unknown=3, NotChecked=98, Total=756 [2022-01-10 11:51:37,613 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 28 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 28 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:38,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:38,557 INFO L93 Difference]: Finished difference Result 83 states and 100 transitions. [2022-01-10 11:51:38,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-10 11:51:38,557 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 28 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-01-10 11:51:38,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:38,558 INFO L225 Difference]: With dead ends: 83 [2022-01-10 11:51:38,558 INFO L226 Difference]: Without dead ends: 75 [2022-01-10 11:51:38,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=248, Invalid=1737, Unknown=3, NotChecked=174, Total=2162 [2022-01-10 11:51:38,559 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 63 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 133 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 11:51:38,559 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 128 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 343 Invalid, 0 Unknown, 133 Unchecked, 0.2s Time] [2022-01-10 11:51:38,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-01-10 11:51:38,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 67. [2022-01-10 11:51:38,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 66 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:38,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2022-01-10 11:51:38,564 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 22 [2022-01-10 11:51:38,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:38,564 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2022-01-10 11:51:38,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.8928571428571428) internal successors, (53), 28 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:38,564 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2022-01-10 11:51:38,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-10 11:51:38,565 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:38,565 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:51:38,585 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-01-10 11:51:38,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:38,786 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:38,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:38,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1893016359, now seen corresponding path program 2 times [2022-01-10 11:51:38,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:38,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427334354] [2022-01-10 11:51:38,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:38,786 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:38,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:39,075 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:39,076 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:39,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427334354] [2022-01-10 11:51:39,076 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427334354] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:51:39,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30249012] [2022-01-10 11:51:39,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 11:51:39,076 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:39,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:51:39,077 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 11:51:39,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-01-10 11:51:39,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 11:51:39,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 11:51:39,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 74 conjunts are in the unsatisfiable core [2022-01-10 11:51:39,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:51:39,281 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 11:51:39,335 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 11:51:39,336 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 11:51:39,390 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 11:51:39,399 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 11:51:39,448 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 11:51:39,459 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 11:51:39,459 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 29 treesize of output 33 [2022-01-10 11:51:39,464 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 19 treesize of output 7 [2022-01-10 11:51:39,484 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 11:51:39,484 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 43 treesize of output 41 [2022-01-10 11:51:39,495 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-01-10 11:51:39,495 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 24 treesize of output 26 [2022-01-10 11:51:39,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:39,589 INFO L353 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-01-10 11:51:39,590 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 141 [2022-01-10 11:51:39,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:39,595 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 63 treesize of output 54 [2022-01-10 11:51:39,598 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 138 [2022-01-10 11:51:39,707 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-01-10 11:51:39,707 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 258 treesize of output 211 [2022-01-10 11:51:39,722 INFO L353 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2022-01-10 11:51:39,723 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 239 treesize of output 221 [2022-01-10 11:51:39,727 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 107 treesize of output 82 [2022-01-10 11:51:39,847 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:39,852 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 11:51:39,852 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 72 [2022-01-10 11:51:39,856 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 31 [2022-01-10 11:51:39,912 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:39,919 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-10 11:51:39,919 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 29 treesize of output 21 [2022-01-10 11:51:39,926 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:39,926 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:51:40,211 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:40,211 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 91 [2022-01-10 11:51:40,238 INFO L353 Elim1Store]: treesize reduction 4, result has 93.1 percent of original size [2022-01-10 11:51:40,239 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 2962 treesize of output 2804 [2022-01-10 11:51:40,257 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:40,257 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 2387 treesize of output 2103 [2022-01-10 11:51:42,906 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 92 treesize of output 62 [2022-01-10 11:51:42,989 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 83 treesize of output 59 [2022-01-10 11:51:45,104 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 92 treesize of output 62 [2022-01-10 11:51:45,175 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 83 treesize of output 59 [2022-01-10 11:51:46,399 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 92 treesize of output 62 [2022-01-10 11:51:46,490 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 83 treesize of output 59 [2022-01-10 11:51:46,793 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 92 treesize of output 62 [2022-01-10 11:51:46,920 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 83 treesize of output 59 [2022-01-10 11:51:47,105 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 83 treesize of output 59 [2022-01-10 11:51:47,174 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 83 treesize of output 59 [2022-01-10 11:51:47,339 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 92 treesize of output 62 [2022-01-10 11:51:47,413 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 92 treesize of output 62 [2022-01-10 11:51:47,706 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:47,707 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 258 treesize of output 222 [2022-01-10 11:51:47,714 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:47,714 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 186 treesize of output 162 [2022-01-10 11:51:47,729 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:47,729 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 836 treesize of output 783 [2022-01-10 11:51:47,748 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:47,748 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 770 treesize of output 732 [2022-01-10 11:51:47,760 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 712 treesize of output 616 [2022-01-10 11:51:47,779 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:47,779 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 718 treesize of output 705 [2022-01-10 11:51:47,802 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:47,802 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 845 treesize of output 591 [2022-01-10 11:51:47,810 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 460 treesize of output 424 [2022-01-10 11:51:49,442 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:49,443 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30249012] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:51:49,443 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:51:49,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 30 [2022-01-10 11:51:49,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715771745] [2022-01-10 11:51:49,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:51:49,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-01-10 11:51:49,443 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:49,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-01-10 11:51:49,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=764, Unknown=1, NotChecked=0, Total=870 [2022-01-10 11:51:49,444 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 30 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 30 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:50,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:50,297 INFO L93 Difference]: Finished difference Result 100 states and 117 transitions. [2022-01-10 11:51:50,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 11:51:50,297 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 30 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-01-10 11:51:50,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:50,298 INFO L225 Difference]: With dead ends: 100 [2022-01-10 11:51:50,298 INFO L226 Difference]: Without dead ends: 94 [2022-01-10 11:51:50,299 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=320, Invalid=1841, Unknown=1, NotChecked=0, Total=2162 [2022-01-10 11:51:50,299 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 95 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 11:51:50,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 257 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 345 Invalid, 0 Unknown, 169 Unchecked, 0.3s Time] [2022-01-10 11:51:50,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-01-10 11:51:50,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 70. [2022-01-10 11:51:50,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 69 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:50,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 84 transitions. [2022-01-10 11:51:50,304 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 84 transitions. Word has length 22 [2022-01-10 11:51:50,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:50,305 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 84 transitions. [2022-01-10 11:51:50,305 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 30 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:51:50,305 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 84 transitions. [2022-01-10 11:51:50,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 11:51:50,305 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:50,305 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:51:50,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-01-10 11:51:50,515 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-10 11:51:50,516 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:50,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:50,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1337745469, now seen corresponding path program 4 times [2022-01-10 11:51:50,516 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:50,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283415116] [2022-01-10 11:51:50,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:50,516 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:51,022 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:51,023 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:51,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283415116] [2022-01-10 11:51:51,023 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283415116] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:51:51,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274481810] [2022-01-10 11:51:51,023 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-10 11:51:51,023 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:51,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:51:51,024 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 11:51:51,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-01-10 11:51:51,249 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-10 11:51:51,249 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 11:51:51,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 69 conjunts are in the unsatisfiable core [2022-01-10 11:51:51,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:51:51,259 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 11:51:51,354 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 11:51:51,354 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 11:51:51,415 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 11:51:51,424 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 11:51:51,487 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 11:51:51,487 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 43 treesize of output 41 [2022-01-10 11:51:51,497 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-01-10 11:51:51,497 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 24 treesize of output 26 [2022-01-10 11:51:51,507 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:51,508 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 40 treesize of output 38 [2022-01-10 11:51:51,585 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:51,592 INFO L353 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-01-10 11:51:51,592 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 103 [2022-01-10 11:51:51,595 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 180 treesize of output 126 [2022-01-10 11:51:51,703 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-01-10 11:51:51,703 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 262 treesize of output 215 [2022-01-10 11:51:51,726 INFO L353 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2022-01-10 11:51:51,727 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 254 treesize of output 224 [2022-01-10 11:51:51,730 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 55 [2022-01-10 11:51:52,006 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:52,010 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 11:51:52,010 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 228 treesize of output 99 [2022-01-10 11:51:52,014 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 30 [2022-01-10 11:51:52,052 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 11:51:52,067 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:52,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:51:52,202 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 447 treesize of output 307 [2022-01-10 11:51:52,437 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:52,437 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 159 treesize of output 141 [2022-01-10 11:51:52,442 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:52,442 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 130 [2022-01-10 11:51:52,970 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:52,970 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 211 treesize of output 188 [2022-01-10 11:51:52,975 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:52,975 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 224 treesize of output 188 [2022-01-10 11:51:53,068 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:53,069 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 2860 treesize of output 2853 [2022-01-10 11:51:54,150 INFO L353 Elim1Store]: treesize reduction 630, result has 57.9 percent of original size [2022-01-10 11:51:54,151 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 10967 treesize of output 10836 [2022-01-10 11:51:54,317 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:54,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 10848 treesize of output 7060 [2022-01-10 11:51:54,458 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:54,458 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 7060 treesize of output 6822 [2022-01-10 11:51:54,653 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:54,654 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 6842 treesize of output 6574 [2022-01-10 11:51:54,950 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:54,951 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 5204 treesize of output 4892 [2022-01-10 11:51:55,058 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 5054 treesize of output 4310 [2022-01-10 11:51:55,173 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2022-01-10 11:51:55,174 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-10 11:51:55,174 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2022-01-10 11:51:55,174 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812748746] [2022-01-10 11:51:55,174 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-10 11:51:55,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-10 11:51:55,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:51:55,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-10 11:51:55,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=772, Unknown=0, NotChecked=0, Total=870 [2022-01-10 11:51:55,175 INFO L87 Difference]: Start difference. First operand 70 states and 84 transitions. Second operand has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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 11:51:55,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:51:55,906 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2022-01-10 11:51:55,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-10 11:51:55,907 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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 11:51:55,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:51:55,907 INFO L225 Difference]: With dead ends: 94 [2022-01-10 11:51:55,907 INFO L226 Difference]: Without dead ends: 90 [2022-01-10 11:51:55,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 23 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=229, Invalid=1663, Unknown=0, NotChecked=0, Total=1892 [2022-01-10 11:51:55,908 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 100 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 11:51:55,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 103 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 11:51:55,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-01-10 11:51:55,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 72. [2022-01-10 11:51:55,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.2112676056338028) internal successors, (86), 71 states have internal predecessors, (86), 0 states have call successors, (0), 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 11:51:55,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2022-01-10 11:51:55,914 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 24 [2022-01-10 11:51:55,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:51:55,914 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2022-01-10 11:51:55,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5) internal successors, (24), 15 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 11:51:55,914 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2022-01-10 11:51:55,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 11:51:55,914 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:51:55,914 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, 1] [2022-01-10 11:51:55,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-01-10 11:51:56,131 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-01-10 11:51:56,131 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:51:56,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:51:56,132 INFO L85 PathProgramCache]: Analyzing trace with hash 102563186, now seen corresponding path program 1 times [2022-01-10 11:51:56,132 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:51:56,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647641080] [2022-01-10 11:51:56,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:56,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:51:56,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:56,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:56,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:51:56,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647641080] [2022-01-10 11:51:56,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647641080] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:51:56,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259962126] [2022-01-10 11:51:56,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:51:56,442 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:51:56,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:51:56,443 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 11:51:56,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-01-10 11:51:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:51:56,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 67 conjunts are in the unsatisfiable core [2022-01-10 11:51:56,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:51:56,686 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 11:51:56,743 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 11:51:56,744 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 11:51:56,803 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 11:51:56,809 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 11:51:56,874 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 11:51:56,875 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 43 treesize of output 41 [2022-01-10 11:51:56,886 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-01-10 11:51:56,887 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 24 treesize of output 26 [2022-01-10 11:51:56,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:51:56,899 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 29 treesize of output 29 [2022-01-10 11:51:56,982 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:56,989 INFO L353 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-01-10 11:51:56,989 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 103 [2022-01-10 11:51:56,993 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 169 treesize of output 123 [2022-01-10 11:51:57,089 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-01-10 11:51:57,089 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 262 treesize of output 215 [2022-01-10 11:51:57,104 INFO L353 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2022-01-10 11:51:57,104 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 243 treesize of output 215 [2022-01-10 11:51:57,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 55 [2022-01-10 11:51:57,380 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:51:57,384 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 11:51:57,384 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 228 treesize of output 99 [2022-01-10 11:51:57,389 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 27 [2022-01-10 11:51:57,424 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 11:51:57,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:51:57,438 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:51:57,512 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 319 treesize of output 217 [2022-01-10 11:51:57,519 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_904 (Array Int Int)) (v_ArrVal_903 (Array Int Int))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (select (let ((.cse0 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_904))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse1))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_903) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse1))) (+ (* (- 18446744073709551616) (div (+ .cse2 4) 18446744073709551616)) .cse2 4)))))) (forall ((v_ArrVal_904 (Array Int Int)) (v_ArrVal_903 (Array Int Int))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| (let ((.cse3 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_903)) (.cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (select (select .cse3 (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_904) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse4)) (let ((.cse5 (select (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse4))) (+ (* (- 18446744073709551616) (div (+ .cse5 4) 18446744073709551616)) .cse5 4))))))) is different from false [2022-01-10 11:51:57,710 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:57,710 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 161 [2022-01-10 11:51:57,716 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:57,717 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 161 treesize of output 150 [2022-01-10 11:51:57,870 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_26 (Array Int Int)) (v_arrayElimArr_27 (Array Int Int))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse0 (select v_arrayElimArr_26 .cse1))) (or (not (<= 0 .cse0)) (not (<= .cse0 0)) (not (= (select |c_#validInt| (select v_arrayElimArr_27 .cse1)) 0)) (and (forall ((v_ArrVal_904 (Array Int Int)) (v_ArrVal_903 (Array Int Int))) (let ((.cse4 (select v_arrayElimArr_27 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616)))) (= (let ((.cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (select (let ((.cse2 (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_arrayElimArr_27) .cse4 v_ArrVal_904))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse3))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_arrayElimArr_26) .cse4 v_ArrVal_903) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse3))) (+ (* (- 18446744073709551616) (div (+ .cse5 4) 18446744073709551616)) .cse5 4)))) .cse4))) (forall ((v_prenex_35 (Array Int Int)) (v_prenex_34 (Array Int Int))) (let ((.cse10 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616))) (= (let ((.cse7 (select v_arrayElimArr_27 .cse10))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_arrayElimArr_26) .cse7 v_prenex_35)) (.cse8 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (select (select .cse6 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_arrayElimArr_27) .cse7 v_prenex_34) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse8)) (let ((.cse9 (select (select .cse6 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse8))) (+ (* (- 18446744073709551616) (div (+ .cse9 4) 18446744073709551616)) .cse9 4))))) (select v_arrayElimArr_26 .cse10))))))))) is different from false [2022-01-10 11:51:57,992 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:57,992 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 285 treesize of output 262 [2022-01-10 11:51:57,998 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:57,998 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 262 treesize of output 214 [2022-01-10 11:51:58,077 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:58,078 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 3178 treesize of output 3124 [2022-01-10 11:51:59,082 INFO L353 Elim1Store]: treesize reduction 954, result has 55.5 percent of original size [2022-01-10 11:51:59,083 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 11 select indices, 11 select index equivalence classes, 0 disjoint index pairs (out of 55 index pairs), introduced 12 new quantified variables, introduced 55 case distinctions, treesize of input 29474 treesize of output 26947 [2022-01-10 11:51:59,279 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:59,280 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 26959 treesize of output 18205 [2022-01-10 11:51:59,496 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:59,496 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 18225 treesize of output 17770 [2022-01-10 11:51:59,885 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:51:59,886 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 15596 treesize of output 14085 [2022-01-10 11:52:00,066 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 14544 treesize of output 13056 [2022-01-10 11:52:00,306 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:52:00,306 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 12814 treesize of output 12573 [2022-01-10 11:52:00,636 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 690 treesize of output 462 [2022-01-10 11:52:00,794 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2022-01-10 11:52:00,794 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-10 11:52:00,794 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-01-10 11:52:00,794 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750033189] [2022-01-10 11:52:00,794 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-10 11:52:00,794 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 11:52:00,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:52:00,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 11:52:00,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=511, Unknown=20, NotChecked=94, Total=702 [2022-01-10 11:52:00,795 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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 11:52:01,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:52:01,221 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2022-01-10 11:52:01,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 11:52:01,221 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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 11:52:01,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:52:01,221 INFO L225 Difference]: With dead ends: 98 [2022-01-10 11:52:01,221 INFO L226 Difference]: Without dead ends: 94 [2022-01-10 11:52:01,222 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=161, Invalid=1077, Unknown=30, NotChecked=138, Total=1406 [2022-01-10 11:52:01,222 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 91 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 11:52:01,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 108 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 11:52:01,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-01-10 11:52:01,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 76. [2022-01-10 11:52:01,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.2) internal successors, (90), 75 states have internal predecessors, (90), 0 states have call successors, (0), 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 11:52:01,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2022-01-10 11:52:01,229 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 24 [2022-01-10 11:52:01,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:52:01,229 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2022-01-10 11:52:01,229 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 13 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 11:52:01,229 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2022-01-10 11:52:01,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 11:52:01,229 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:52:01,229 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:52:01,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-01-10 11:52:01,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-01-10 11:52:01,439 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 11:52:01,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:52:01,440 INFO L85 PathProgramCache]: Analyzing trace with hash 326957434, now seen corresponding path program 5 times [2022-01-10 11:52:01,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:52:01,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840064990] [2022-01-10 11:52:01,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:52:01,440 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:52:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:52:01,857 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 11:52:01,858 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:52:01,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840064990] [2022-01-10 11:52:01,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840064990] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:52:01,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802630740] [2022-01-10 11:52:01,858 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-10 11:52:01,858 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:52:01,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:52:01,859 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 11:52:01,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-01-10 11:52:02,372 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-10 11:52:02,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 11:52:02,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 94 conjunts are in the unsatisfiable core [2022-01-10 11:52:02,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:52:02,387 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 11:52:02,459 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 11:52:02,459 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 11:52:02,514 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 11:52:02,524 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 11:52:02,577 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 11:52:02,577 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 40 treesize of output 42 [2022-01-10 11:52:02,587 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 28 treesize of output 10 [2022-01-10 11:52:02,609 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 11:52:02,609 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 43 treesize of output 41 [2022-01-10 11:52:02,619 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-01-10 11:52:02,619 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 24 treesize of output 26 [2022-01-10 11:52:02,631 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 11:52:02,726 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:52:02,735 INFO L353 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-01-10 11:52:02,735 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 219 treesize of output 141 [2022-01-10 11:52:02,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:52:02,740 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 63 treesize of output 54 [2022-01-10 11:52:02,743 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 203 treesize of output 141 [2022-01-10 11:52:02,846 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:52:02,862 INFO L353 Elim1Store]: treesize reduction 104, result has 23.0 percent of original size [2022-01-10 11:52:02,862 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 207 treesize of output 124 [2022-01-10 11:52:02,878 INFO L353 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2022-01-10 11:52:02,878 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 224 treesize of output 193 [2022-01-10 11:52:02,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:52:02,884 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 30 treesize of output 32 [2022-01-10 11:52:02,999 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:52:03,015 INFO L353 Elim1Store]: treesize reduction 104, result has 23.0 percent of original size [2022-01-10 11:52:03,016 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 464 treesize of output 219 [2022-01-10 11:52:03,037 INFO L353 Elim1Store]: treesize reduction 108, result has 20.0 percent of original size [2022-01-10 11:52:03,037 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 399 treesize of output 218 [2022-01-10 11:52:03,042 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 54 treesize of output 56 [2022-01-10 11:52:03,201 INFO L353 Elim1Store]: treesize reduction 50, result has 39.0 percent of original size [2022-01-10 11:52:03,202 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 563 treesize of output 446 [2022-01-10 11:52:03,242 INFO L353 Elim1Store]: treesize reduction 64, result has 38.5 percent of original size [2022-01-10 11:52:03,242 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 526 treesize of output 410 [2022-01-10 11:52:03,250 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:52:03,260 INFO L353 Elim1Store]: treesize reduction 49, result has 49.0 percent of original size [2022-01-10 11:52:03,261 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 1 case distinctions, treesize of input 85 treesize of output 94 [2022-01-10 11:52:03,271 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 86 treesize of output 32 [2022-01-10 11:52:03,311 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 172 treesize of output 82 [2022-01-10 11:52:03,339 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 140 treesize of output 50 [2022-01-10 11:52:03,364 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 172 treesize of output 82 [2022-01-10 11:52:03,378 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 140 treesize of output 50 [2022-01-10 11:52:03,408 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 192 treesize of output 102 [2022-01-10 11:52:03,447 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 160 treesize of output 70 [2022-01-10 11:52:03,708 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 74 treesize of output 44 [2022-01-10 11:52:03,994 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 225 treesize of output 141 [2022-01-10 11:52:04,582 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 155 treesize of output 71 [2022-01-10 11:52:04,961 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 280 treesize of output 184 [2022-01-10 11:52:05,035 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 366 treesize of output 276