/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/list-properties/alternating_list-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 17:40:57,995 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 17:40:57,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 17:40:58,054 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 17:40:58,054 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 17:40:58,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 17:40:58,056 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 17:40:58,057 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 17:40:58,058 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 17:40:58,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 17:40:58,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 17:40:58,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 17:40:58,060 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 17:40:58,061 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 17:40:58,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 17:40:58,062 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 17:40:58,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 17:40:58,063 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 17:40:58,064 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 17:40:58,065 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 17:40:58,066 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 17:40:58,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 17:40:58,067 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 17:40:58,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 17:40:58,069 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 17:40:58,070 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 17:40:58,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 17:40:58,070 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 17:40:58,070 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 17:40:58,071 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 17:40:58,071 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 17:40:58,072 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 17:40:58,072 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 17:40:58,073 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 17:40:58,073 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 17:40:58,073 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 17:40:58,074 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 17:40:58,074 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 17:40:58,074 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 17:40:58,075 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 17:40:58,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 17:40:58,076 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 17:40:58,089 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 17:40:58,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 17:40:58,090 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 17:40:58,090 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 17:40:58,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 17:40:58,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 17:40:58,091 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 17:40:58,091 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 17:40:58,091 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 17:40:58,091 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 17:40:58,091 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 17:40:58,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 17:40:58,092 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 17:40:58,092 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 17:40:58,092 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 17:40:58,092 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 17:40:58,092 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 17:40:58,092 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 17:40:58,092 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 17:40:58,092 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 17:40:58,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 17:40:58,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:40:58,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 17:40:58,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 17:40:58,093 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 17:40:58,093 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 17:40:58,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 17:40:58,093 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 17:40:58,093 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 17:40:58,094 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 17:40:58,094 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 17:40:58,094 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 17:40:58,094 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 17:40:58,095 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 17:40:58,256 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 17:40:58,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 17:40:58,282 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 17:40:58,283 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 17:40:58,284 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 17:40:58,285 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/alternating_list-1.i [2022-01-10 17:40:58,344 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7acdbcef/26a49571647143b4b14c697f1504aa81/FLAG9bdf7f2eb [2022-01-10 17:40:58,766 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 17:40:58,770 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/alternating_list-1.i [2022-01-10 17:40:58,781 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7acdbcef/26a49571647143b4b14c697f1504aa81/FLAG9bdf7f2eb [2022-01-10 17:40:58,790 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7acdbcef/26a49571647143b4b14c697f1504aa81 [2022-01-10 17:40:58,792 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 17:40:58,793 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 17:40:58,797 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 17:40:58,797 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 17:40:58,800 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 17:40:58,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:40:58" (1/1) ... [2022-01-10 17:40:58,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17df1898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:40:58, skipping insertion in model container [2022-01-10 17:40:58,801 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:40:58" (1/1) ... [2022-01-10 17:40:58,805 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 17:40:58,834 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 17:40:59,065 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/alternating_list-1.i[23574,23587] [2022-01-10 17:40:59,068 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:40:59,075 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 17:40:59,097 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/alternating_list-1.i[23574,23587] [2022-01-10 17:40:59,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:40:59,115 INFO L208 MainTranslator]: Completed translation [2022-01-10 17:40:59,116 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:40:59 WrapperNode [2022-01-10 17:40:59,116 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 17:40:59,117 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 17:40:59,117 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 17:40:59,117 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 17:40:59,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:40:59" (1/1) ... [2022-01-10 17:40:59,131 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:40:59" (1/1) ... [2022-01-10 17:40:59,144 INFO L137 Inliner]: procedures = 127, calls = 23, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 91 [2022-01-10 17:40:59,145 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 17:40:59,145 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 17:40:59,146 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 17:40:59,146 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 17:40:59,150 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:40:59" (1/1) ... [2022-01-10 17:40:59,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:40:59" (1/1) ... [2022-01-10 17:40:59,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:40:59" (1/1) ... [2022-01-10 17:40:59,155 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:40:59" (1/1) ... [2022-01-10 17:40:59,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:40:59" (1/1) ... [2022-01-10 17:40:59,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:40:59" (1/1) ... [2022-01-10 17:40:59,164 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:40:59" (1/1) ... [2022-01-10 17:40:59,166 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 17:40:59,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 17:40:59,166 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 17:40:59,166 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 17:40:59,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:40:59" (1/1) ... [2022-01-10 17:40:59,174 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:40:59,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:40:59,195 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 17:40:59,202 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 17:40:59,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 17:40:59,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 17:40:59,222 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 17:40:59,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 17:40:59,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 17:40:59,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 17:40:59,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 17:40:59,223 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 17:40:59,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 17:40:59,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 17:40:59,285 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 17:40:59,286 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 17:40:59,426 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 17:40:59,430 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 17:40:59,430 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-10 17:40:59,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:40:59 BoogieIcfgContainer [2022-01-10 17:40:59,431 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 17:40:59,432 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 17:40:59,432 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 17:40:59,433 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 17:40:59,435 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:40:59" (1/1) ... [2022-01-10 17:40:59,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:40:59 BasicIcfg [2022-01-10 17:40:59,493 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 17:40:59,494 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 17:40:59,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 17:40:59,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 17:40:59,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 05:40:58" (1/4) ... [2022-01-10 17:40:59,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b02d1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:40:59, skipping insertion in model container [2022-01-10 17:40:59,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:40:59" (2/4) ... [2022-01-10 17:40:59,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b02d1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:40:59, skipping insertion in model container [2022-01-10 17:40:59,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:40:59" (3/4) ... [2022-01-10 17:40:59,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b02d1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 05:40:59, skipping insertion in model container [2022-01-10 17:40:59,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:40:59" (4/4) ... [2022-01-10 17:40:59,498 INFO L111 eAbstractionObserver]: Analyzing ICFG alternating_list-1.iTransformedIcfg [2022-01-10 17:40:59,501 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 17:40:59,501 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 17:40:59,530 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 17:40:59,534 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 17:40:59,534 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 17:40:59,557 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:40:59,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 17:40:59,560 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:40:59,561 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:40:59,561 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:40:59,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:40:59,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1665253908, now seen corresponding path program 1 times [2022-01-10 17:40:59,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:40:59,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608567076] [2022-01-10 17:40:59,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:40:59,572 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:40:59,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:40:59,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:40:59,684 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:40:59,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608567076] [2022-01-10 17:40:59,686 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608567076] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:40:59,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:40:59,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 17:40:59,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696404135] [2022-01-10 17:40:59,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:40:59,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 17:40:59,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:40:59,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 17:40:59,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 17:40:59,725 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 0 states have call successors, (0), 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 5.5) internal successors, (11), 2 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-10 17:40:59,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:40:59,743 INFO L93 Difference]: Finished difference Result 43 states and 60 transitions. [2022-01-10 17:40:59,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 17:40:59,744 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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) Word has length 11 [2022-01-10 17:40:59,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:40:59,750 INFO L225 Difference]: With dead ends: 43 [2022-01-10 17:40:59,750 INFO L226 Difference]: Without dead ends: 18 [2022-01-10 17:40:59,752 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 17:40:59,754 INFO L933 BasicCegarLoop]: 34 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, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:40:59,756 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:40:59,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-01-10 17:40:59,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-01-10 17:40:59,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:40:59,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-01-10 17:40:59,782 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2022-01-10 17:40:59,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:40:59,782 INFO L470 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-01-10 17:40:59,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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-10 17:40:59,782 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-01-10 17:40:59,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 17:40:59,783 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:40:59,783 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:40:59,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 17:40:59,786 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:40:59,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:40:59,787 INFO L85 PathProgramCache]: Analyzing trace with hash -777750227, now seen corresponding path program 1 times [2022-01-10 17:40:59,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:40:59,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072184899] [2022-01-10 17:40:59,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:40:59,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:40:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:40:59,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:40:59,917 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:40:59,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072184899] [2022-01-10 17:40:59,918 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072184899] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:40:59,918 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:40:59,918 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 17:40:59,918 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805498217] [2022-01-10 17:40:59,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:40:59,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 17:40:59,919 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:40:59,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 17:40:59,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 17:40:59,920 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-10 17:40:59,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:40:59,990 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2022-01-10 17:40:59,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 17:40:59,991 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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) Word has length 11 [2022-01-10 17:40:59,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:40:59,992 INFO L225 Difference]: With dead ends: 42 [2022-01-10 17:40:59,992 INFO L226 Difference]: Without dead ends: 31 [2022-01-10 17:40:59,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-01-10 17:40:59,997 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 35 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:40:59,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 44 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:40:59,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-10 17:41:00,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 19. [2022-01-10 17:41:00,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 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-10 17:41:00,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-01-10 17:41:00,007 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 11 [2022-01-10 17:41:00,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:41:00,007 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-01-10 17:41:00,007 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 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-10 17:41:00,007 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-01-10 17:41:00,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 17:41:00,008 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:41:00,008 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:41:00,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 17:41:00,008 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:41:00,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:41:00,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1667361497, now seen corresponding path program 1 times [2022-01-10 17:41:00,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:41:00,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634866124] [2022-01-10 17:41:00,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:41:00,010 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:41:00,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:41:00,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:41:00,339 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:41:00,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634866124] [2022-01-10 17:41:00,340 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634866124] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:41:00,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249982140] [2022-01-10 17:41:00,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:41:00,341 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:41:00,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:41:00,342 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:41:00,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 17:41:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:41:00,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 35 conjunts are in the unsatisfiable core [2022-01-10 17:41:00,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:41:00,597 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 17:41:00,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:41:00,698 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 23 treesize of output 22 [2022-01-10 17:41:00,739 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:00,748 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-10 17:41:00,748 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-01-10 17:41:00,896 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:00,900 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 17:41:00,900 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 22 treesize of output 14 [2022-01-10 17:41:00,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:41:00,920 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:41:02,163 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (let ((.cse0 (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (and (< 0 .cse0) (<= .cse0 1))))) is different from false [2022-01-10 17:41:04,223 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| Int) (v_ArrVal_65 Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_65)))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (and (<= .cse0 1) (< 0 .cse0)) (= 3 .cse0)))) is different from false [2022-01-10 17:41:05,660 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| Int) (v_ArrVal_65 Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_65)))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5|) 0 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (and (< 0 .cse0) (<= .cse0 1)) (= .cse0 3)))) is different from false [2022-01-10 17:41:05,680 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 829 treesize of output 805 [2022-01-10 17:41:07,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-10 17:41:07,107 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249982140] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:41:07,107 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:41:07,107 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 10] total 26 [2022-01-10 17:41:07,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937039981] [2022-01-10 17:41:07,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:41:07,108 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-10 17:41:07,108 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:41:07,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-10 17:41:07,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=410, Unknown=3, NotChecked=132, Total=650 [2022-01-10 17:41:07,109 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:41:08,295 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 1) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) 1) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| Int) (v_ArrVal_65 Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_65)))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5|) 0 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (and (< 0 .cse0) (<= .cse0 1)) (= .cse0 3))))) is different from false [2022-01-10 17:41:09,405 WARN L838 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) 1) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| Int) (v_ArrVal_65 Int)) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_65)))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_5|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (and (<= .cse0 1) (< 0 .cse0)) (= 3 .cse0)))) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|))) is different from false [2022-01-10 17:41:10,329 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|))) (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (let ((.cse0 (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (and (< 0 .cse0) (<= .cse0 1))))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (= (select .cse1 0) 1) (= (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1))) is different from false [2022-01-10 17:41:10,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:41:10,479 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2022-01-10 17:41:10,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 17:41:10,480 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-10 17:41:10,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:41:10,481 INFO L225 Difference]: With dead ends: 70 [2022-01-10 17:41:10,481 INFO L226 Difference]: Without dead ends: 68 [2022-01-10 17:41:10,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 16 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=142, Invalid=578, Unknown=6, NotChecked=330, Total=1056 [2022-01-10 17:41:10,482 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 90 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 173 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:41:10,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 246 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 194 Invalid, 0 Unknown, 173 Unchecked, 0.1s Time] [2022-01-10 17:41:10,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-10 17:41:10,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 29. [2022-01-10 17:41:10,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:41:10,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-01-10 17:41:10,486 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 16 [2022-01-10 17:41:10,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:41:10,486 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-01-10 17:41:10,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 26 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:41:10,487 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-01-10 17:41:10,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 17:41:10,487 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:41:10,487 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:41:10,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 17:41:10,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:41:10,688 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:41:10,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:41:10,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1667360474, now seen corresponding path program 1 times [2022-01-10 17:41:10,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:41:10,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161128446] [2022-01-10 17:41:10,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:41:10,689 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:41:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:41:10,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:41:10,747 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:41:10,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161128446] [2022-01-10 17:41:10,747 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161128446] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:41:10,747 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:41:10,747 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:41:10,747 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443086479] [2022-01-10 17:41:10,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:41:10,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:41:10,749 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:41:10,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:41:10,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:41:10,750 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:41:10,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:41:10,765 INFO L93 Difference]: Finished difference Result 55 states and 68 transitions. [2022-01-10 17:41:10,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:41:10,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-01-10 17:41:10,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:41:10,766 INFO L225 Difference]: With dead ends: 55 [2022-01-10 17:41:10,766 INFO L226 Difference]: Without dead ends: 41 [2022-01-10 17:41:10,767 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:41:10,769 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 11 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:41:10,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 39 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:41:10,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-10 17:41:10,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-01-10 17:41:10,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:41:10,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2022-01-10 17:41:10,773 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 16 [2022-01-10 17:41:10,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:41:10,773 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2022-01-10 17:41:10,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:41:10,774 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-01-10 17:41:10,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 17:41:10,774 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:41:10,774 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:41:10,774 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 17:41:10,774 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:41:10,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:41:10,775 INFO L85 PathProgramCache]: Analyzing trace with hash -323034325, now seen corresponding path program 1 times [2022-01-10 17:41:10,775 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:41:10,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499631914] [2022-01-10 17:41:10,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:41:10,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:41:10,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:41:10,825 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 17:41:10,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:41:10,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499631914] [2022-01-10 17:41:10,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499631914] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:41:10,825 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:41:10,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:41:10,826 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803840446] [2022-01-10 17:41:10,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:41:10,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:41:10,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:41:10,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:41:10,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:41:10,827 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:41:10,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:41:10,836 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2022-01-10 17:41:10,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:41:10,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-01-10 17:41:10,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:41:10,837 INFO L225 Difference]: With dead ends: 64 [2022-01-10 17:41:10,837 INFO L226 Difference]: Without dead ends: 41 [2022-01-10 17:41:10,837 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:41:10,838 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 7 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:41:10,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 38 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:41:10,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-10 17:41:10,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-01-10 17:41:10,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:41:10,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-01-10 17:41:10,845 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 21 [2022-01-10 17:41:10,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:41:10,845 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-01-10 17:41:10,845 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:41:10,845 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-01-10 17:41:10,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 17:41:10,846 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:41:10,846 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:41:10,846 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 17:41:10,846 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:41:10,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:41:10,847 INFO L85 PathProgramCache]: Analyzing trace with hash -323033302, now seen corresponding path program 1 times [2022-01-10 17:41:10,847 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:41:10,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470202966] [2022-01-10 17:41:10,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:41:10,847 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:41:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:41:11,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:41:11,071 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:41:11,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470202966] [2022-01-10 17:41:11,072 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [470202966] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:41:11,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1678214516] [2022-01-10 17:41:11,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:41:11,073 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:41:11,073 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:41:11,074 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:41:11,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 17:41:11,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:41:11,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 39 conjunts are in the unsatisfiable core [2022-01-10 17:41:11,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:41:11,272 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 17:41:11,279 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 17:41:11,331 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 17:41:11,332 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 67 [2022-01-10 17:41:11,335 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 31 treesize of output 21 [2022-01-10 17:41:11,346 INFO L353 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-01-10 17:41:11,347 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 55 [2022-01-10 17:41:11,354 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 29 treesize of output 17 [2022-01-10 17:41:11,373 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 19 [2022-01-10 17:41:11,380 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 23 treesize of output 11 [2022-01-10 17:41:11,519 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 35 treesize of output 19 [2022-01-10 17:41:11,522 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 14 [2022-01-10 17:41:11,557 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:11,561 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 17:41:11,561 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 22 treesize of output 14 [2022-01-10 17:41:11,578 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:41:11,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:41:11,679 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:41:11,679 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 106 treesize of output 109 [2022-01-10 17:41:11,790 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:41:11,790 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 53 treesize of output 54 [2022-01-10 17:41:11,794 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:41:11,795 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 54 treesize of output 54 [2022-01-10 17:41:11,802 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:41:11,802 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 70 treesize of output 73 [2022-01-10 17:41:11,810 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:41:11,810 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 89 treesize of output 92 [2022-01-10 17:41:11,816 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 45 treesize of output 39 [2022-01-10 17:41:11,820 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 39 treesize of output 33 [2022-01-10 17:41:11,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:41:11,964 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1678214516] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:41:11,964 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:41:11,964 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 25 [2022-01-10 17:41:11,964 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562135889] [2022-01-10 17:41:11,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:41:11,964 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-10 17:41:11,965 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:41:11,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-10 17:41:11,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2022-01-10 17:41:11,965 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:41:12,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:41:12,495 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2022-01-10 17:41:12,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 17:41:12,495 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-01-10 17:41:12,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:41:12,496 INFO L225 Difference]: With dead ends: 64 [2022-01-10 17:41:12,496 INFO L226 Difference]: Without dead ends: 44 [2022-01-10 17:41:12,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=208, Invalid=1052, Unknown=0, NotChecked=0, Total=1260 [2022-01-10 17:41:12,497 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 102 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 17:41:12,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 157 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 235 Invalid, 0 Unknown, 16 Unchecked, 0.2s Time] [2022-01-10 17:41:12,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-01-10 17:41:12,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2022-01-10 17:41:12,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:41:12,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-01-10 17:41:12,500 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 21 [2022-01-10 17:41:12,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:41:12,501 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-01-10 17:41:12,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 25 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:41:12,501 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-01-10 17:41:12,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-10 17:41:12,501 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:41:12,501 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:41:12,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 17:41:12,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-10 17:41:12,715 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:41:12,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:41:12,716 INFO L85 PathProgramCache]: Analyzing trace with hash -2081581010, now seen corresponding path program 1 times [2022-01-10 17:41:12,716 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:41:12,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397080870] [2022-01-10 17:41:12,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:41:12,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:41:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:41:12,921 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:41:12,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:41:12,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397080870] [2022-01-10 17:41:12,921 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397080870] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:41:12,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [542763110] [2022-01-10 17:41:12,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:41:12,921 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:41:12,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:41:12,922 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:41:12,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 17:41:13,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:41:13,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 47 conjunts are in the unsatisfiable core [2022-01-10 17:41:13,042 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:41:13,049 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 17:41:13,114 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 17:41:13,156 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 17:41:13,156 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 13 treesize of output 13 [2022-01-10 17:41:13,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:41:13,207 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-10 17:41:13,246 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 17:41:13,298 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 17:41:13,336 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:13,343 INFO L353 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-01-10 17:41:13,344 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-01-10 17:41:13,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:13,483 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 17:41:13,483 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 22 treesize of output 14 [2022-01-10 17:41:13,505 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:41:13,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:41:14,831 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (let ((.cse0 (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (and (< 0 .cse0) (<= .cse0 1))))) is different from false [2022-01-10 17:41:14,861 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20| Int) (v_ArrVal_246 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_246))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (and (< 0 .cse0) (<= .cse0 1)) (= 3 .cse0)))) is different from false [2022-01-10 17:41:14,888 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20| Int) (v_ArrVal_246 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_246))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20|) 0 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= 3 .cse0) (and (<= .cse0 1) (< 0 .cse0))))) is different from false [2022-01-10 17:41:14,936 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20| Int) (v_ArrVal_243 Int) (v_ArrVal_246 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616) v_ArrVal_243)) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_246))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20|) 0 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (and (< 0 .cse0) (<= .cse0 1))))) is different from false [2022-01-10 17:41:15,079 INFO L353 Elim1Store]: treesize reduction 25, result has 45.7 percent of original size [2022-01-10 17:41:15,079 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 155 treesize of output 85 [2022-01-10 17:41:15,095 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:41:15,095 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 399 treesize of output 397 [2022-01-10 17:41:15,112 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 393 treesize of output 369 [2022-01-10 17:41:15,149 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-01-10 17:41:15,261 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:41:15,262 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 21 treesize of output 25 [2022-01-10 17:41:15,312 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-01-10 17:41:15,337 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:41:15,337 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 21 treesize of output 25 [2022-01-10 17:41:15,391 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-01-10 17:41:15,445 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:15,478 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:41:15,479 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 21 treesize of output 25 [2022-01-10 17:41:15,514 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:15,517 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-10 17:41:15,550 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-01-10 17:41:15,576 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:15,578 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:15,592 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:15,605 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:15,607 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:15,620 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:15,641 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:15,658 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:15,660 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:15,667 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:15,668 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:15,704 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:15,706 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:15,712 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:15,714 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:15,743 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:15,745 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:15,752 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:15,754 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:15,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:15,786 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:15,793 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:15,795 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:15,874 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-01-10 17:41:15,906 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-01-10 17:41:15,943 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:41:15,944 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 29 treesize of output 33 [2022-01-10 17:41:16,056 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:41:16,056 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 29 treesize of output 33 [2022-01-10 17:41:16,131 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-01-10 17:41:16,167 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:16,169 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:16,195 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:16,198 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:16,647 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:41:16,648 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 21 treesize of output 25 [2022-01-10 17:41:16,719 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-01-10 17:41:16,750 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:16,752 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:16,772 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:16,803 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:16,872 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:41:16,873 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 29 treesize of output 33 [2022-01-10 17:41:16,963 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:17,298 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:17,301 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:17,331 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:17,357 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:17,361 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:17,394 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:17,420 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:17,423 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:17,456 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:17,493 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:17,657 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-01-10 17:41:17,796 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:41:17,797 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 240 treesize of output 222 [2022-01-10 17:41:18,168 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-01-10 17:41:18,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [542763110] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:41:18,168 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:41:18,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 33 [2022-01-10 17:41:18,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949279118] [2022-01-10 17:41:18,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:41:18,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-01-10 17:41:18,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:41:18,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-01-10 17:41:18,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=681, Unknown=6, NotChecked=228, Total=1056 [2022-01-10 17:41:18,170 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 33 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 33 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:41:18,237 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 1) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20| Int) (v_ArrVal_246 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_246))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20|) 0 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= 3 .cse0) (and (<= .cse0 1) (< 0 .cse0)))))) is different from false [2022-01-10 17:41:18,240 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20| Int) (v_ArrVal_246 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_246))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20|) 0 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= 3 .cse0) (and (<= .cse0 1) (< 0 .cse0)))))) is different from false [2022-01-10 17:41:18,242 WARN L838 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20| Int) (v_ArrVal_246 (Array Int Int))) (let ((.cse0 (select (select (let ((.cse1 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_246))) (store .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20| (store (select .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_20|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3))) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (and (< 0 .cse0) (<= .cse0 1)) (= 3 .cse0)))) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)) is different from false [2022-01-10 17:41:19,171 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (let ((.cse0 (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (or (= .cse0 3) (and (< 0 .cse0) (<= .cse0 1))))) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)) is different from false [2022-01-10 17:41:19,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:41:19,197 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-01-10 17:41:19,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 17:41:19,197 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 33 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-01-10 17:41:19,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:41:19,197 INFO L225 Difference]: With dead ends: 45 [2022-01-10 17:41:19,197 INFO L226 Difference]: Without dead ends: 43 [2022-01-10 17:41:19,198 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=169, Invalid=723, Unknown=10, NotChecked=504, Total=1406 [2022-01-10 17:41:19,199 INFO L933 BasicCegarLoop]: 9 mSDtfsCounter, 14 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 121 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:41:19,199 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 129 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 102 Invalid, 0 Unknown, 121 Unchecked, 0.1s Time] [2022-01-10 17:41:19,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-10 17:41:19,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-01-10 17:41:19,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.119047619047619) internal successors, (47), 42 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:41:19,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-01-10 17:41:19,202 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 21 [2022-01-10 17:41:19,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:41:19,202 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-01-10 17:41:19,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 1.7272727272727273) internal successors, (57), 33 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:41:19,202 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-01-10 17:41:19,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 17:41:19,203 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:41:19,203 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:41:19,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 17:41:19,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:41:19,424 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:41:19,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:41:19,425 INFO L85 PathProgramCache]: Analyzing trace with hash -711249789, now seen corresponding path program 1 times [2022-01-10 17:41:19,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:41:19,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566934005] [2022-01-10 17:41:19,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:41:19,425 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:41:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:41:19,741 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:41:19,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:41:19,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566934005] [2022-01-10 17:41:19,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [566934005] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:41:19,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181156525] [2022-01-10 17:41:19,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:41:19,742 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:41:19,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:41:19,743 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:41:19,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 17:41:19,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:41:19,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 61 conjunts are in the unsatisfiable core [2022-01-10 17:41:19,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:41:20,006 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 17:41:20,013 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 17:41:20,063 INFO L353 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-01-10 17:41:20,064 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 25 [2022-01-10 17:41:20,071 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 17:41:20,082 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 17:41:20,083 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-01-10 17:41:20,100 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-01-10 17:41:20,218 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 17:41:20,218 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 28 [2022-01-10 17:41:20,223 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-01-10 17:41:20,228 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:20,238 INFO L353 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-01-10 17:41:20,238 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-01-10 17:41:20,368 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 17:41:20,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 71 [2022-01-10 17:41:20,398 INFO L353 Elim1Store]: treesize reduction 32, result has 58.4 percent of original size [2022-01-10 17:41:20,398 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 97 [2022-01-10 17:41:20,430 INFO L353 Elim1Store]: treesize reduction 52, result has 48.5 percent of original size [2022-01-10 17:41:20,431 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 80 [2022-01-10 17:41:20,733 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 15 treesize of output 11 [2022-01-10 17:41:20,750 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 15 treesize of output 11 [2022-01-10 17:41:20,848 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-10 17:41:20,856 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 44 treesize of output 26 [2022-01-10 17:41:20,946 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:20,947 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 81 [2022-01-10 17:41:21,290 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 78 treesize of output 38 [2022-01-10 17:41:21,293 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:21,294 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 17:41:21,295 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 36 [2022-01-10 17:41:21,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:21,482 INFO L353 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-01-10 17:41:21,482 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 25 [2022-01-10 17:41:21,498 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:41:21,498 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:41:23,753 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_339 (Array Int Int))) (let ((.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_339) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse2))) (let ((.cse1 (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) (select (select (store |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_337) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse2)) .cse0))) (or (not (<= 0 .cse0)) (= .cse1 2) (= .cse1 3)))))) (not (= (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)))) is different from false [2022-01-10 17:41:23,851 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_335 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| Int) (v_ArrVal_339 (Array Int Int)) (v_ArrVal_333 (Array Int Int))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616)) (.cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse2 (let ((.cse5 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse4 v_ArrVal_335)))) (store .cse5 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| (store (select .cse5 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3)))) (.cse0 (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse4 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|)) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| v_ArrVal_339) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse3))) (let ((.cse1 (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_333) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| v_ArrVal_337) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse3)) .cse0))) (or (not (<= 0 .cse0)) (= 2 .cse1) (= 3 .cse1) (not (= (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1))))))) is different from false [2022-01-10 17:41:23,978 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_335 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| Int) (v_ArrVal_339 (Array Int Int)) (v_ArrVal_333 (Array Int Int))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616)) (.cse4 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse2 (let ((.cse5 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse4 v_ArrVal_335)))) (store .cse5 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| (store (select .cse5 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31|) 0 3)))) (.cse1 (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse4 0)) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| v_ArrVal_339) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse3))) (let ((.cse0 (select (select .cse2 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_333) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| v_ArrVal_337) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse3)) .cse1))) (or (= .cse0 3) (= .cse0 2) (not (<= 0 .cse1)) (not (= (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1))))))) is different from false [2022-01-10 17:41:24,010 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:41:24,011 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 2623 treesize of output 2490 [2022-01-10 17:41:30,647 INFO L353 Elim1Store]: treesize reduction 92, result has 41.0 percent of original size [2022-01-10 17:41:30,648 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 3 case distinctions, treesize of input 754 treesize of output 544 [2022-01-10 17:41:30,677 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:41:30,678 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 465 treesize of output 358 [2022-01-10 17:41:30,697 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:41:30,698 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 1947 treesize of output 1198 [2022-01-10 17:41:30,725 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 1123 treesize of output 1099 [2022-01-10 17:41:30,736 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 1099 treesize of output 1051 [2022-01-10 17:41:30,771 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:41:30,772 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1243 treesize of output 1228 [2022-01-10 17:41:30,792 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 1132 treesize of output 1090 [2022-01-10 17:41:30,804 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 1071 treesize of output 1047 [2022-01-10 17:41:30,816 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 1047 treesize of output 1041 [2022-01-10 17:41:30,828 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 1041 treesize of output 1029 [2022-01-10 17:41:30,842 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 1029 treesize of output 1017 [2022-01-10 17:41:30,853 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 1017 treesize of output 993 [2022-01-10 17:41:30,867 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 993 treesize of output 981 [2022-01-10 17:41:30,881 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 981 treesize of output 969 [2022-01-10 17:41:30,893 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 969 treesize of output 945 [2022-01-10 17:41:30,906 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 945 treesize of output 921 [2022-01-10 17:41:30,918 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 921 treesize of output 873 [2022-01-10 17:41:32,455 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2022-01-10 17:41:32,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181156525] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:41:32,456 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:41:32,456 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16, 16] total 37 [2022-01-10 17:41:32,456 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419682165] [2022-01-10 17:41:32,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:41:32,456 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-10 17:41:32,456 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:41:32,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-10 17:41:32,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=966, Unknown=24, NotChecked=198, Total=1332 [2022-01-10 17:41:32,457 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 37 states, 37 states have (on average 1.864864864864865) internal successors, (69), 37 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:41:32,640 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (.cse1 (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (.cse9 (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (and (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) 2) (or .cse0 (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (select .cse1 .cse2))) (not .cse0) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (select .cse1 4)) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 1) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_335 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| Int) (v_ArrVal_339 (Array Int Int)) (v_ArrVal_333 (Array Int Int))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616)) (.cse7 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse5 (let ((.cse8 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse7 v_ArrVal_335)))) (store .cse8 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| (store (select .cse8 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31|) 0 3)))) (.cse4 (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse7 0)) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| v_ArrVal_339) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse6))) (let ((.cse3 (select (select .cse5 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_333) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| v_ArrVal_337) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse6)) .cse4))) (or (= .cse3 3) (= .cse3 2) (not (<= 0 .cse4)) (not (= (select (select .cse5 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1))))))) (= (select .cse9 4) 0) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) 1) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| (select .cse9 .cse2)))) is different from false [2022-01-10 17:41:32,646 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (.cse1 (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (.cse9 (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (and (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) 2) (or .cse0 (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (select .cse1 .cse2))) (not .cse0) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt|)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (select .cse1 4)) (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_335 Int) (|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| Int) (v_ArrVal_339 (Array Int Int)) (v_ArrVal_333 (Array Int Int))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616)) (.cse7 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse5 (let ((.cse8 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse7 v_ArrVal_335)))) (store .cse8 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| (store (select .cse8 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31|) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 3)))) (.cse3 (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse7 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|)) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| v_ArrVal_339) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse6))) (let ((.cse4 (select (select .cse5 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_333) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_31| v_ArrVal_337) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse6)) .cse3))) (or (not (<= 0 .cse3)) (= 2 .cse4) (= 3 .cse4) (not (= (select (select .cse5 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1))))))) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| 0) (= (select .cse9 4) 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| (select .cse9 .cse2)))) is different from false [2022-01-10 17:41:34,661 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (.cse9 (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|))) (let ((.cse0 (select .cse9 4)) (.cse3 (select .cse1 4)) (.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (and (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (= 2 (select (select |c_#memory_intInt| .cse0) 0)) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= (select .cse1 .cse2) 0) (= .cse3 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| .cse0)) (forall ((|ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| Int)) (or (forall ((v_ArrVal_337 (Array Int Int)) (v_ArrVal_339 (Array Int Int))) (let ((.cse6 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse4 (select (select (store |c_#memory_$Pointer$.offsetInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_339) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse6))) (let ((.cse5 (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) (select (select (store |c_#memory_$Pointer$.baseInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_337) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse6)) .cse4))) (or (not (<= 0 .cse4)) (= .cse5 2) (= .cse5 3)))))) (not (= (select (select (store |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_intInt| |ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 3)) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)))) (or (and (= .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt|) (= 2 (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 0))) (let ((.cse7 (select .cse9 .cse2))) (let ((.cse8 (select (select |c_#memory_$Pointer$.offsetInt| .cse7) 4))) (and (= 2 (select (select |c_#memory_intInt| .cse7) 0)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| .cse8) (= .cse8 0)))))))) is different from false [2022-01-10 17:41:34,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:41:34,953 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-01-10 17:41:34,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 17:41:34,954 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.864864864864865) internal successors, (69), 37 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-01-10 17:41:34,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:41:34,954 INFO L225 Difference]: With dead ends: 50 [2022-01-10 17:41:34,954 INFO L226 Difference]: Without dead ends: 48 [2022-01-10 17:41:34,955 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=219, Invalid=1496, Unknown=31, NotChecked=510, Total=2256 [2022-01-10 17:41:34,955 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:41:34,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 182 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 176 Invalid, 0 Unknown, 117 Unchecked, 0.1s Time] [2022-01-10 17:41:34,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-01-10 17:41:34,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-01-10 17:41:34,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:41:34,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-01-10 17:41:34,959 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 26 [2022-01-10 17:41:34,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:41:34,959 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-01-10 17:41:34,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.864864864864865) internal successors, (69), 37 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:41:34,959 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-01-10 17:41:34,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 17:41:34,960 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:41:34,960 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:41:34,981 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-10 17:41:35,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:41:35,179 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:41:35,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:41:35,179 INFO L85 PathProgramCache]: Analyzing trace with hash -672846138, now seen corresponding path program 2 times [2022-01-10 17:41:35,179 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:41:35,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377303935] [2022-01-10 17:41:35,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:41:35,180 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:41:35,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:41:35,471 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:41:35,471 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:41:35,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377303935] [2022-01-10 17:41:35,471 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377303935] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:41:35,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838723912] [2022-01-10 17:41:35,471 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 17:41:35,472 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:41:35,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:41:35,473 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:41:35,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-10 17:41:35,625 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 17:41:35,625 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 17:41:35,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 54 conjunts are in the unsatisfiable core [2022-01-10 17:41:35,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:41:35,634 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 17:41:35,691 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 17:41:35,733 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 17:41:35,733 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 19 treesize of output 23 [2022-01-10 17:41:35,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:41:35,787 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-01-10 17:41:35,847 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 17:41:35,873 INFO L353 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-01-10 17:41:35,873 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 35 [2022-01-10 17:41:35,939 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 17:41:36,028 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 17:41:36,058 INFO L353 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-01-10 17:41:36,059 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 3 case distinctions, treesize of input 23 treesize of output 27 [2022-01-10 17:41:36,100 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 17:41:36,133 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 17:41:36,162 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 17:41:36,174 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:41:36,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:41:36,213 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_457 (Array Int Int))) (< 0 (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_457) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|))) (forall ((v_ArrVal_457 (Array Int Int))) (<= (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_457) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1))) is different from false [2022-01-10 17:41:36,224 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (<= (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_456) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_457) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)) (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_456) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_457) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)))) is different from false [2022-01-10 17:41:36,346 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| Int)) (or (not (<= (mod (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14|) 2) 0)) (and (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_451) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_456) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| v_ArrVal_457) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)) (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (< 0 (select (select (store (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_451) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_456) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| v_ArrVal_457) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)))))) is different from false [2022-01-10 17:41:37,281 INFO L353 Elim1Store]: treesize reduction 50, result has 45.1 percent of original size [2022-01-10 17:41:37,282 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 74 [2022-01-10 17:41:37,309 INFO L353 Elim1Store]: treesize reduction 12, result has 69.2 percent of original size [2022-01-10 17:41:37,310 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 536 treesize of output 534 [2022-01-10 17:41:37,365 INFO L353 Elim1Store]: treesize reduction 12, result has 69.2 percent of original size [2022-01-10 17:41:37,366 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 752 treesize of output 758 [2022-01-10 17:41:37,384 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 689 treesize of output 673 [2022-01-10 17:41:37,396 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 673 treesize of output 665 [2022-01-10 17:41:37,405 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 665 treesize of output 661 [2022-01-10 17:41:37,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 661 treesize of output 653 [2022-01-10 17:41:37,424 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 653 treesize of output 621 [2022-01-10 17:41:37,434 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 621 treesize of output 605 [2022-01-10 17:41:39,077 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-01-10 17:41:39,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838723912] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:41:39,077 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:41:39,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 35 [2022-01-10 17:41:39,077 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036302865] [2022-01-10 17:41:39,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:41:39,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-10 17:41:39,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:41:39,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-10 17:41:39,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=802, Unknown=13, NotChecked=186, Total=1190 [2022-01-10 17:41:39,079 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 35 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:41:39,178 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (<= (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_456) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_457) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt|) 1) (<= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt|)) (<= 0 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) 1) (= (select (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1) (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| Int)) (or (not (<= (mod (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14|) 2) 0)) (and (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (<= (select (select (store (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_451) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_456) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| v_ArrVal_457) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) 1)) (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_451 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (< 0 (select (select (store (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_451) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_456) |v_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt_14| v_ArrVal_457) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)))))) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|)) (= (select |c_#validInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) 1) (forall ((v_ArrVal_457 (Array Int Int)) (v_ArrVal_456 (Array Int Int))) (< 0 (select (select (store (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| v_ArrVal_456) |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.baseInt| v_ArrVal_457) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|)))) is different from false [2022-01-10 17:41:39,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:41:39,275 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-01-10 17:41:39,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 17:41:39,276 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 35 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-01-10 17:41:39,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:41:39,276 INFO L225 Difference]: With dead ends: 55 [2022-01-10 17:41:39,276 INFO L226 Difference]: Without dead ends: 53 [2022-01-10 17:41:39,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=222, Invalid=970, Unknown=14, NotChecked=276, Total=1482 [2022-01-10 17:41:39,277 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 31 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 135 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:41:39,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 139 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 122 Invalid, 0 Unknown, 135 Unchecked, 0.1s Time] [2022-01-10 17:41:39,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-01-10 17:41:39,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2022-01-10 17:41:39,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:41:39,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-01-10 17:41:39,281 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 26 [2022-01-10 17:41:39,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:41:39,281 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-01-10 17:41:39,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 35 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:41:39,281 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-01-10 17:41:39,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-01-10 17:41:39,282 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:41:39,282 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:41:39,305 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-10 17:41:39,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:41:39,482 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 17:41:39,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:41:39,483 INFO L85 PathProgramCache]: Analyzing trace with hash 2042134863, now seen corresponding path program 1 times [2022-01-10 17:41:39,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:41:39,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493924316] [2022-01-10 17:41:39,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:41:39,483 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:41:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:41:39,920 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:41:39,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:41:39,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493924316] [2022-01-10 17:41:39,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493924316] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:41:39,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [376433657] [2022-01-10 17:41:39,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:41:39,920 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:41:39,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:41:39,921 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:41:39,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-10 17:41:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:41:40,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 67 conjunts are in the unsatisfiable core [2022-01-10 17:41:40,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:41:40,163 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 17:41:40,238 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 17:41:40,238 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 13 treesize of output 13 [2022-01-10 17:41:40,282 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 17:41:40,289 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 17:41:40,342 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 17:41:40,343 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 33 [2022-01-10 17:41:40,346 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-01-10 17:41:40,367 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 17:41:40,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 30 [2022-01-10 17:41:40,456 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:40,462 INFO L353 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-01-10 17:41:40,462 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 145 treesize of output 99 [2022-01-10 17:41:40,465 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 75 [2022-01-10 17:41:40,551 INFO L353 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-01-10 17:41:40,552 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 183 treesize of output 166 [2022-01-10 17:41:40,572 INFO L353 Elim1Store]: treesize reduction 32, result has 49.2 percent of original size [2022-01-10 17:41:40,572 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 176 treesize of output 176 [2022-01-10 17:41:40,577 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 47 treesize of output 31 [2022-01-10 17:41:40,598 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 47 treesize of output 23 [2022-01-10 17:41:40,613 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 35 [2022-01-10 17:41:40,631 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 61 treesize of output 37 [2022-01-10 17:41:40,650 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 76 treesize of output 40 [2022-01-10 17:41:40,682 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 76 treesize of output 40 [2022-01-10 17:41:40,722 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 103 treesize of output 73 [2022-01-10 17:41:40,779 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 64 treesize of output 34 [2022-01-10 17:41:41,816 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:41,818 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-10 17:41:41,818 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 83 [2022-01-10 17:41:41,822 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-10 17:41:41,822 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 31 [2022-01-10 17:41:41,872 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:41:41,881 INFO L353 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-01-10 17:41:41,882 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 25 [2022-01-10 17:41:41,899 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:41:41,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:41:42,272 INFO L353 Elim1Store]: treesize reduction 33, result has 84.3 percent of original size [2022-01-10 17:41:42,273 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 522 treesize of output 528 [2022-01-10 17:41:45,726 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53| Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse6 (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse8 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|)) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53| v_ArrVal_543)) (.cse7 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse7)) (.cse4 (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse8 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53|)) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53| v_ArrVal_542))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse7)) (.cse5 (mod (+ .cse2 4) 18446744073709551616))) (let ((.cse1 (select (select .cse6 .cse3) .cse5)) (.cse0 (select (select .cse4 .cse3) .cse5))) (or (and (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| .cse0) (= .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= .cse1 .cse2) (= .cse3 .cse0)) (and (= |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53|)) (and (= .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|) (= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53| .cse3)) (and (= .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~t~0#1.offsetInt|) (= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53| .cse0))))))))) is different from false [2022-01-10 17:41:53,404 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53| Int) (v_ArrVal_542 (Array Int Int)) (v_ArrVal_543 (Array Int Int))) (let ((.cse8 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse4 (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse8 0)) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53| v_ArrVal_543)) (.cse7 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 4) 18446744073709551616))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse7)) (.cse6 (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt|) .cse8 |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53|)) |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53| v_ArrVal_542))) (let ((.cse1 (select (select .cse6 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt|) .cse7)) (.cse5 (mod (+ .cse0 4) 18446744073709551616))) (let ((.cse3 (select (select .cse6 .cse1) .cse5)) (.cse2 (select (select .cse4 .cse1) .cse5))) (or (and (= .cse0 0) (= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53| .cse1)) (and (= .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt|) (= .cse1 .cse3) (= .cse2 .cse0) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| .cse3)) (and (= |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53| .cse3) (= .cse2 0)) (and (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.baseInt| |v_ULTIMATE.start_ULTIMATE.start_main_~p~0#1.baseInt_53|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~a~0#1.offsetInt| 0))))))))) is different from false [2022-01-10 17:41:53,424 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:41:53,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 490 treesize of output 423 [2022-01-10 17:41:53,431 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:41:53,431 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 413 treesize of output 346