/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_SUM.epf -i ../../../trunk/examples/svcomp/list-properties/simple_built_from_end.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 05:19:36,505 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 05:19:36,507 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 05:19:36,576 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 05:19:36,576 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 05:19:36,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 05:19:36,578 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 05:19:36,580 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 05:19:36,581 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 05:19:36,585 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 05:19:36,586 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 05:19:36,587 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 05:19:36,587 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 05:19:36,588 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 05:19:36,588 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 05:19:36,589 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 05:19:36,590 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 05:19:36,590 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 05:19:36,592 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 05:19:36,593 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 05:19:36,594 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 05:19:36,598 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 05:19:36,601 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 05:19:36,603 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 05:19:36,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 05:19:36,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 05:19:36,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 05:19:36,614 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 05:19:36,615 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 05:19:36,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 05:19:36,616 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 05:19:36,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 05:19:36,618 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 05:19:36,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 05:19:36,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 05:19:36,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 05:19:36,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 05:19:36,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 05:19:36,620 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 05:19:36,622 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 05:19:36,623 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 05:19:36,624 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 05:19:36,653 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 05:19:36,653 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 05:19:36,653 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 05:19:36,654 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 05:19:36,655 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 05:19:36,655 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 05:19:36,655 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 05:19:36,655 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 05:19:36,655 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 05:19:36,655 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 05:19:36,656 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 05:19:36,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 05:19:36,656 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 05:19:36,656 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 05:19:36,656 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 05:19:36,657 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 05:19:36,657 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 05:19:36,657 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 05:19:36,657 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 05:19:36,657 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 05:19:36,657 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 05:19:36,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:19:36,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 05:19:36,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 05:19:36,658 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 05:19:36,658 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 05:19:36,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 05:19:36,658 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 05:19:36,658 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 05:19:36,658 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 05:19:36,658 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 05:19:36,658 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 05:19:36,659 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 05:19:36,659 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM 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-11 05:19:36,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 05:19:36,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 05:19:36,907 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 05:19:36,908 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 05:19:36,910 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 05:19:36,911 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/simple_built_from_end.i [2022-01-11 05:19:36,959 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30af0efb9/307b2cbf052a450ea2c280843ba6bf8b/FLAGcb72e43c0 [2022-01-11 05:19:37,369 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 05:19:37,369 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/simple_built_from_end.i [2022-01-11 05:19:37,379 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30af0efb9/307b2cbf052a450ea2c280843ba6bf8b/FLAGcb72e43c0 [2022-01-11 05:19:37,388 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30af0efb9/307b2cbf052a450ea2c280843ba6bf8b [2022-01-11 05:19:37,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 05:19:37,391 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 05:19:37,393 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 05:19:37,393 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 05:19:37,395 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 05:19:37,395 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:19:37" (1/1) ... [2022-01-11 05:19:37,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c99c37e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:19:37, skipping insertion in model container [2022-01-11 05:19:37,396 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:19:37" (1/1) ... [2022-01-11 05:19:37,401 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 05:19:37,431 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 05:19:37,674 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/simple_built_from_end.i[23125,23138] [2022-01-11 05:19:37,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:19:37,687 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 05:19:37,719 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/simple_built_from_end.i[23125,23138] [2022-01-11 05:19:37,720 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:19:37,743 INFO L208 MainTranslator]: Completed translation [2022-01-11 05:19:37,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:19:37 WrapperNode [2022-01-11 05:19:37,743 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 05:19:37,745 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 05:19:37,745 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 05:19:37,745 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 05:19:37,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:19:37" (1/1) ... [2022-01-11 05:19:37,777 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:19:37" (1/1) ... [2022-01-11 05:19:37,794 INFO L137 Inliner]: procedures = 127, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 43 [2022-01-11 05:19:37,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 05:19:37,795 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 05:19:37,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 05:19:37,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 05:19:37,802 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:19:37" (1/1) ... [2022-01-11 05:19:37,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:19:37" (1/1) ... [2022-01-11 05:19:37,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:19:37" (1/1) ... [2022-01-11 05:19:37,807 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:19:37" (1/1) ... [2022-01-11 05:19:37,812 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:19:37" (1/1) ... [2022-01-11 05:19:37,819 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:19:37" (1/1) ... [2022-01-11 05:19:37,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:19:37" (1/1) ... [2022-01-11 05:19:37,822 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 05:19:37,823 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 05:19:37,823 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 05:19:37,823 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 05:19:37,824 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:19:37" (1/1) ... [2022-01-11 05:19:37,832 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:19:37,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:19:37,855 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-11 05:19:37,882 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-11 05:19:37,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-11 05:19:37,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-11 05:19:37,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 05:19:37,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-11 05:19:37,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-11 05:19:37,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-11 05:19:37,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 05:19:37,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 05:19:37,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 05:19:37,982 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 05:19:37,983 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 05:19:38,100 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 05:19:38,119 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 05:19:38,120 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-11 05:19:38,121 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:19:38 BoogieIcfgContainer [2022-01-11 05:19:38,121 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 05:19:38,122 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 05:19:38,122 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 05:19:38,123 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 05:19:38,125 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:19:38" (1/1) ... [2022-01-11 05:19:38,216 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:19:38 BasicIcfg [2022-01-11 05:19:38,217 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 05:19:38,218 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 05:19:38,218 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 05:19:38,221 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 05:19:38,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 05:19:37" (1/4) ... [2022-01-11 05:19:38,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e751464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:19:38, skipping insertion in model container [2022-01-11 05:19:38,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:19:37" (2/4) ... [2022-01-11 05:19:38,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e751464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:19:38, skipping insertion in model container [2022-01-11 05:19:38,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:19:38" (3/4) ... [2022-01-11 05:19:38,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e751464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 05:19:38, skipping insertion in model container [2022-01-11 05:19:38,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:19:38" (4/4) ... [2022-01-11 05:19:38,223 INFO L111 eAbstractionObserver]: Analyzing ICFG simple_built_from_end.iTransformedIcfg [2022-01-11 05:19:38,226 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 05:19:38,226 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 05:19:38,261 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 05:19:38,266 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-11 05:19:38,267 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 05:19:38,277 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 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-11 05:19:38,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-01-11 05:19:38,281 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:19:38,281 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-01-11 05:19:38,282 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:19:38,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:19:38,290 INFO L85 PathProgramCache]: Analyzing trace with hash -2016050996, now seen corresponding path program 1 times [2022-01-11 05:19:38,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:19:38,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612133214] [2022-01-11 05:19:38,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:19:38,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:19:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:19:38,447 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-11 05:19:38,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:19:38,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612133214] [2022-01-11 05:19:38,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612133214] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:19:38,448 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:19:38,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 05:19:38,449 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464518520] [2022-01-11 05:19:38,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:19:38,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-11 05:19:38,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:19:38,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-11 05:19:38,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 05:19:38,475 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 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 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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-11 05:19:38,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:19:38,485 INFO L93 Difference]: Finished difference Result 22 states and 29 transitions. [2022-01-11 05:19:38,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-11 05:19:38,488 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-01-11 05:19:38,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:19:38,494 INFO L225 Difference]: With dead ends: 22 [2022-01-11 05:19:38,494 INFO L226 Difference]: Without dead ends: 10 [2022-01-11 05:19:38,497 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-11 05:19:38,499 INFO L933 BasicCegarLoop]: 16 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, 16 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-11 05:19:38,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:19:38,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-01-11 05:19:38,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-01-11 05:19:38,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 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-11 05:19:38,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2022-01-11 05:19:38,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 6 [2022-01-11 05:19:38,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:19:38,525 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2022-01-11 05:19:38,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 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-11 05:19:38,527 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2022-01-11 05:19:38,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-01-11 05:19:38,527 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:19:38,527 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-01-11 05:19:38,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 05:19:38,529 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:19:38,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:19:38,532 INFO L85 PathProgramCache]: Analyzing trace with hash -2016021205, now seen corresponding path program 1 times [2022-01-11 05:19:38,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:19:38,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052101587] [2022-01-11 05:19:38,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:19:38,532 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:19:38,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:19:38,607 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-11 05:19:38,608 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:19:38,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052101587] [2022-01-11 05:19:38,608 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052101587] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:19:38,608 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:19:38,609 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:19:38,609 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542424527] [2022-01-11 05:19:38,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:19:38,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:19:38,610 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:19:38,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:19:38,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:19:38,611 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-11 05:19:38,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:19:38,634 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-01-11 05:19:38,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:19:38,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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 6 [2022-01-11 05:19:38,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:19:38,635 INFO L225 Difference]: With dead ends: 19 [2022-01-11 05:19:38,635 INFO L226 Difference]: Without dead ends: 13 [2022-01-11 05:19:38,636 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:19:38,637 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:19:38,637 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 17 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:19:38,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-01-11 05:19:38,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2022-01-11 05:19:38,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.2) internal successors, (12), 10 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-11 05:19:38,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2022-01-11 05:19:38,640 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 6 [2022-01-11 05:19:38,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:19:38,641 INFO L470 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2022-01-11 05:19:38,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 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-11 05:19:38,641 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2022-01-11 05:19:38,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-11 05:19:38,642 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:19:38,642 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:19:38,642 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 05:19:38,642 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:19:38,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:19:38,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1812819169, now seen corresponding path program 1 times [2022-01-11 05:19:38,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:19:38,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948037060] [2022-01-11 05:19:38,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:19:38,643 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:19:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:19:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:19:38,735 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:19:38,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948037060] [2022-01-11 05:19:38,735 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948037060] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:19:38,735 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:19:38,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 05:19:38,736 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79567431] [2022-01-11 05:19:38,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:19:38,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 05:19:38,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:19:38,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 05:19:38,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 05:19:38,737 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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-11 05:19:38,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:19:38,764 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-01-11 05:19:38,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 05:19:38,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-01-11 05:19:38,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:19:38,766 INFO L225 Difference]: With dead ends: 18 [2022-01-11 05:19:38,766 INFO L226 Difference]: Without dead ends: 16 [2022-01-11 05:19:38,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 05:19:38,768 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 3 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:19:38,768 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 23 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:19:38,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-01-11 05:19:38,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 13. [2022-01-11 05:19:38,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 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-11 05:19:38,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2022-01-11 05:19:38,771 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 9 [2022-01-11 05:19:38,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:19:38,772 INFO L470 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2022-01-11 05:19:38,772 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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-11 05:19:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2022-01-11 05:19:38,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-11 05:19:38,772 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:19:38,773 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:19:38,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 05:19:38,773 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:19:38,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:19:38,774 INFO L85 PathProgramCache]: Analyzing trace with hash -776046917, now seen corresponding path program 1 times [2022-01-11 05:19:38,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:19:38,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099792304] [2022-01-11 05:19:38,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:19:38,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:19:38,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:19:39,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:19:39,072 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:19:39,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099792304] [2022-01-11 05:19:39,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099792304] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:19:39,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259541983] [2022-01-11 05:19:39,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:19:39,073 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:19:39,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:19:39,075 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-11 05:19:39,106 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-11 05:19:39,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:19:39,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-11 05:19:39,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:19:39,357 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-11 05:19:39,372 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-11 05:19:39,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:19:39,487 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2022-01-11 05:19:39,494 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:19:39,497 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:19:39,501 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 28 treesize of output 15 [2022-01-11 05:19:39,528 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:19:39,528 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:19:39,628 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 77 treesize of output 73 [2022-01-11 05:19:39,632 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 73 treesize of output 69 [2022-01-11 05:19:39,638 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 115 treesize of output 103 [2022-01-11 05:19:39,644 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 149 treesize of output 137 [2022-01-11 05:19:39,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:19:39,916 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259541983] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:19:39,916 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:19:39,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-01-11 05:19:39,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005945268] [2022-01-11 05:19:39,916 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:19:39,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-11 05:19:39,918 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:19:39,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-11 05:19:39,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-11 05:19:39,919 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 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-11 05:19:39,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:19:39,986 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-01-11 05:19:39,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 05:19:39,987 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 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-11 05:19:39,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:19:39,988 INFO L225 Difference]: With dead ends: 27 [2022-01-11 05:19:39,988 INFO L226 Difference]: Without dead ends: 18 [2022-01-11 05:19:39,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-01-11 05:19:39,989 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 6 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:19:39,989 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 50 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:19:39,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-01-11 05:19:39,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2022-01-11 05:19:39,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 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-11 05:19:39,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2022-01-11 05:19:39,993 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 12 [2022-01-11 05:19:39,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:19:39,993 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2022-01-11 05:19:39,993 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.7) internal successors, (27), 10 states have internal predecessors, (27), 0 states have call successors, (0), 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-11 05:19:39,993 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2022-01-11 05:19:39,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-11 05:19:39,995 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:19:39,995 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:19:40,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-11 05:19:40,196 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-11 05:19:40,196 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:19:40,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:19:40,197 INFO L85 PathProgramCache]: Analyzing trace with hash -157168209, now seen corresponding path program 2 times [2022-01-11 05:19:40,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:19:40,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296636569] [2022-01-11 05:19:40,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:19:40,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:19:40,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:19:40,499 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-11 05:19:40,502 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:19:40,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296636569] [2022-01-11 05:19:40,508 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296636569] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:19:40,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486598920] [2022-01-11 05:19:40,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 05:19:40,508 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:19:40,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:19:40,512 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-11 05:19:40,541 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-11 05:19:40,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 05:19:40,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:19:40,651 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 37 conjunts are in the unsatisfiable core [2022-01-11 05:19:40,654 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:19:40,664 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-11 05:19:40,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:19:40,706 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 18 treesize of output 19 [2022-01-11 05:19:40,744 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:19:40,744 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 16 treesize of output 14 [2022-01-11 05:19:40,807 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-11 05:19:40,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-11 05:19:40,816 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-11 05:19:40,902 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:19:40,903 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2022-01-11 05:19:40,908 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:19:40,910 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:19:40,910 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 31 treesize of output 18 [2022-01-11 05:19:40,936 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-11 05:19:40,940 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:19:40,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:19:40,981 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 40 treesize of output 38 [2022-01-11 05:19:40,987 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 82 treesize of output 76 [2022-01-11 05:19:40,991 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 76 treesize of output 72 [2022-01-11 05:19:40,995 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 130 treesize of output 118 [2022-01-11 05:19:41,607 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_18 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_3| Int) (v_ArrVal_100 (Array Int Int)) (v_arrayElimCell_16 Int)) (let ((.cse1 (store |c_#memory_intInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_3| v_ArrVal_100)) (.cse0 (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_3|))) (or (not (<= 0 .cse0)) (= (select (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) 1) (= (select (select .cse1 v_arrayElimCell_16) v_arrayElimCell_18) 1) (not (<= .cse0 0))))) is different from false [2022-01-11 05:19:41,642 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-11 05:19:41,642 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 51 treesize of output 41 [2022-01-11 05:19:41,650 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:19:41,651 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 51 treesize of output 50 [2022-01-11 05:19:41,670 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:19:41,670 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 15 treesize of output 19 [2022-01-11 05:19:41,721 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-11 05:19:41,722 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486598920] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:19:41,722 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:19:41,722 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-01-11 05:19:41,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550206457] [2022-01-11 05:19:41,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:19:41,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-11 05:19:41,723 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:19:41,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-11 05:19:41,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=197, Unknown=1, NotChecked=28, Total=272 [2022-01-11 05:19:41,724 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 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-11 05:19:42,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:19:42,105 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2022-01-11 05:19:42,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-11 05:19:42,105 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 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 15 [2022-01-11 05:19:42,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:19:42,106 INFO L225 Difference]: With dead ends: 24 [2022-01-11 05:19:42,106 INFO L226 Difference]: Without dead ends: 22 [2022-01-11 05:19:42,106 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=407, Unknown=1, NotChecked=44, Total=600 [2022-01-11 05:19:42,107 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 33 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:19:42,108 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 29 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 90 Invalid, 0 Unknown, 27 Unchecked, 0.1s Time] [2022-01-11 05:19:42,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-01-11 05:19:42,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2022-01-11 05:19:42,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:19:42,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-01-11 05:19:42,111 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2022-01-11 05:19:42,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:19:42,111 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-01-11 05:19:42,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 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-11 05:19:42,112 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-01-11 05:19:42,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-11 05:19:42,112 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:19:42,112 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2022-01-11 05:19:42,132 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-11 05:19:42,313 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-11 05:19:42,313 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:19:42,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:19:42,314 INFO L85 PathProgramCache]: Analyzing trace with hash -682724821, now seen corresponding path program 3 times [2022-01-11 05:19:42,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:19:42,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862998427] [2022-01-11 05:19:42,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:19:42,314 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:19:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:19:42,650 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:19:42,650 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:19:42,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862998427] [2022-01-11 05:19:42,650 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862998427] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:19:42,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937551340] [2022-01-11 05:19:42,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-11 05:19:42,650 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:19:42,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:19:42,652 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-11 05:19:42,653 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-11 05:19:42,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-11 05:19:42,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:19:42,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 50 conjunts are in the unsatisfiable core [2022-01-11 05:19:42,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:19:42,865 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-11 05:19:42,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-11 05:19:42,914 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-11 05:19:42,944 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:19:42,945 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 16 treesize of output 14 [2022-01-11 05:19:42,999 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 13 treesize of output 16 [2022-01-11 05:19:43,003 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 0 case distinctions, treesize of input 13 treesize of output 16 [2022-01-11 05:19:43,007 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 20 treesize of output 22 [2022-01-11 05:19:43,012 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 20 treesize of output 22 [2022-01-11 05:19:43,263 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:19:43,263 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:19:43,270 INFO L353 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-01-11 05:19:43,270 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 97 treesize of output 43 [2022-01-11 05:19:43,278 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-11 05:19:43,278 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 20 [2022-01-11 05:19:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:19:43,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:19:43,524 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:19:43,525 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 21 treesize of output 25 [2022-01-11 05:19:43,534 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:19:43,534 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 23 treesize of output 27 [2022-01-11 05:19:43,542 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:19:43,543 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 23 treesize of output 27 [2022-01-11 05:19:43,551 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:19:43,552 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 21 treesize of output 25 [2022-01-11 05:19:44,124 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:19:44,125 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 153 treesize of output 142 [2022-01-11 05:19:44,132 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:19:44,132 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 142 treesize of output 130 [2022-01-11 05:19:44,141 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 162 treesize of output 138 [2022-01-11 05:19:44,147 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 170 treesize of output 146 [2022-01-11 05:19:44,160 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:19:44,161 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 137 treesize of output 142 [2022-01-11 05:19:44,175 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:19:44,176 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 125 treesize of output 130 [2022-01-11 05:19:44,189 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:19:44,190 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 113 treesize of output 118 [2022-01-11 05:19:44,209 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:19:44,210 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 101 treesize of output 106 [2022-01-11 05:19:45,113 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 25 treesize of output 21 [2022-01-11 05:19:45,133 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:19:45,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937551340] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:19:45,133 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:19:45,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 18 [2022-01-11 05:19:45,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980900545] [2022-01-11 05:19:45,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:19:45,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-11 05:19:45,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:19:45,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-11 05:19:45,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-01-11 05:19:45,135 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 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-11 05:19:45,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:19:45,336 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-01-11 05:19:45,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-11 05:19:45,337 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 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 18 [2022-01-11 05:19:45,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:19:45,337 INFO L225 Difference]: With dead ends: 36 [2022-01-11 05:19:45,337 INFO L226 Difference]: Without dead ends: 24 [2022-01-11 05:19:45,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=86, Invalid=420, Unknown=0, NotChecked=0, Total=506 [2022-01-11 05:19:45,339 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 21 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:19:45,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 51 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 45 Invalid, 0 Unknown, 39 Unchecked, 0.1s Time] [2022-01-11 05:19:45,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-01-11 05:19:45,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-01-11 05:19:45,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 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-11 05:19:45,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-01-11 05:19:45,342 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 18 [2022-01-11 05:19:45,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:19:45,343 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-01-11 05:19:45,343 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.4444444444444446) internal successors, (44), 18 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-11 05:19:45,343 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-01-11 05:19:45,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-11 05:19:45,343 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:19:45,343 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2022-01-11 05:19:45,370 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-11 05:19:45,555 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-11 05:19:45,556 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:19:45,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:19:45,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1229570591, now seen corresponding path program 4 times [2022-01-11 05:19:45,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:19:45,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560007891] [2022-01-11 05:19:45,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:19:45,556 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:19:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:19:45,950 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:19:45,950 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:19:45,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560007891] [2022-01-11 05:19:45,950 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560007891] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:19:45,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561472979] [2022-01-11 05:19:45,950 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-11 05:19:45,951 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:19:45,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:19:45,955 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-11 05:19:45,956 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-11 05:19:46,115 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-11 05:19:46,115 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:19:46,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 64 conjunts are in the unsatisfiable core [2022-01-11 05:19:46,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:19:46,130 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-11 05:19:46,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:19:46,146 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 18 treesize of output 19 [2022-01-11 05:19:46,175 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-11 05:19:46,175 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 22 treesize of output 24 [2022-01-11 05:19:46,253 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-11 05:19:46,256 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 22 treesize of output 24 [2022-01-11 05:19:46,266 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-11 05:19:46,318 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-01-11 05:19:46,319 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 29 treesize of output 29 [2022-01-11 05:19:46,397 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-01-11 05:19:46,409 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-01-11 05:19:46,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, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-01-11 05:19:46,420 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 42 treesize of output 36 [2022-01-11 05:19:46,424 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 8 treesize of output 7 [2022-01-11 05:19:46,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:19:46,757 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:19:46,766 INFO L353 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-01-11 05:19:46,766 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 5 case distinctions, treesize of input 109 treesize of output 58 [2022-01-11 05:19:46,771 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:19:46,777 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-11 05:19:46,777 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 20 [2022-01-11 05:19:46,802 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-11 05:19:46,805 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:19:46,805 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:19:46,906 INFO L353 Elim1Store]: treesize reduction 22, result has 60.7 percent of original size [2022-01-11 05:19:46,907 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 182 treesize of output 189 [2022-01-11 05:19:46,932 INFO L353 Elim1Store]: treesize reduction 22, result has 60.7 percent of original size [2022-01-11 05:19:46,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 298 treesize of output 273 [2022-01-11 05:19:47,381 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_26| Int) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (let ((.cse4 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_26| 4) 18446744073709551616))) (let ((.cse1 (select v_arrayElimArr_12 .cse4)) (.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 4) 18446744073709551616))) (or (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (select v_arrayElimArr_11 .cse0))) (not (<= 0 .cse1)) (= (let ((.cse2 (select v_arrayElimArr_11 .cse4)) (.cse3 (mod (+ .cse1 4) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_260) (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_arrayElimArr_11) .cse2) .cse3)) (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_arrayElimArr_12) .cse2) .cse3))) 1) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_26|)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| (select v_arrayElimArr_12 .cse0))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_26| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|)))))) is different from false [2022-01-11 05:19:47,605 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:19:47,605 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 83 treesize of output 84 [2022-01-11 05:19:47,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:19:47,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:19:47,617 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 134 [2022-01-11 05:19:47,640 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:19:47,641 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 130 treesize of output 118 [2022-01-11 05:19:47,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:19:47,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:19:47,652 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 218 treesize of output 170 [2022-01-11 05:19:47,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:19:47,667 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:19:47,668 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 182 treesize of output 158 [2022-01-11 05:19:47,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:19:47,683 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:19:47,683 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 102 [2022-01-11 05:19:48,756 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-11 05:19:49,461 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-11 05:19:49,572 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_260 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_arrayElimCell_67 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_8| Int)) (let ((.cse0 (select (store |c_#validInt| v_arrayElimCell_67 1) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_8|)) (.cse1 (select |c_#validInt| v_arrayElimCell_67))) (or (< 0 .cse0) (= (select (select (store (store |c_#memory_intInt| v_arrayElimCell_67 v_ArrVal_252) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_8| v_ArrVal_260) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) 1) (< 0 .cse1) (< .cse0 0) (< .cse1 0)))) is different from false [2022-01-11 05:19:49,599 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-11 05:19:49,599 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-11 05:19:49,603 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 122 treesize of output 110 [2022-01-11 05:19:49,612 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 90 treesize of output 86 [2022-01-11 05:19:49,615 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 78 [2022-01-11 05:19:49,786 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-01-11 05:19:49,786 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561472979] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:19:49,786 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:19:49,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2022-01-11 05:19:49,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545614028] [2022-01-11 05:19:49,786 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:19:49,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-11 05:19:49,788 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:19:49,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-11 05:19:49,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=432, Unknown=2, NotChecked=86, Total=600 [2022-01-11 05:19:49,789 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 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-11 05:19:49,992 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse6 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse0))) (and (= (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse0) 0) (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_26| Int) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (let ((.cse5 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_26| 4) 18446744073709551616))) (let ((.cse2 (select v_arrayElimArr_12 .cse5)) (.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 4) 18446744073709551616))) (or (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (select v_arrayElimArr_11 .cse1))) (not (<= 0 .cse2)) (= (let ((.cse3 (select v_arrayElimArr_11 .cse5)) (.cse4 (mod (+ .cse2 4) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_260) (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_arrayElimArr_11) .cse3) .cse4)) (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_arrayElimArr_12) .cse3) .cse4))) 1) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_26|)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| (select v_arrayElimArr_12 .cse1))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_26| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|)))))) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt|) 1) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt|)) (not (= .cse6 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| .cse6)) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) 0) 1) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) 1) (= (select |c_#validInt| 1) 1) (= (select (select |c_#memory_intInt| .cse6) 0) 1) (= (select |c_#validInt| .cse6) 1)))) is different from false [2022-01-11 05:19:49,999 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse6 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse0))) (and (= (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse0) 0) (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_26| Int) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (let ((.cse5 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_26| 4) 18446744073709551616))) (let ((.cse2 (select v_arrayElimArr_12 .cse5)) (.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 4) 18446744073709551616))) (or (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (select v_arrayElimArr_11 .cse1))) (not (<= 0 .cse2)) (= (let ((.cse3 (select v_arrayElimArr_11 .cse5)) (.cse4 (mod (+ .cse2 4) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_260) (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_arrayElimArr_11) .cse3) .cse4)) (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_arrayElimArr_12) .cse3) .cse4))) 1) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_26|)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| (select v_arrayElimArr_12 .cse1))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_26| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|)))))) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt|) 1) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt|)) (not (= .cse6 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| .cse6)) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) 0) 1) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) 1) (= (select (select |c_#memory_intInt| .cse6) 0) 1)))) is different from false [2022-01-11 05:19:50,089 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse10 (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616)) (.cse9 (select .cse10 4))) (let ((.cse8 (select (select |c_#memory_$Pointer$.baseInt| .cse9) 4)) (.cse0 (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|)) (.cse7 (select .cse10 .cse1))) (and (= (select .cse0 .cse1) 0) (forall ((v_arrayElimArr_11 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_26| Int) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_260 (Array Int Int))) (let ((.cse6 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_26| 4) 18446744073709551616))) (let ((.cse3 (select v_arrayElimArr_12 .cse6)) (.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 4) 18446744073709551616))) (or (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (select v_arrayElimArr_11 .cse2))) (not (<= 0 .cse3)) (= (let ((.cse4 (select v_arrayElimArr_11 .cse6)) (.cse5 (mod (+ .cse3 4) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_260) (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_arrayElimArr_11) .cse4) .cse5)) (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_arrayElimArr_12) .cse4) .cse5))) 1) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_26|)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| (select v_arrayElimArr_12 .cse2))) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_26| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|)))))) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt|) 1) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt|)) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (not (= .cse7 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (= (select (select |c_#memory_intInt| .cse8) 0) 1) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| .cse8)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) (not (= .cse9 .cse8)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| .cse7)) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) 0) 1) (= (select (select |c_#memory_$Pointer$.offsetInt| .cse9) 4) 0) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) 1) (= (select .cse0 4) 0) (= (select (select |c_#memory_intInt| .cse7) 0) 1) (= (select |c_#validInt| .cse7) 1))))) is different from false [2022-01-11 05:19:50,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:19:50,233 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-01-11 05:19:50,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-11 05:19:50,234 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 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-11 05:19:50,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:19:50,234 INFO L225 Difference]: With dead ends: 28 [2022-01-11 05:19:50,234 INFO L226 Difference]: Without dead ends: 26 [2022-01-11 05:19:50,235 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=170, Invalid=774, Unknown=6, NotChecked=310, Total=1260 [2022-01-11 05:19:50,236 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 13 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:19:50,236 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 48 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 120 Invalid, 0 Unknown, 64 Unchecked, 0.1s Time] [2022-01-11 05:19:50,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-11 05:19:50,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-01-11 05:19:50,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 24 states have internal predecessors, (26), 0 states have call successors, (0), 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-11 05:19:50,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-01-11 05:19:50,240 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 21 [2022-01-11 05:19:50,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:19:50,240 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-01-11 05:19:50,240 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 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-11 05:19:50,240 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-01-11 05:19:50,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-11 05:19:50,240 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:19:50,241 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1] [2022-01-11 05:19:50,266 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-11 05:19:50,441 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-11 05:19:50,441 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:19:50,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:19:50,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1637554245, now seen corresponding path program 5 times [2022-01-11 05:19:50,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:19:50,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294386527] [2022-01-11 05:19:50,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:19:50,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:19:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:19:50,894 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:19:50,894 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:19:50,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294386527] [2022-01-11 05:19:50,895 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294386527] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:19:50,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513052212] [2022-01-11 05:19:50,895 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-11 05:19:50,895 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:19:50,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:19:50,896 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-11 05:19:50,897 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-11 05:19:51,185 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-01-11 05:19:51,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:19:51,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 73 conjunts are in the unsatisfiable core [2022-01-11 05:19:51,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:19:51,231 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-11 05:19:51,285 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-11 05:19:51,290 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-11 05:19:51,362 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-11 05:19:51,362 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 22 treesize of output 24 [2022-01-11 05:19:51,479 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 0 case distinctions, treesize of input 13 treesize of output 16 [2022-01-11 05:19:51,485 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 13 treesize of output 16 [2022-01-11 05:19:51,491 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 41 treesize of output 35 [2022-01-11 05:19:51,498 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 41 treesize of output 35 [2022-01-11 05:19:51,594 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-01-11 05:19:51,595 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 29 treesize of output 29 [2022-01-11 05:19:51,727 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 9 treesize of output 12 [2022-01-11 05:19:51,742 INFO L353 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-01-11 05:19:51,742 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 81 [2022-01-11 05:19:51,747 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2022-01-11 05:19:51,753 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 8 treesize of output 7 [2022-01-11 05:19:52,752 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:19:52,758 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:19:52,799 INFO L353 Elim1Store]: treesize reduction 162, result has 6.4 percent of original size [2022-01-11 05:19:52,800 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 213 treesize of output 99 [2022-01-11 05:19:52,813 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:19:52,825 INFO L353 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-01-11 05:19:52,826 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 32 [2022-01-11 05:19:52,856 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:19:52,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:19:53,462 INFO L353 Elim1Store]: treesize reduction 22, result has 60.7 percent of original size [2022-01-11 05:19:53,463 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 653 treesize of output 572 [2022-01-11 05:19:53,499 INFO L353 Elim1Store]: treesize reduction 22, result has 60.7 percent of original size [2022-01-11 05:19:53,500 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 1047 treesize of output 930 [2022-01-11 05:19:57,808 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_36| Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_38| Int) (v_arrayElimArr_19 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int))) (let ((.cse10 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_38| 4) 18446744073709551616))) (let ((.cse0 (select v_arrayElimArr_20 .cse10))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 4) 18446744073709551616)) (.cse2 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_arrayElimArr_20)) (.cse3 (select v_arrayElimArr_19 .cse10)) (.cse4 (mod (+ .cse0 4) 18446744073709551616))) (or (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_38| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|)) (< |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_36| 0) (not (<= 0 .cse0)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| (select v_arrayElimArr_20 .cse1))) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (select v_arrayElimArr_19 .cse1))) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_38|)) (< (select (select .cse2 .cse3) .cse4) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_36|) (let ((.cse9 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_arrayElimArr_19))) (let ((.cse7 (select (select .cse9 .cse3) .cse4)) (.cse8 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt_36| 4) 18446744073709551616))) (let ((.cse5 (select (select .cse9 .cse7) .cse8)) (.cse6 (select (select .cse2 .cse7) .cse8))) (and (< 0 (+ .cse5 1)) (< 0 (+ .cse6 1)) (<= .cse5 0) (<= .cse6 0)))))))))) is different from false [2022-01-11 05:19:59,214 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:19:59,214 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 233 treesize of output 202 [2022-01-11 05:19:59,223 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:19:59,223 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 228 treesize of output 217 [2022-01-11 05:20:04,554 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:20:04,554 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 289 treesize of output 230 [2022-01-11 05:20:04,567 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:20:04,567 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 261 treesize of output 237 [2022-01-11 05:20:04,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:20:04,574 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:20:04,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:20:04,598 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:20:04,599 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 802 treesize of output 730 [2022-01-11 05:20:04,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:20:04,617 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:20:04,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:20:04,637 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:20:04,637 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 993 treesize of output 961 [2022-01-11 05:20:04,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:20:04,666 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:20:04,667 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 970 treesize of output 710 [2022-01-11 05:20:04,693 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:20:04,694 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 508 treesize of output 414 [2022-01-11 05:20:04,742 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:20:04,743 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 408 treesize of output 404 [2022-01-11 05:20:04,805 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:20:04,805 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 420 treesize of output 336