/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-buckets-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 05:23:04,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 05:23:04,148 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 05:23:04,221 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 05:23:04,222 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 05:23:04,223 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 05:23:04,224 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 05:23:04,226 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 05:23:04,227 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 05:23:04,227 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 05:23:04,228 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 05:23:04,229 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 05:23:04,229 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 05:23:04,230 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 05:23:04,231 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 05:23:04,232 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 05:23:04,233 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 05:23:04,233 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 05:23:04,235 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 05:23:04,236 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 05:23:04,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 05:23:04,239 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 05:23:04,240 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 05:23:04,241 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 05:23:04,243 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 05:23:04,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 05:23:04,244 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 05:23:04,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 05:23:04,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 05:23:04,245 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 05:23:04,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 05:23:04,246 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 05:23:04,247 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 05:23:04,247 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 05:23:04,248 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 05:23:04,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 05:23:04,249 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 05:23:04,249 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 05:23:04,250 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 05:23:04,250 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 05:23:04,251 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 05:23:04,252 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 05:23:04,270 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 05:23:04,270 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 05:23:04,270 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 05:23:04,271 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 05:23:04,272 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 05:23:04,272 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 05:23:04,272 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 05:23:04,272 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 05:23:04,272 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 05:23:04,273 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 05:23:04,273 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 05:23:04,273 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 05:23:04,273 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 05:23:04,273 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 05:23:04,274 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 05:23:04,274 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 05:23:04,274 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 05:23:04,274 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 05:23:04,274 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 05:23:04,274 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 05:23:04,274 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 05:23:04,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:23:04,275 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 05:23:04,275 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 05:23:04,275 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 05:23:04,275 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 05:23:04,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 05:23:04,275 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 05:23:04,276 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 05:23:04,276 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 05:23:04,276 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 05:23:04,276 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 05:23:04,277 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 05:23:04,277 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-11 05:23:04,473 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 05:23:04,490 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 05:23:04,492 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 05:23:04,493 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 05:23:04,494 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 05:23:04,495 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-buckets-2.i [2022-01-11 05:23:04,563 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e869d361/d0bbe35d6f4142459185cd472e9f01a7/FLAG56a575138 [2022-01-11 05:23:04,982 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 05:23:04,982 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets-2.i [2022-01-11 05:23:04,993 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e869d361/d0bbe35d6f4142459185cd472e9f01a7/FLAG56a575138 [2022-01-11 05:23:05,350 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e869d361/d0bbe35d6f4142459185cd472e9f01a7 [2022-01-11 05:23:05,352 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 05:23:05,353 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 05:23:05,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 05:23:05,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 05:23:05,360 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 05:23:05,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:23:05" (1/1) ... [2022-01-11 05:23:05,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2101d84d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:23:05, skipping insertion in model container [2022-01-11 05:23:05,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:23:05" (1/1) ... [2022-01-11 05:23:05,368 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 05:23:05,419 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 05:23:05,680 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets-2.i[22663,22676] [2022-01-11 05:23:05,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets-2.i[22734,22747] [2022-01-11 05:23:05,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets-2.i[22862,22875] [2022-01-11 05:23:05,692 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets-2.i[23275,23288] [2022-01-11 05:23:05,693 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets-2.i[23364,23377] [2022-01-11 05:23:05,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:23:05,711 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 05:23:05,760 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets-2.i[22663,22676] [2022-01-11 05:23:05,761 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets-2.i[22734,22747] [2022-01-11 05:23:05,761 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets-2.i[22862,22875] [2022-01-11 05:23:05,764 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets-2.i[23275,23288] [2022-01-11 05:23:05,765 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-buckets-2.i[23364,23377] [2022-01-11 05:23:05,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:23:05,793 INFO L208 MainTranslator]: Completed translation [2022-01-11 05:23:05,793 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:23:05 WrapperNode [2022-01-11 05:23:05,794 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 05:23:05,795 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 05:23:05,795 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 05:23:05,795 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 05:23:05,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:23:05" (1/1) ... [2022-01-11 05:23:05,832 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:23:05" (1/1) ... [2022-01-11 05:23:05,855 INFO L137 Inliner]: procedures = 122, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 153 [2022-01-11 05:23:05,855 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 05:23:05,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 05:23:05,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 05:23:05,856 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 05:23:05,862 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:23:05" (1/1) ... [2022-01-11 05:23:05,862 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:23:05" (1/1) ... [2022-01-11 05:23:05,865 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:23:05" (1/1) ... [2022-01-11 05:23:05,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:23:05" (1/1) ... [2022-01-11 05:23:05,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:23:05" (1/1) ... [2022-01-11 05:23:05,876 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:23:05" (1/1) ... [2022-01-11 05:23:05,878 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:23:05" (1/1) ... [2022-01-11 05:23:05,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 05:23:05,881 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 05:23:05,881 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 05:23:05,881 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 05:23:05,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:23:05" (1/1) ... [2022-01-11 05:23:05,899 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:23:05,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:23:05,918 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-11 05:23:05,920 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-11 05:23:05,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-11 05:23:05,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-11 05:23:05,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 05:23:05,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-11 05:23:05,944 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-11 05:23:05,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-11 05:23:05,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-11 05:23:05,945 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 05:23:05,945 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 05:23:05,945 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 05:23:06,063 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 05:23:06,064 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 05:23:08,132 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 05:23:08,137 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 05:23:08,138 INFO L299 CfgBuilder]: Removed 15 assume(true) statements. [2022-01-11 05:23:08,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:23:08 BoogieIcfgContainer [2022-01-11 05:23:08,139 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 05:23:08,140 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 05:23:08,140 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 05:23:08,141 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 05:23:08,144 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:23:08" (1/1) ... [2022-01-11 05:23:08,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:23:08 BasicIcfg [2022-01-11 05:23:08,221 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 05:23:08,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 05:23:08,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 05:23:08,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 05:23:08,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 05:23:05" (1/4) ... [2022-01-11 05:23:08,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@309e367c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:23:08, skipping insertion in model container [2022-01-11 05:23:08,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:23:05" (2/4) ... [2022-01-11 05:23:08,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@309e367c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:23:08, skipping insertion in model container [2022-01-11 05:23:08,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:23:08" (3/4) ... [2022-01-11 05:23:08,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@309e367c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 05:23:08, skipping insertion in model container [2022-01-11 05:23:08,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:23:08" (4/4) ... [2022-01-11 05:23:08,228 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-buckets-2.iTransformedIcfg [2022-01-11 05:23:08,232 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 05:23:08,232 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-01-11 05:23:08,270 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 05:23:08,278 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-11 05:23:08,278 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-11 05:23:08,289 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 42 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:08,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-01-11 05:23:08,293 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:23:08,294 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:23:08,294 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:23:08,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:23:08,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1569803515, now seen corresponding path program 1 times [2022-01-11 05:23:08,306 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:23:08,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471965388] [2022-01-11 05:23:08,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:23:08,307 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:23:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:23:08,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:08,604 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:23:08,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471965388] [2022-01-11 05:23:08,605 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471965388] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:23:08,605 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:23:08,605 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 05:23:08,607 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273723226] [2022-01-11 05:23:08,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:23:08,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 05:23:08,611 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:23:08,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 05:23:08,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 05:23:08,635 INFO L87 Difference]: Start difference. First operand has 43 states, 37 states have (on average 1.8918918918918919) internal successors, (70), 42 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:08,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:23:08,765 INFO L93 Difference]: Finished difference Result 109 states and 185 transitions. [2022-01-11 05:23:08,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 05:23:08,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2022-01-11 05:23:08,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:23:08,773 INFO L225 Difference]: With dead ends: 109 [2022-01-11 05:23:08,773 INFO L226 Difference]: Without dead ends: 64 [2022-01-11 05:23:08,777 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 05:23:08,785 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 90 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:23:08,786 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 82 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:23:08,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-11 05:23:08,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 40. [2022-01-11 05:23:08,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 36 states have (on average 1.3333333333333333) internal successors, (48), 39 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:08,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2022-01-11 05:23:08,824 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 7 [2022-01-11 05:23:08,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:23:08,824 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2022-01-11 05:23:08,825 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:08,825 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2022-01-11 05:23:08,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-01-11 05:23:08,825 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:23:08,825 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:23:08,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 05:23:08,826 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:23:08,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:23:08,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1448854057, now seen corresponding path program 1 times [2022-01-11 05:23:08,829 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:23:08,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365484411] [2022-01-11 05:23:08,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:23:08,830 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:23:08,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:23:08,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:08,955 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:23:08,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365484411] [2022-01-11 05:23:08,955 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365484411] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:23:08,955 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:23:08,955 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:23:08,956 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309758780] [2022-01-11 05:23:08,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:23:08,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:23:08,957 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:23:08,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:23:08,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:23:08,958 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:08,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:23:08,997 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-01-11 05:23:08,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:23:08,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2022-01-11 05:23:08,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:23:08,999 INFO L225 Difference]: With dead ends: 43 [2022-01-11 05:23:09,000 INFO L226 Difference]: Without dead ends: 41 [2022-01-11 05:23:09,001 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:23:09,004 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 6 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:23:09,005 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 66 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:23:09,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-11 05:23:09,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-01-11 05:23:09,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.3142857142857143) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:09,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-01-11 05:23:09,019 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 8 [2022-01-11 05:23:09,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:23:09,020 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-01-11 05:23:09,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:09,020 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-01-11 05:23:09,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-11 05:23:09,021 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:23:09,022 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:23:09,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 05:23:09,022 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:23:09,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:23:09,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1964770742, now seen corresponding path program 1 times [2022-01-11 05:23:09,023 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:23:09,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212576137] [2022-01-11 05:23:09,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:23:09,024 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:23:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:23:09,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:09,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:23:09,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212576137] [2022-01-11 05:23:09,457 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212576137] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:23:09,457 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:23:09,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 05:23:09,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228184330] [2022-01-11 05:23:09,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:23:09,462 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 05:23:09,462 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:23:09,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 05:23:09,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 05:23:09,464 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:09,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:23:09,702 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2022-01-11 05:23:09,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 05:23:09,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-01-11 05:23:09,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:23:09,704 INFO L225 Difference]: With dead ends: 58 [2022-01-11 05:23:09,704 INFO L226 Difference]: Without dead ends: 47 [2022-01-11 05:23:09,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 05:23:09,705 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 13 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 05:23:09,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 96 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 05:23:09,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-11 05:23:09,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2022-01-11 05:23:09,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 41 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 51 transitions. [2022-01-11 05:23:09,712 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 51 transitions. Word has length 9 [2022-01-11 05:23:09,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:23:09,712 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 51 transitions. [2022-01-11 05:23:09,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:09,712 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 51 transitions. [2022-01-11 05:23:09,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-01-11 05:23:09,713 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:23:09,713 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:23:09,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 05:23:09,713 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:23:09,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:23:09,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1047618665, now seen corresponding path program 1 times [2022-01-11 05:23:09,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:23:09,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220294598] [2022-01-11 05:23:09,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:23:09,714 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:23:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:23:09,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:09,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:23:09,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220294598] [2022-01-11 05:23:09,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220294598] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:23:09,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:23:09,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:23:09,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970415031] [2022-01-11 05:23:09,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:23:09,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:23:09,758 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:23:09,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:23:09,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:23:09,759 INFO L87 Difference]: Start difference. First operand 42 states and 51 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:09,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:23:09,870 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-01-11 05:23:09,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:23:09,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-01-11 05:23:09,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:23:09,871 INFO L225 Difference]: With dead ends: 43 [2022-01-11 05:23:09,883 INFO L226 Difference]: Without dead ends: 41 [2022-01-11 05:23:09,883 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:23:09,884 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 21 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:23:09,884 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 48 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:23:09,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-11 05:23:09,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2022-01-11 05:23:09,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 38 states have (on average 1.2894736842105263) internal successors, (49), 39 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:09,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-01-11 05:23:09,890 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 9 [2022-01-11 05:23:09,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:23:09,891 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-01-11 05:23:09,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:09,896 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-01-11 05:23:09,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-11 05:23:09,897 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:23:09,897 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:23:09,897 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 05:23:09,897 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:23:09,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:23:09,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1908180240, now seen corresponding path program 1 times [2022-01-11 05:23:09,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:23:09,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396064485] [2022-01-11 05:23:09,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:23:09,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:23:10,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:23:10,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:10,338 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:23:10,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396064485] [2022-01-11 05:23:10,339 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396064485] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:23:10,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939680342] [2022-01-11 05:23:10,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:23:10,339 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:23:10,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:23:10,344 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:23:10,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-11 05:23:10,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:23:10,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 91 conjunts are in the unsatisfiable core [2022-01-11 05:23:10,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:23:10,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:10,698 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 40 [2022-01-11 05:23:10,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:10,708 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 44 [2022-01-11 05:23:10,757 INFO L353 Elim1Store]: treesize reduction 54, result has 31.6 percent of original size [2022-01-11 05:23:10,758 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 2 case distinctions, treesize of input 71 treesize of output 80 [2022-01-11 05:23:10,768 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:10,803 INFO L353 Elim1Store]: treesize reduction 36, result has 44.6 percent of original size [2022-01-11 05:23:10,803 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 2 case distinctions, treesize of input 42 treesize of output 54 [2022-01-11 05:23:10,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2022-01-11 05:23:10,826 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2022-01-11 05:23:10,848 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-11 05:23:10,861 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2022-01-11 05:23:10,875 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 19 [2022-01-11 05:23:10,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:10,927 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-11 05:23:10,983 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 46 treesize of output 34 [2022-01-11 05:23:11,119 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2022-01-11 05:23:11,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:11,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:11,802 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:11,803 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:11,889 INFO L353 Elim1Store]: treesize reduction 252, result has 11.9 percent of original size [2022-01-11 05:23:11,890 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 1 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 228 treesize of output 229 [2022-01-11 05:23:11,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:11,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:11,903 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:11,903 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:12,089 INFO L353 Elim1Store]: treesize reduction 188, result has 25.7 percent of original size [2022-01-11 05:23:12,089 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 1 disjoint index pairs (out of 45 index pairs), introduced 13 new quantified variables, introduced 49 case distinctions, treesize of input 255 treesize of output 251 [2022-01-11 05:23:15,515 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:15,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:15,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:15,519 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:15,521 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:15,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:15,643 INFO L353 Elim1Store]: treesize reduction 48, result has 69.2 percent of original size [2022-01-11 05:23:15,643 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 2 disjoint index pairs (out of 45 index pairs), introduced 13 new quantified variables, introduced 44 case distinctions, treesize of input 222 treesize of output 218 [2022-01-11 05:23:15,659 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:15,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:15,661 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:15,763 INFO L353 Elim1Store]: treesize reduction 121, result has 36.0 percent of original size [2022-01-11 05:23:15,764 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 10 new quantified variables, introduced 36 case distinctions, treesize of input 236 treesize of output 262 [2022-01-11 05:23:16,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:16,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:23:17,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:17,365 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939680342] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:23:17,365 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:23:17,365 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2022-01-11 05:23:17,365 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814035081] [2022-01-11 05:23:17,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:23:17,366 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-11 05:23:17,366 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:23:17,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-11 05:23:17,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2022-01-11 05:23:17,367 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:18,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:23:18,130 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2022-01-11 05:23:18,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-11 05:23:18,131 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-01-11 05:23:18,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:23:18,131 INFO L225 Difference]: With dead ends: 57 [2022-01-11 05:23:18,131 INFO L226 Difference]: Without dead ends: 46 [2022-01-11 05:23:18,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2022-01-11 05:23:18,133 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 9 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:23:18,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 214 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 48 Unchecked, 0.1s Time] [2022-01-11 05:23:18,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-01-11 05:23:18,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2022-01-11 05:23:18,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 43 states have (on average 1.255813953488372) internal successors, (54), 44 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:18,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2022-01-11 05:23:18,139 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 14 [2022-01-11 05:23:18,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:23:18,139 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2022-01-11 05:23:18,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.8823529411764706) internal successors, (32), 17 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:18,140 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2022-01-11 05:23:18,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-11 05:23:18,140 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:23:18,140 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:23:18,159 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-11 05:23:18,347 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:23:18,348 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:23:18,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:23:18,348 INFO L85 PathProgramCache]: Analyzing trace with hash -732414666, now seen corresponding path program 1 times [2022-01-11 05:23:18,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:23:18,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981846924] [2022-01-11 05:23:18,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:23:18,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:23:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:23:18,529 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:18,530 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:23:18,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981846924] [2022-01-11 05:23:18,530 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981846924] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:23:18,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741351330] [2022-01-11 05:23:18,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:23:18,530 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:23:18,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:23:18,531 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:23:18,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-11 05:23:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:23:18,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-11 05:23:18,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:23:18,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:18,726 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2022-01-11 05:23:18,757 INFO L353 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-01-11 05:23:18,757 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 2 case distinctions, treesize of input 88 treesize of output 85 [2022-01-11 05:23:18,795 INFO L353 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-01-11 05:23:18,796 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 84 treesize of output 77 [2022-01-11 05:23:18,810 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-01-11 05:23:18,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:18,898 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-11 05:23:18,898 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 88 treesize of output 66 [2022-01-11 05:23:18,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:18,922 INFO L353 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-01-11 05:23:18,923 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 40 [2022-01-11 05:23:19,004 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-11 05:23:19,005 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 86 treesize of output 64 [2022-01-11 05:23:19,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:19,247 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:19,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:19,261 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-01-11 05:23:19,261 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 33 [2022-01-11 05:23:19,279 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:19,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:23:19,409 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_678 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~bcki~0#1.offsetInt_7| Int)) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| v_ArrVal_678) |c_ULTIMATE.start_ULTIMATE.start_main_~bucket~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~bcki~0#1.offsetInt_7|))) (or (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~bcki~0#1.offsetInt_7|)) (not (<= 0 .cse0)) (<= 1 .cse0) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~bcki~0#1.offsetInt_7| |c_ULTIMATE.start_ULTIMATE.start_main_~bucket~0#1.offsetInt|))))) is different from false [2022-01-11 05:23:19,503 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt_6| Int) (v_ArrVal_678 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~bcki~0#1.offsetInt_7| Int)) (let ((.cse0 (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt_6|)) (.cse1 (select (select (store |c_#memory_$Pointer$.baseInt| |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt_6| v_ArrVal_678) |c_ULTIMATE.start_ULTIMATE.start_main_~bucket~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~bcki~0#1.offsetInt_7|))) (or (not (<= 0 .cse0)) (<= 1 .cse1) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~bcki~0#1.offsetInt_7|)) (not (<= .cse0 0)) (not (<= 0 .cse1)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~bcki~0#1.offsetInt_7| |c_ULTIMATE.start_ULTIMATE.start_main_~bucket~0#1.offsetInt|))))) is different from false [2022-01-11 05:23:19,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:19,545 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741351330] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:23:19,545 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:23:19,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 14 [2022-01-11 05:23:19,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068096723] [2022-01-11 05:23:19,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:23:19,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-11 05:23:19,546 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:23:19,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-11 05:23:19,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=101, Unknown=2, NotChecked=42, Total=182 [2022-01-11 05:23:19,546 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:19,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:23:19,899 INFO L93 Difference]: Finished difference Result 71 states and 89 transitions. [2022-01-11 05:23:19,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 05:23:19,901 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-01-11 05:23:19,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:23:19,902 INFO L225 Difference]: With dead ends: 71 [2022-01-11 05:23:19,902 INFO L226 Difference]: Without dead ends: 69 [2022-01-11 05:23:19,902 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=149, Unknown=2, NotChecked=54, Total=272 [2022-01-11 05:23:19,903 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 22 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 05:23:19,903 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 194 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 105 Invalid, 0 Unknown, 156 Unchecked, 0.2s Time] [2022-01-11 05:23:19,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-01-11 05:23:19,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 54. [2022-01-11 05:23:19,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 53 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:19,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2022-01-11 05:23:19,909 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 15 [2022-01-11 05:23:19,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:23:19,909 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2022-01-11 05:23:19,909 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:19,909 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2022-01-11 05:23:19,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-11 05:23:19,910 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:23:19,910 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:23:19,937 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-11 05:23:20,110 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-11 05:23:20,111 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:23:20,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:23:20,111 INFO L85 PathProgramCache]: Analyzing trace with hash 524772707, now seen corresponding path program 2 times [2022-01-11 05:23:20,111 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:23:20,112 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309359786] [2022-01-11 05:23:20,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:23:20,112 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:23:20,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:23:20,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 05:23:20,458 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:23:20,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309359786] [2022-01-11 05:23:20,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309359786] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:23:20,458 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:23:20,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-11 05:23:20,458 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704777459] [2022-01-11 05:23:20,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:23:20,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-11 05:23:20,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:23:20,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-11 05:23:20,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-11 05:23:20,460 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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-11 05:23:21,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:23:21,149 INFO L93 Difference]: Finished difference Result 133 states and 164 transitions. [2022-01-11 05:23:21,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 05:23:21,149 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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 17 [2022-01-11 05:23:21,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:23:21,150 INFO L225 Difference]: With dead ends: 133 [2022-01-11 05:23:21,150 INFO L226 Difference]: Without dead ends: 99 [2022-01-11 05:23:21,150 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-01-11 05:23:21,151 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 87 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-11 05:23:21,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 143 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-01-11 05:23:21,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-01-11 05:23:21,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 67. [2022-01-11 05:23:21,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 66 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:21,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2022-01-11 05:23:21,160 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 17 [2022-01-11 05:23:21,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:23:21,160 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2022-01-11 05:23:21,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 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-11 05:23:21,160 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2022-01-11 05:23:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-11 05:23:21,161 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:23:21,161 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:23:21,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-11 05:23:21,161 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:23:21,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:23:21,161 INFO L85 PathProgramCache]: Analyzing trace with hash -899466644, now seen corresponding path program 1 times [2022-01-11 05:23:21,162 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:23:21,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250766444] [2022-01-11 05:23:21,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:23:21,162 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:23:21,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:23:21,464 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:21,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:23:21,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250766444] [2022-01-11 05:23:21,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [250766444] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:23:21,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541906610] [2022-01-11 05:23:21,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:23:21,465 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:23:21,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:23:21,466 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:23:21,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-11 05:23:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:23:21,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 66 conjunts are in the unsatisfiable core [2022-01-11 05:23:21,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:23:21,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:21,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2022-01-11 05:23:21,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:21,686 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 32 [2022-01-11 05:23:21,719 INFO L353 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-01-11 05:23:21,719 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 2 case distinctions, treesize of input 78 treesize of output 77 [2022-01-11 05:23:21,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:21,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:21,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:21,732 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-01-11 05:23:21,779 INFO L353 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-01-11 05:23:21,779 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 48 [2022-01-11 05:23:21,792 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-01-11 05:23:21,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:21,893 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-11 05:23:21,894 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 67 treesize of output 53 [2022-01-11 05:23:21,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:21,916 INFO L353 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-01-11 05:23:21,916 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 25 [2022-01-11 05:23:21,935 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 25 treesize of output 25 [2022-01-11 05:23:22,038 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 25 treesize of output 25 [2022-01-11 05:23:22,055 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-11 05:23:22,056 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 66 treesize of output 52 [2022-01-11 05:23:22,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:22,416 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:22,417 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2022-01-11 05:23:22,584 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:22,585 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:22,606 INFO L353 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-01-11 05:23:22,607 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 63 treesize of output 35 [2022-01-11 05:23:22,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:22,626 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:23:22,749 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~bcki~0#1.offsetInt_13| Int) (v_ArrVal_950 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~bcki~0#1.offsetInt_13|)) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| v_ArrVal_951))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~bucket~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~bcki~0#1.offsetInt_13|))) (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| v_ArrVal_950) |c_ULTIMATE.start_ULTIMATE.start_main_~bucket~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~bcki~0#1.offsetInt_13|)) 0)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~bcki~0#1.offsetInt_13| |c_ULTIMATE.start_ULTIMATE.start_main_~bucket~0#1.offsetInt|)))) is different from false [2022-01-11 05:23:22,815 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt_8| Int) (v_ArrVal_951 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~bcki~0#1.offsetInt_13| Int) (v_ArrVal_950 (Array Int Int))) (let ((.cse0 (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt_8|))) (or (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~bcki~0#1.offsetInt_13|)) (not (<= .cse0 0)) (not (= (select (let ((.cse1 (store |c_#memory_$Pointer$.baseInt| |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt_8| v_ArrVal_951))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~bucket~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~bcki~0#1.offsetInt_13|))) (select (select (store |c_#memory_$Pointer$.offsetInt| |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt_8| v_ArrVal_950) |c_ULTIMATE.start_ULTIMATE.start_main_~bucket~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~bcki~0#1.offsetInt_13|)) 0)) (not (<= 0 .cse0)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~bcki~0#1.offsetInt_13| |c_ULTIMATE.start_ULTIMATE.start_main_~bucket~0#1.offsetInt|))))) is different from false [2022-01-11 05:23:22,856 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:22,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541906610] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:23:22,857 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:23:22,857 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2022-01-11 05:23:22,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788473914] [2022-01-11 05:23:22,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:23:22,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-11 05:23:22,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:23:22,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-11 05:23:22,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=169, Unknown=2, NotChecked=54, Total=272 [2022-01-11 05:23:22,858 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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-11 05:23:23,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:23:23,430 INFO L93 Difference]: Finished difference Result 109 states and 132 transitions. [2022-01-11 05:23:23,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-11 05:23:23,430 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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 18 [2022-01-11 05:23:23,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:23:23,431 INFO L225 Difference]: With dead ends: 109 [2022-01-11 05:23:23,431 INFO L226 Difference]: Without dead ends: 107 [2022-01-11 05:23:23,432 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=258, Unknown=2, NotChecked=70, Total=420 [2022-01-11 05:23:23,432 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 60 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 196 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 05:23:23,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 237 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 157 Invalid, 0 Unknown, 196 Unchecked, 0.3s Time] [2022-01-11 05:23:23,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-01-11 05:23:23,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 69. [2022-01-11 05:23:23,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 67 states have (on average 1.2686567164179106) internal successors, (85), 68 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:23,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2022-01-11 05:23:23,441 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 18 [2022-01-11 05:23:23,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:23:23,441 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2022-01-11 05:23:23,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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-11 05:23:23,441 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2022-01-11 05:23:23,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-11 05:23:23,442 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:23:23,442 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:23:23,470 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-11 05:23:23,655 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:23:23,656 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:23:23,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:23:23,656 INFO L85 PathProgramCache]: Analyzing trace with hash -527841782, now seen corresponding path program 2 times [2022-01-11 05:23:23,656 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:23:23,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610946531] [2022-01-11 05:23:23,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:23:23,657 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:23:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:23:24,249 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:24,249 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:23:24,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610946531] [2022-01-11 05:23:24,249 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610946531] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:23:24,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610475869] [2022-01-11 05:23:24,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 05:23:24,249 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:23:24,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:23:24,251 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:23:24,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-11 05:23:25,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 05:23:25,440 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:23:25,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 91 conjunts are in the unsatisfiable core [2022-01-11 05:23:25,450 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:23:25,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:25,487 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 40 [2022-01-11 05:23:25,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:25,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 44 [2022-01-11 05:23:25,523 INFO L353 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2022-01-11 05:23:25,524 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 2 case distinctions, treesize of input 91 treesize of output 90 [2022-01-11 05:23:25,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:25,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:25,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:25,537 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 37 [2022-01-11 05:23:25,549 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-01-11 05:23:25,557 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 31 [2022-01-11 05:23:25,566 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 31 [2022-01-11 05:23:25,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-01-11 05:23:25,586 INFO L353 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-01-11 05:23:25,587 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 61 treesize of output 45 [2022-01-11 05:23:25,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:25,801 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:25,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 68 [2022-01-11 05:23:25,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:25,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:25,811 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:25,812 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:25,824 INFO L353 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-01-11 05:23:25,825 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 107 treesize of output 74 [2022-01-11 05:23:26,069 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:26,086 INFO L353 Elim1Store]: treesize reduction 68, result has 13.9 percent of original size [2022-01-11 05:23:26,086 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 60 [2022-01-11 05:23:26,094 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:26,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:26,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:26,098 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:26,109 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-01-11 05:23:26,109 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 92 treesize of output 67 [2022-01-11 05:23:26,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:26,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:26,498 INFO L353 Elim1Store]: treesize reduction 69, result has 10.4 percent of original size [2022-01-11 05:23:26,498 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 141 treesize of output 70 [2022-01-11 05:23:26,512 INFO L353 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-01-11 05:23:26,512 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 22 [2022-01-11 05:23:26,542 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:26,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:23:29,519 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:29,520 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610475869] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:23:29,520 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:23:29,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 24 [2022-01-11 05:23:29,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334967691] [2022-01-11 05:23:29,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:23:29,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-01-11 05:23:29,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:23:29,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-01-11 05:23:29,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=465, Unknown=1, NotChecked=0, Total=552 [2022-01-11 05:23:29,521 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:30,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:23:30,435 INFO L93 Difference]: Finished difference Result 89 states and 107 transitions. [2022-01-11 05:23:30,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-11 05:23:30,436 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-01-11 05:23:30,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:23:30,436 INFO L225 Difference]: With dead ends: 89 [2022-01-11 05:23:30,436 INFO L226 Difference]: Without dead ends: 78 [2022-01-11 05:23:30,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=160, Invalid=709, Unknown=1, NotChecked=0, Total=870 [2022-01-11 05:23:30,437 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 73 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-11 05:23:30,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 233 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 174 Invalid, 0 Unknown, 86 Unchecked, 0.4s Time] [2022-01-11 05:23:30,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-01-11 05:23:30,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 74. [2022-01-11 05:23:30,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 72 states have (on average 1.25) internal successors, (90), 73 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:30,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 90 transitions. [2022-01-11 05:23:30,446 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 90 transitions. Word has length 19 [2022-01-11 05:23:30,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:23:30,446 INFO L470 AbstractCegarLoop]: Abstraction has 74 states and 90 transitions. [2022-01-11 05:23:30,446 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:30,447 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 90 transitions. [2022-01-11 05:23:30,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-11 05:23:30,447 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:23:30,447 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:23:30,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-11 05:23:30,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:23:30,659 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:23:30,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:23:30,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1098388199, now seen corresponding path program 2 times [2022-01-11 05:23:30,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:23:30,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472936881] [2022-01-11 05:23:30,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:23:30,660 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:23:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:23:31,156 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:31,156 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:23:31,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472936881] [2022-01-11 05:23:31,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472936881] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:23:31,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269956671] [2022-01-11 05:23:31,156 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 05:23:31,156 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:23:31,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:23:31,160 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:23:31,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-11 05:23:31,643 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 05:23:31,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:23:31,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 80 conjunts are in the unsatisfiable core [2022-01-11 05:23:31,651 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:23:31,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:31,681 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2022-01-11 05:23:31,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:31,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2022-01-11 05:23:31,721 INFO L353 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2022-01-11 05:23:31,721 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 2 case distinctions, treesize of input 114 treesize of output 109 [2022-01-11 05:23:31,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:31,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:31,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:31,731 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 27 treesize of output 31 [2022-01-11 05:23:31,738 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-01-11 05:23:31,773 INFO L353 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-01-11 05:23:31,774 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 4 case distinctions, treesize of input 115 treesize of output 106 [2022-01-11 05:23:31,786 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-01-11 05:23:31,791 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 46 [2022-01-11 05:23:31,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:31,895 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-11 05:23:31,896 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 83 treesize of output 67 [2022-01-11 05:23:31,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:31,920 INFO L353 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-01-11 05:23:31,921 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 38 treesize of output 40 [2022-01-11 05:23:31,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:31,928 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-01-11 05:23:31,933 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-01-11 05:23:32,057 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-11 05:23:32,057 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 81 treesize of output 65 [2022-01-11 05:23:32,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:32,065 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-01-11 05:23:32,070 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-01-11 05:23:32,857 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:32,858 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:32,859 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:32,871 INFO L353 Elim1Store]: treesize reduction 17, result has 32.0 percent of original size [2022-01-11 05:23:32,872 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 105 treesize of output 58 [2022-01-11 05:23:32,879 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:23:32,885 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-11 05:23:32,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-01-11 05:23:32,953 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2022-01-11 05:23:32,981 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:32,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:23:33,210 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1359 (Array Int Int)) (v_ArrVal_1358 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~bcki~0#1.offsetInt_26| Int)) (or (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~bcki~0#1.offsetInt_26|)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~bcki~0#1.offsetInt_26| |c_ULTIMATE.start_ULTIMATE.start_main_~bucket~0#1.offsetInt|)) (= 2 (let ((.cse3 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| v_ArrVal_1359)) (.cse0 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| v_ArrVal_1358))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~bucket~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~bcki~0#1.offsetInt_26|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~bucket~0#1.baseInt|) |v_ULTIMATE.start_ULTIMATE.start_main_~bcki~0#1.offsetInt_26|))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt| 8) 18446744073709551616) 2)) (select (select .cse0 .cse1) .cse2)) (mod (+ 16 (select (select .cse3 .cse1) .cse2)) 18446744073709551616))))))) is different from false [2022-01-11 05:23:33,250 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:23:33,250 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 63 treesize of output 67 [2022-01-11 05:23:33,459 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:23:33,460 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269956671] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:23:33,460 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:23:33,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 25 [2022-01-11 05:23:33,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099413549] [2022-01-11 05:23:33,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:23:33,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-11 05:23:33,460 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:23:33,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-11 05:23:33,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=491, Unknown=1, NotChecked=44, Total=600 [2022-01-11 05:23:33,461 INFO L87 Difference]: Start difference. First operand 74 states and 90 transitions. Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:35,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:23:35,117 INFO L93 Difference]: Finished difference Result 162 states and 201 transitions. [2022-01-11 05:23:35,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-11 05:23:35,117 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-01-11 05:23:35,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:23:35,119 INFO L225 Difference]: With dead ends: 162 [2022-01-11 05:23:35,119 INFO L226 Difference]: Without dead ends: 128 [2022-01-11 05:23:35,120 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=125, Invalid=807, Unknown=2, NotChecked=58, Total=992 [2022-01-11 05:23:35,121 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 90 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 438 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-11 05:23:35,122 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [90 Valid, 371 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 438 Invalid, 0 Unknown, 188 Unchecked, 1.2s Time] [2022-01-11 05:23:35,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-01-11 05:23:35,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 85. [2022-01-11 05:23:35,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 84 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:35,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 103 transitions. [2022-01-11 05:23:35,133 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 103 transitions. Word has length 20 [2022-01-11 05:23:35,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:23:35,133 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 103 transitions. [2022-01-11 05:23:35,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 25 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:35,134 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-01-11 05:23:35,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-11 05:23:35,134 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:23:35,134 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:23:35,157 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-11 05:23:35,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-11 05:23:35,344 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:23:35,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:23:35,344 INFO L85 PathProgramCache]: Analyzing trace with hash -587854022, now seen corresponding path program 1 times [2022-01-11 05:23:35,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:23:35,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289421343] [2022-01-11 05:23:35,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:23:35,344 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:23:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:23:35,690 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 05:23:35,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:23:35,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289421343] [2022-01-11 05:23:35,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289421343] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:23:35,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493323437] [2022-01-11 05:23:35,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:23:35,691 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:23:35,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:23:35,692 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-11 05:23:35,693 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-11 05:23:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:23:35,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 82 conjunts are in the unsatisfiable core [2022-01-11 05:23:35,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:23:36,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:36,014 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 34 [2022-01-11 05:23:36,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:36,025 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2022-01-11 05:23:36,062 INFO L353 Elim1Store]: treesize reduction 44, result has 20.0 percent of original size [2022-01-11 05:23:36,063 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 2 case distinctions, treesize of input 117 treesize of output 110 [2022-01-11 05:23:36,077 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 28 treesize of output 40 [2022-01-11 05:23:36,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:36,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:36,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:36,086 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 27 treesize of output 31 [2022-01-11 05:23:36,120 INFO L353 Elim1Store]: treesize reduction 76, result has 16.5 percent of original size [2022-01-11 05:23:36,120 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 4 case distinctions, treesize of input 53 treesize of output 48 [2022-01-11 05:23:36,128 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 23 [2022-01-11 05:23:36,132 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 18 treesize of output 20 [2022-01-11 05:23:36,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:36,231 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 76 treesize of output 66 [2022-01-11 05:23:36,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:36,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:36,239 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-01-11 05:23:36,263 INFO L353 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2022-01-11 05:23:36,263 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 30 treesize of output 32 [2022-01-11 05:23:36,272 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 18 treesize of output 20 [2022-01-11 05:23:36,379 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 67 treesize of output 59 [2022-01-11 05:23:36,383 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 35 [2022-01-11 05:23:36,389 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 27 treesize of output 26 [2022-01-11 05:23:36,699 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2022-01-11 05:23:36,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:23:36,706 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 22 [2022-01-11 05:23:36,743 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2022-01-11 05:23:36,777 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 05:23:36,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:23:36,968 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:23:36,969 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 35 treesize of output 39 [2022-01-11 05:23:37,097 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 05:23:37,097 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493323437] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:23:37,097 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:23:37,097 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 21 [2022-01-11 05:23:37,098 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134102715] [2022-01-11 05:23:37,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:23:37,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-11 05:23:37,098 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:23:37,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-11 05:23:37,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=356, Unknown=1, NotChecked=0, Total=420 [2022-01-11 05:23:37,099 INFO L87 Difference]: Start difference. First operand 85 states and 103 transitions. Second operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:38,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:23:38,259 INFO L93 Difference]: Finished difference Result 155 states and 190 transitions. [2022-01-11 05:23:38,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-11 05:23:38,259 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-01-11 05:23:38,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:23:38,260 INFO L225 Difference]: With dead ends: 155 [2022-01-11 05:23:38,260 INFO L226 Difference]: Without dead ends: 121 [2022-01-11 05:23:38,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=575, Unknown=1, NotChecked=0, Total=702 [2022-01-11 05:23:38,261 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 103 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 65 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-11 05:23:38,263 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 267 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 308 Invalid, 0 Unknown, 65 Unchecked, 0.8s Time] [2022-01-11 05:23:38,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-01-11 05:23:38,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 81. [2022-01-11 05:23:38,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 80 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:38,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2022-01-11 05:23:38,272 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 20 [2022-01-11 05:23:38,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:23:38,272 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2022-01-11 05:23:38,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 21 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:23:38,273 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2022-01-11 05:23:38,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-11 05:23:38,273 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:23:38,274 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:23:38,293 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-11 05:23:38,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:23:38,483 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-11 05:23:38,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:23:38,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1636981059, now seen corresponding path program 1 times [2022-01-11 05:23:38,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:23:38,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982083444] [2022-01-11 05:23:38,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:23:38,484 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:23:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 05:23:38,573 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-11 05:23:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-11 05:23:38,667 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-11 05:23:38,667 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-11 05:23:38,668 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-01-11 05:23:38,669 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-01-11 05:23:38,669 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-01-11 05:23:38,669 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-01-11 05:23:38,669 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-01-11 05:23:38,670 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-11 05:23:38,672 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-01-11 05:23:38,675 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-11 05:23:38,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 05:23:38 BasicIcfg [2022-01-11 05:23:38,742 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-11 05:23:38,743 INFO L158 Benchmark]: Toolchain (without parser) took 33389.77ms. Allocated memory was 176.2MB in the beginning and 375.4MB in the end (delta: 199.2MB). Free memory was 117.5MB in the beginning and 157.9MB in the end (delta: -40.4MB). Peak memory consumption was 159.9MB. Max. memory is 8.0GB. [2022-01-11 05:23:38,743 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-11 05:23:38,744 INFO L158 Benchmark]: CACSL2BoogieTranslator took 436.73ms. Allocated memory was 176.2MB in the beginning and 260.0MB in the end (delta: 83.9MB). Free memory was 117.3MB in the beginning and 225.6MB in the end (delta: -108.3MB). Peak memory consumption was 17.1MB. Max. memory is 8.0GB. [2022-01-11 05:23:38,744 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.86ms. Allocated memory is still 260.0MB. Free memory was 225.6MB in the beginning and 223.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-11 05:23:38,744 INFO L158 Benchmark]: Boogie Preprocessor took 24.76ms. Allocated memory is still 260.0MB. Free memory was 223.0MB in the beginning and 221.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-11 05:23:38,744 INFO L158 Benchmark]: RCFGBuilder took 2258.15ms. Allocated memory is still 260.0MB. Free memory was 221.4MB in the beginning and 196.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2022-01-11 05:23:38,744 INFO L158 Benchmark]: IcfgTransformer took 81.07ms. Allocated memory is still 260.0MB. Free memory was 196.3MB in the beginning and 190.5MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2022-01-11 05:23:38,745 INFO L158 Benchmark]: TraceAbstraction took 30519.61ms. Allocated memory was 260.0MB in the beginning and 375.4MB in the end (delta: 115.3MB). Free memory was 190.0MB in the beginning and 157.9MB in the end (delta: 32.1MB). Peak memory consumption was 148.5MB. Max. memory is 8.0GB. [2022-01-11 05:23:38,749 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 176.2MB. Free memory is still 134.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 436.73ms. Allocated memory was 176.2MB in the beginning and 260.0MB in the end (delta: 83.9MB). Free memory was 117.3MB in the beginning and 225.6MB in the end (delta: -108.3MB). Peak memory consumption was 17.1MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.86ms. Allocated memory is still 260.0MB. Free memory was 225.6MB in the beginning and 223.0MB in the end (delta: 2.6MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.76ms. Allocated memory is still 260.0MB. Free memory was 223.0MB in the beginning and 221.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 2258.15ms. Allocated memory is still 260.0MB. Free memory was 221.4MB in the beginning and 196.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * IcfgTransformer took 81.07ms. Allocated memory is still 260.0MB. Free memory was 196.3MB in the beginning and 190.5MB in the end (delta: 5.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * TraceAbstraction took 30519.61ms. Allocated memory was 260.0MB in the beginning and 375.4MB in the end (delta: 115.3MB). Free memory was 190.0MB in the beginning and 157.9MB in the end (delta: 32.1MB). Peak memory consumption was 148.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1061]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1004] BCK* bucket = malloc(sizeof(BCK)); [L1005] bucket->data = 0 [L1006] bucket->list = ((void*)0) [L1008] bucket->next = malloc(sizeof(BCK)) [L1009] EXPR bucket->next [L1009] BCK* bcki = bucket->next; [L1010] bcki->data = 1 [L1011] bcki->list = ((void*)0) [L1013] bcki->next = malloc(sizeof(BCK)) [L1014] EXPR bcki->next [L1014] bcki = bcki->next [L1015] bcki->data = 2 [L1016] bcki->list = ((void*)0) [L1017] bcki->next = ((void*)0) [L1019] struct TSLL* item = ((void*)0); [L1020] struct TSLL* itr = ((void*)0); VAL [bcki={-3:0}, bucket={-5:0}, item={0:0}, itr={0:0}] [L1021] COND TRUE __VERIFIER_nondet_int() [L1023] item = malloc(sizeof(SLL)) [L1024] item->next = ((void*)0) VAL [bcki={-3:0}, bucket={-5:0}, item={-4:0}, itr={0:0}] [L1025] COND TRUE __VERIFIER_nondet_int() [L1026] item->data = 0 VAL [bcki={-3:0}, bucket={-5:0}, item={-4:0}, itr={0:0}] [L1032] bcki = bucket VAL [bcki={-5:0}, bucket={-5:0}, item={-4:0}, itr={0:0}] [L1034] COND FALSE !(!(bcki != ((void*)0))) VAL [bcki={-5:0}, bucket={-5:0}, item={-4:0}, itr={0:0}] [L1035] COND FALSE !(!(item != ((void*)0))) VAL [bcki={-5:0}, bucket={-5:0}, item={-4:0}, itr={0:0}] [L1036] EXPR bcki->data [L1036] EXPR item->data VAL [bcki={-5:0}, bcki->data=0, bucket={-5:0}, item={-4:0}, item->data=0, itr={0:0}] [L1036] COND FALSE !(bcki->data != item->data) [L1038] COND FALSE !(!(bcki != ((void*)0))) VAL [bcki={-5:0}, bucket={-5:0}, item={-4:0}, itr={0:0}] [L1040] EXPR bcki->list VAL [bcki={-5:0}, bcki->list={0:0}, bucket={-5:0}, item={-4:0}, itr={0:0}] [L1040] COND TRUE bcki->list == ((void*)0) [L1041] bcki->list = item VAL [bcki={-5:0}, bucket={-5:0}, item={-4:0}, itr={0:0}] [L1021] COND FALSE !(__VERIFIER_nondet_int()) [L1052] bcki = bucket VAL [bcki={-5:0}, bucket={-5:0}, item={-4:0}, itr={0:0}] [L1053] COND TRUE bcki != ((void*)0) [L1055] EXPR bcki->list [L1055] item = bcki->list [L1056] bcki->list = ((void*)0) VAL [bcki={-5:0}, bucket={-5:0}, item={-4:0}, itr={0:0}] [L1057] COND TRUE item != ((void*)0) [L1059] itr = item [L1060] EXPR item->next [L1060] item = item->next [L1061] EXPR itr->data [L1061] EXPR bcki->data VAL [bcki={-5:0}, bcki->data=0, bucket={-5:0}, item={0:0}, itr={-4:0}, itr->data=0] [L1061] COND TRUE !(itr->data != bcki->data) [L1061] reach_error() VAL [bcki={-5:0}, bucket={-5:0}, item={0:0}, itr={-4:0}] - UnprovableResult [Line: 1034]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1035]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1038]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 43 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 30.4s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 574 SdHoareTripleChecker+Valid, 4.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 574 mSDsluCounter, 1951 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 739 IncrementalHoareTripleChecker+Unchecked, 1576 mSDsCounter, 175 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1465 IncrementalHoareTripleChecker+Invalid, 2379 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 175 mSolverCounterUnsat, 375 mSDtfsCounter, 1465 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 324 GetRequests, 158 SyntacticMatches, 9 SemanticMatches, 157 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 587 ImplicationChecksByTransitivity, 7.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=10, InterpolantAutomatonStates: 85, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 206 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 18.2s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 345 ConstructedInterpolants, 54 QuantifiedInterpolants, 15539 SizeOfPredicates, 55 NumberOfNonLiveVariables, 2686 ConjunctsInSsa, 459 ConjunctsInUnsatCore, 23 InterpolantComputations, 5 PerfectInterpolantSequences, 51/135 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-01-11 05:23:38,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...