/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-queue-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 17:45:39,307 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 17:45:39,309 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 17:45:39,370 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 17:45:39,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 17:45:39,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 17:45:39,372 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 17:45:39,373 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 17:45:39,374 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 17:45:39,374 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 17:45:39,375 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 17:45:39,375 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 17:45:39,376 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 17:45:39,376 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 17:45:39,377 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 17:45:39,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 17:45:39,378 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 17:45:39,378 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 17:45:39,380 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 17:45:39,381 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 17:45:39,382 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 17:45:39,383 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 17:45:39,384 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 17:45:39,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 17:45:39,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 17:45:39,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 17:45:39,386 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 17:45:39,387 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 17:45:39,387 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 17:45:39,388 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 17:45:39,388 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 17:45:39,388 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 17:45:39,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 17:45:39,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 17:45:39,390 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 17:45:39,390 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 17:45:39,391 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 17:45:39,391 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 17:45:39,391 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 17:45:39,391 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 17:45:39,392 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 17:45:39,393 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_LAZY.epf [2022-01-10 17:45:39,407 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 17:45:39,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 17:45:39,407 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 17:45:39,407 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 17:45:39,408 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 17:45:39,408 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 17:45:39,408 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 17:45:39,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 17:45:39,409 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 17:45:39,409 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 17:45:39,409 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 17:45:39,409 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 17:45:39,409 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 17:45:39,409 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 17:45:39,409 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 17:45:39,409 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 17:45:39,409 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 17:45:39,410 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 17:45:39,410 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 17:45:39,410 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 17:45:39,410 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 17:45:39,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:45:39,410 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 17:45:39,410 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 17:45:39,410 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 17:45:39,410 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 17:45:39,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 17:45:39,411 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 17:45:39,411 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 17:45:39,411 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 17:45:39,411 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 17:45:39,411 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 17:45:39,412 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 17:45:39,412 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_LAZY WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 17:45:39,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 17:45:39,564 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 17:45:39,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 17:45:39,566 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 17:45:39,567 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 17:45:39,568 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-queue-1.i [2022-01-10 17:45:39,618 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d7d8f255/60eb7415d4d0497d8d65062e0ef88f2d/FLAGc25dde6a0 [2022-01-10 17:45:40,008 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 17:45:40,009 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-queue-1.i [2022-01-10 17:45:40,021 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d7d8f255/60eb7415d4d0497d8d65062e0ef88f2d/FLAGc25dde6a0 [2022-01-10 17:45:40,031 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d7d8f255/60eb7415d4d0497d8d65062e0ef88f2d [2022-01-10 17:45:40,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 17:45:40,033 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 17:45:40,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 17:45:40,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 17:45:40,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 17:45:40,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:45:40" (1/1) ... [2022-01-10 17:45:40,038 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d8faaae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:45:40, skipping insertion in model container [2022-01-10 17:45:40,038 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 05:45:40" (1/1) ... [2022-01-10 17:45:40,042 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 17:45:40,080 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 17:45:40,272 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-queue-1.i[22387,22400] [2022-01-10 17:45:40,274 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-queue-1.i[22458,22471] [2022-01-10 17:45:40,275 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-queue-1.i[22532,22545] [2022-01-10 17:45:40,276 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-queue-1.i[22624,22637] [2022-01-10 17:45:40,276 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-queue-1.i[22701,22714] [2022-01-10 17:45:40,277 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-queue-1.i[22796,22809] [2022-01-10 17:45:40,278 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-queue-1.i[22873,22886] [2022-01-10 17:45:40,278 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-queue-1.i[22956,22969] [2022-01-10 17:45:40,279 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-queue-1.i[23051,23064] [2022-01-10 17:45:40,280 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-queue-1.i[23128,23141] [2022-01-10 17:45:40,280 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-queue-1.i[23211,23224] [2022-01-10 17:45:40,281 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-queue-1.i[23300,23313] [2022-01-10 17:45:40,282 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-queue-1.i[23386,23399] [2022-01-10 17:45:40,283 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-queue-1.i[23532,23545] [2022-01-10 17:45:40,285 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:45:40,291 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 17:45:40,312 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-queue-1.i[22387,22400] [2022-01-10 17:45:40,313 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-queue-1.i[22458,22471] [2022-01-10 17:45:40,314 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-queue-1.i[22532,22545] [2022-01-10 17:45:40,314 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-queue-1.i[22624,22637] [2022-01-10 17:45:40,315 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-queue-1.i[22701,22714] [2022-01-10 17:45:40,315 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-queue-1.i[22796,22809] [2022-01-10 17:45:40,316 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-queue-1.i[22873,22886] [2022-01-10 17:45:40,316 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-queue-1.i[22956,22969] [2022-01-10 17:45:40,317 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-queue-1.i[23051,23064] [2022-01-10 17:45:40,317 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-queue-1.i[23128,23141] [2022-01-10 17:45:40,318 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-queue-1.i[23211,23224] [2022-01-10 17:45:40,318 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-queue-1.i[23300,23313] [2022-01-10 17:45:40,319 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-queue-1.i[23386,23399] [2022-01-10 17:45:40,320 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-queue-1.i[23532,23545] [2022-01-10 17:45:40,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 17:45:40,340 INFO L208 MainTranslator]: Completed translation [2022-01-10 17:45:40,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:45:40 WrapperNode [2022-01-10 17:45:40,342 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 17:45:40,343 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 17:45:40,343 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 17:45:40,344 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 17:45:40,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:45:40" (1/1) ... [2022-01-10 17:45:40,359 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:45:40" (1/1) ... [2022-01-10 17:45:40,375 INFO L137 Inliner]: procedures = 122, calls = 35, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 213 [2022-01-10 17:45:40,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 17:45:40,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 17:45:40,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 17:45:40,376 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 17:45:40,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:45:40" (1/1) ... [2022-01-10 17:45:40,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:45:40" (1/1) ... [2022-01-10 17:45:40,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:45:40" (1/1) ... [2022-01-10 17:45:40,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:45:40" (1/1) ... [2022-01-10 17:45:40,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:45:40" (1/1) ... [2022-01-10 17:45:40,394 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:45:40" (1/1) ... [2022-01-10 17:45:40,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:45:40" (1/1) ... [2022-01-10 17:45:40,397 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 17:45:40,398 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 17:45:40,398 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 17:45:40,398 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 17:45:40,399 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:45:40" (1/1) ... [2022-01-10 17:45:40,410 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 17:45:40,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:45:40,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 17:45:40,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 17:45:40,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 17:45:40,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 17:45:40,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 17:45:40,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 17:45:40,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 17:45:40,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 17:45:40,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 17:45:40,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 17:45:40,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 17:45:40,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 17:45:40,540 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 17:45:40,541 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 17:45:40,774 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 17:45:40,781 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 17:45:40,781 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2022-01-10 17:45:40,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:45:40 BoogieIcfgContainer [2022-01-10 17:45:40,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 17:45:40,783 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 17:45:40,784 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 17:45:40,787 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 17:45:40,789 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:45:40" (1/1) ... [2022-01-10 17:45:40,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:45:40 BasicIcfg [2022-01-10 17:45:40,933 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 17:45:40,936 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 17:45:40,936 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 17:45:40,939 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 17:45:40,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 05:45:40" (1/4) ... [2022-01-10 17:45:40,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a204f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:45:40, skipping insertion in model container [2022-01-10 17:45:40,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 05:45:40" (2/4) ... [2022-01-10 17:45:40,940 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a204f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 05:45:40, skipping insertion in model container [2022-01-10 17:45:40,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 05:45:40" (3/4) ... [2022-01-10 17:45:40,941 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a204f44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 05:45:40, skipping insertion in model container [2022-01-10 17:45:40,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 05:45:40" (4/4) ... [2022-01-10 17:45:40,943 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-queue-1.iTransformedIcfg [2022-01-10 17:45:40,949 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 17:45:40,950 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-01-10 17:45:40,981 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 17:45:40,985 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 17:45:40,985 INFO L340 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-01-10 17:45:40,998 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 67 states have (on average 2.029850746268657) internal successors, (136), 81 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:41,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-01-10 17:45:41,002 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:41,002 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-01-10 17:45:41,002 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-01-10 17:45:41,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:41,010 INFO L85 PathProgramCache]: Analyzing trace with hash 347398932, now seen corresponding path program 1 times [2022-01-10 17:45:41,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:41,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679121149] [2022-01-10 17:45:41,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:41,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:41,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:41,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:41,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:41,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679121149] [2022-01-10 17:45:41,184 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679121149] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:41,184 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:41,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 17:45:41,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793394144] [2022-01-10 17:45:41,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:41,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 17:45:41,191 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:41,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 17:45:41,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 17:45:41,214 INFO L87 Difference]: Start difference. First operand has 82 states, 67 states have (on average 2.029850746268657) internal successors, (136), 81 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:41,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:41,242 INFO L93 Difference]: Finished difference Result 162 states and 270 transitions. [2022-01-10 17:45:41,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 17:45:41,244 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-01-10 17:45:41,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:41,250 INFO L225 Difference]: With dead ends: 162 [2022-01-10 17:45:41,250 INFO L226 Difference]: Without dead ends: 77 [2022-01-10 17:45:41,252 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 17:45:41,261 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:45:41,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:45:41,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-01-10 17:45:41,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-01-10 17:45:41,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 76 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-10 17:45:41,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2022-01-10 17:45:41,290 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 5 [2022-01-10 17:45:41,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:41,290 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2022-01-10 17:45:41,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:41,290 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2022-01-10 17:45:41,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-01-10 17:45:41,290 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:41,291 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-01-10 17:45:41,291 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 17:45:41,294 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-01-10 17:45:41,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:41,296 INFO L85 PathProgramCache]: Analyzing trace with hash 347399893, now seen corresponding path program 1 times [2022-01-10 17:45:41,296 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:41,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520253358] [2022-01-10 17:45:41,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:41,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:41,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:41,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:41,382 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:41,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520253358] [2022-01-10 17:45:41,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520253358] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:41,385 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:41,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:45:41,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511936676] [2022-01-10 17:45:41,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:41,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:45:41,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:41,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:45:41,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:45:41,389 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:41,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:41,431 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-01-10 17:45:41,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:45:41,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-01-10 17:45:41,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:41,433 INFO L225 Difference]: With dead ends: 77 [2022-01-10 17:45:41,433 INFO L226 Difference]: Without dead ends: 67 [2022-01-10 17:45:41,433 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:45:41,434 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 72 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:45:41,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 63 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:45:41,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-10 17:45:41,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-01-10 17:45:41,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 58 states have (on average 1.293103448275862) internal successors, (75), 66 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:41,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2022-01-10 17:45:41,439 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 5 [2022-01-10 17:45:41,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:41,440 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2022-01-10 17:45:41,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:41,440 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-01-10 17:45:41,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-01-10 17:45:41,440 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:41,440 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:45:41,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 17:45:41,441 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-01-10 17:45:41,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:41,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1449953722, now seen corresponding path program 1 times [2022-01-10 17:45:41,441 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:41,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932009711] [2022-01-10 17:45:41,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:41,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:41,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:41,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:41,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932009711] [2022-01-10 17:45:41,492 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932009711] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:41,492 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:41,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:45:41,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919205634] [2022-01-10 17:45:41,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:41,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:45:41,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:41,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:45:41,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:45:41,494 INFO L87 Difference]: Start difference. First operand 67 states and 75 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-10 17:45:41,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:41,525 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-01-10 17:45:41,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:45:41,527 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-10 17:45:41,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:41,528 INFO L225 Difference]: With dead ends: 67 [2022-01-10 17:45:41,528 INFO L226 Difference]: Without dead ends: 65 [2022-01-10 17:45:41,529 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:45:41,529 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 57 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:45:41,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 75 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:45:41,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-10 17:45:41,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-01-10 17:45:41,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 57 states have (on average 1.280701754385965) internal successors, (73), 64 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:41,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-01-10 17:45:41,542 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 8 [2022-01-10 17:45:41,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:41,542 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-01-10 17:45:41,542 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-10 17:45:41,543 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-01-10 17:45:41,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 17:45:41,543 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:41,543 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:45:41,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 17:45:41,543 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-01-10 17:45:41,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:41,544 INFO L85 PathProgramCache]: Analyzing trace with hash -880387413, now seen corresponding path program 1 times [2022-01-10 17:45:41,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:41,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626792122] [2022-01-10 17:45:41,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:41,544 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:41,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:41,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:41,574 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:41,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626792122] [2022-01-10 17:45:41,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626792122] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:41,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:41,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:45:41,574 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993704178] [2022-01-10 17:45:41,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:41,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:45:41,575 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:41,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:45:41,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:45:41,575 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:41,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:41,601 INFO L93 Difference]: Finished difference Result 144 states and 166 transitions. [2022-01-10 17:45:41,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:45:41,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-01-10 17:45:41,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:41,602 INFO L225 Difference]: With dead ends: 144 [2022-01-10 17:45:41,602 INFO L226 Difference]: Without dead ends: 81 [2022-01-10 17:45:41,603 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:45:41,603 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 14 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:45:41,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 127 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:45:41,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-01-10 17:45:41,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2022-01-10 17:45:41,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.265625) internal successors, (81), 71 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:41,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2022-01-10 17:45:41,609 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 11 [2022-01-10 17:45:41,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:41,609 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2022-01-10 17:45:41,609 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:41,609 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2022-01-10 17:45:41,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 17:45:41,610 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:41,610 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:45:41,610 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 17:45:41,610 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-01-10 17:45:41,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:41,611 INFO L85 PathProgramCache]: Analyzing trace with hash 928658240, now seen corresponding path program 1 times [2022-01-10 17:45:41,611 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:41,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632360817] [2022-01-10 17:45:41,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:41,611 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:41,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:41,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:41,664 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:41,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632360817] [2022-01-10 17:45:41,665 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632360817] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:41,665 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:41,665 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:45:41,665 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288149673] [2022-01-10 17:45:41,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:41,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:45:41,665 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:41,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:45:41,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:45:41,666 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:41,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:41,682 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-01-10 17:45:41,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:45:41,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-01-10 17:45:41,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:41,686 INFO L225 Difference]: With dead ends: 75 [2022-01-10 17:45:41,686 INFO L226 Difference]: Without dead ends: 73 [2022-01-10 17:45:41,687 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:45:41,687 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:45:41,688 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:45:41,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-01-10 17:45:41,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-01-10 17:45:41,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 72 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-10 17:45:41,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2022-01-10 17:45:41,695 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 14 [2022-01-10 17:45:41,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:41,695 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2022-01-10 17:45:41,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:41,696 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2022-01-10 17:45:41,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 17:45:41,696 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:41,696 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:45:41,696 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 17:45:41,696 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-01-10 17:45:41,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:41,697 INFO L85 PathProgramCache]: Analyzing trace with hash 928659201, now seen corresponding path program 1 times [2022-01-10 17:45:41,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:41,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565514811] [2022-01-10 17:45:41,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:41,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:41,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:41,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:41,765 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:41,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565514811] [2022-01-10 17:45:41,765 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565514811] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:41,765 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:41,765 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 17:45:41,765 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859319531] [2022-01-10 17:45:41,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:41,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 17:45:41,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:41,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 17:45:41,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 17:45:41,766 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:41,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:41,816 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2022-01-10 17:45:41,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 17:45:41,816 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-01-10 17:45:41,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:41,818 INFO L225 Difference]: With dead ends: 89 [2022-01-10 17:45:41,818 INFO L226 Difference]: Without dead ends: 68 [2022-01-10 17:45:41,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 17:45:41,819 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 6 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:45:41,820 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 187 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:45:41,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-10 17:45:41,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-01-10 17:45:41,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:41,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-01-10 17:45:41,823 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 14 [2022-01-10 17:45:41,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:41,823 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-01-10 17:45:41,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:41,824 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-01-10 17:45:41,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 17:45:41,824 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:41,824 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:45:41,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 17:45:41,824 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-01-10 17:45:41,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:41,825 INFO L85 PathProgramCache]: Analyzing trace with hash 1691763558, now seen corresponding path program 1 times [2022-01-10 17:45:41,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:41,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356751520] [2022-01-10 17:45:41,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:41,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:41,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:41,964 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:41,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356751520] [2022-01-10 17:45:41,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356751520] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:45:41,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380811009] [2022-01-10 17:45:41,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:41,965 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:45:41,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:45:41,966 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:45:41,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 17:45:42,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:42,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-10 17:45:42,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:45:42,144 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 17:45:42,198 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 17:45:42,198 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 1 case distinctions, treesize of input 13 treesize of output 13 [2022-01-10 17:45:42,210 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 14 treesize of output 14 [2022-01-10 17:45:42,214 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 14 treesize of output 16 [2022-01-10 17:45:42,248 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 17:45:42,248 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-01-10 17:45:42,404 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-01-10 17:45:42,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:42,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:45:42,505 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_175 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| v_ArrVal_175) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|))) (or (<= 1 .cse0) (not (<= 0 .cse0))))) is different from false [2022-01-10 17:45:42,539 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:45:42,540 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 30 [2022-01-10 17:45:42,548 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:45:42,548 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 60 [2022-01-10 17:45:42,553 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 30 treesize of output 26 [2022-01-10 17:45:42,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:42,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380811009] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:45:42,648 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:45:42,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2022-01-10 17:45:42,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47382777] [2022-01-10 17:45:42,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:45:42,648 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-10 17:45:42,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:42,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-10 17:45:42,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=100, Unknown=1, NotChecked=20, Total=156 [2022-01-10 17:45:42,649 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:42,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:42,825 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2022-01-10 17:45:42,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 17:45:42,825 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-01-10 17:45:42,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:42,826 INFO L225 Difference]: With dead ends: 138 [2022-01-10 17:45:42,826 INFO L226 Difference]: Without dead ends: 136 [2022-01-10 17:45:42,826 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=153, Unknown=1, NotChecked=26, Total=240 [2022-01-10 17:45:42,827 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 236 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:45:42,827 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 388 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 134 Invalid, 0 Unknown, 92 Unchecked, 0.1s Time] [2022-01-10 17:45:42,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-01-10 17:45:42,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 80. [2022-01-10 17:45:42,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 72 states have (on average 1.25) internal successors, (90), 79 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:42,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2022-01-10 17:45:42,831 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 17 [2022-01-10 17:45:42,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:42,832 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2022-01-10 17:45:42,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:42,832 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2022-01-10 17:45:42,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 17:45:42,832 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:42,832 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:45:42,850 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-10 17:45:43,042 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:45:43,042 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-01-10 17:45:43,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:43,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1825517732, now seen corresponding path program 1 times [2022-01-10 17:45:43,043 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:43,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562028413] [2022-01-10 17:45:43,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:43,043 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:43,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:43,070 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:43,070 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:43,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562028413] [2022-01-10 17:45:43,070 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562028413] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:43,070 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:43,070 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:45:43,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130641717] [2022-01-10 17:45:43,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:43,071 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:45:43,071 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:43,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:45:43,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:45:43,071 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:43,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:43,094 INFO L93 Difference]: Finished difference Result 166 states and 191 transitions. [2022-01-10 17:45:43,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:45:43,094 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10 17:45:43,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:43,095 INFO L225 Difference]: With dead ends: 166 [2022-01-10 17:45:43,095 INFO L226 Difference]: Without dead ends: 102 [2022-01-10 17:45:43,095 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:45:43,096 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 22 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:45:43,096 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 120 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:45:43,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-01-10 17:45:43,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2022-01-10 17:45:43,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 91 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:43,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2022-01-10 17:45:43,100 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 18 [2022-01-10 17:45:43,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:43,100 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2022-01-10 17:45:43,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:43,100 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2022-01-10 17:45:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 17:45:43,101 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:43,101 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:45:43,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 17:45:43,101 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-01-10 17:45:43,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:43,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1634392855, now seen corresponding path program 1 times [2022-01-10 17:45:43,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:43,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115661659] [2022-01-10 17:45:43,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:43,102 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:43,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:43,133 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 17:45:43,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:43,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115661659] [2022-01-10 17:45:43,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115661659] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:43,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:43,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:45:43,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570543672] [2022-01-10 17:45:43,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:43,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:45:43,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:43,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:45:43,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:45:43,134 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:43,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:43,154 INFO L93 Difference]: Finished difference Result 164 states and 183 transitions. [2022-01-10 17:45:43,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:45:43,154 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-01-10 17:45:43,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:43,155 INFO L225 Difference]: With dead ends: 164 [2022-01-10 17:45:43,155 INFO L226 Difference]: Without dead ends: 88 [2022-01-10 17:45:43,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:45:43,156 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 53 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:45:43,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:45:43,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-01-10 17:45:43,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2022-01-10 17:45:43,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 77 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:43,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2022-01-10 17:45:43,160 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 24 [2022-01-10 17:45:43,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:43,160 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2022-01-10 17:45:43,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:43,160 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2022-01-10 17:45:43,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 17:45:43,160 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:43,160 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, 1, 1, 1] [2022-01-10 17:45:43,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 17:45:43,161 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-01-10 17:45:43,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:43,161 INFO L85 PathProgramCache]: Analyzing trace with hash -15082139, now seen corresponding path program 1 times [2022-01-10 17:45:43,161 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:43,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178873298] [2022-01-10 17:45:43,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:43,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:43,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:43,532 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:43,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178873298] [2022-01-10 17:45:43,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178873298] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:45:43,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600076808] [2022-01-10 17:45:43,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:43,532 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:45:43,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:45:43,548 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:45:43,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 17:45:43,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:43,743 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 42 conjunts are in the unsatisfiable core [2022-01-10 17:45:43,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:45:43,759 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 17:45:43,781 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-01-10 17:45:43,790 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 17:45:43,790 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-01-10 17:45:43,798 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-10 17:45:43,812 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 17:45:43,812 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2022-01-10 17:45:43,820 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 14 treesize of output 14 [2022-01-10 17:45:43,824 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 17:45:43,858 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 17:45:43,859 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 45 [2022-01-10 17:45:43,864 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-10 17:45:43,868 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-01-10 17:45:44,260 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2022-01-10 17:45:44,269 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-01-10 17:45:44,309 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 37 [2022-01-10 17:45:44,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:44,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:45:44,434 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 82 [2022-01-10 17:45:44,456 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_355 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| v_ArrVal_355) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt|)) (forall ((v_ArrVal_358 (Array Int Int))) (= (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt| 8) 18446744073709551616) (mod (+ 8 (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| v_ArrVal_358) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)) 18446744073709551616)))) is different from false [2022-01-10 17:45:44,478 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:45:44,478 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2022-01-10 17:45:44,485 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:45:44,485 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 46 [2022-01-10 17:45:44,496 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:45:44,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 69 [2022-01-10 17:45:44,508 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:45:44,508 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 84 [2022-01-10 17:45:44,517 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 51 [2022-01-10 17:45:44,522 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 51 treesize of output 49 [2022-01-10 17:45:44,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:44,690 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600076808] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:45:44,690 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:45:44,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2022-01-10 17:45:44,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500283513] [2022-01-10 17:45:44,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:45:44,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-10 17:45:44,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:44,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-10 17:45:44,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=165, Unknown=1, NotChecked=26, Total=240 [2022-01-10 17:45:44,692 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:45,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:45,077 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2022-01-10 17:45:45,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 17:45:45,077 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-01-10 17:45:45,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:45,078 INFO L225 Difference]: With dead ends: 142 [2022-01-10 17:45:45,078 INFO L226 Difference]: Without dead ends: 140 [2022-01-10 17:45:45,078 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=93, Invalid=252, Unknown=1, NotChecked=34, Total=380 [2022-01-10 17:45:45,079 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 109 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 17:45:45,079 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 564 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 170 Invalid, 0 Unknown, 153 Unchecked, 0.2s Time] [2022-01-10 17:45:45,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-01-10 17:45:45,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 82. [2022-01-10 17:45:45,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 75 states have (on average 1.1866666666666668) internal successors, (89), 81 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:45,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2022-01-10 17:45:45,083 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 25 [2022-01-10 17:45:45,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:45,084 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2022-01-10 17:45:45,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.1875) internal successors, (67), 16 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:45,084 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2022-01-10 17:45:45,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 17:45:45,084 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:45,084 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:45:45,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-10 17:45:45,299 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,SelfDestructingSolverStorable9 [2022-01-10 17:45:45,300 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-01-10 17:45:45,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:45,300 INFO L85 PathProgramCache]: Analyzing trace with hash 47025939, now seen corresponding path program 1 times [2022-01-10 17:45:45,300 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:45,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059384745] [2022-01-10 17:45:45,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:45,300 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:45,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:46,189 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:46,189 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:46,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059384745] [2022-01-10 17:45:46,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059384745] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:45:46,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1824995964] [2022-01-10 17:45:46,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:46,190 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:45:46,190 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:45:46,202 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:45:46,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 17:45:46,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:46,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-10 17:45:46,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:45:46,545 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 17:45:46,592 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 17:45:46,592 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 2 case distinctions, treesize of input 19 treesize of output 23 [2022-01-10 17:45:46,602 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 14 treesize of output 14 [2022-01-10 17:45:46,606 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 14 treesize of output 16 [2022-01-10 17:45:46,657 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 14 treesize of output 16 [2022-01-10 17:45:47,873 INFO L353 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-01-10 17:45:47,873 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 30 treesize of output 41 [2022-01-10 17:45:47,905 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 17:45:47,920 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 17:45:47,920 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 1 case distinctions, treesize of input 13 treesize of output 13 [2022-01-10 17:45:47,968 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-01-10 17:45:48,033 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-01-10 17:45:48,039 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:48,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:45:48,088 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_487 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| v_ArrVal_487) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|))) (or (not (<= 0 .cse0)) (<= 1 .cse0)))) is different from false [2022-01-10 17:45:48,112 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt_10| Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_487 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| v_ArrVal_485) |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt_10| v_ArrVal_487) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|))) (or (not (<= 0 .cse0)) (<= 1 .cse0) (not (<= (mod (select |c_#validInt| |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt_10|) 2) 0)) (= |v_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt_10| 0)))) is different from false [2022-01-10 17:45:48,244 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:45:48,244 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 36 [2022-01-10 17:45:48,253 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:45:48,253 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 158 treesize of output 133 [2022-01-10 17:45:48,262 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 77 treesize of output 73 [2022-01-10 17:45:48,267 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 96 treesize of output 88 [2022-01-10 17:45:48,782 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-01-10 17:45:48,783 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1824995964] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 17:45:48,783 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 17:45:48,783 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2022-01-10 17:45:48,783 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676960539] [2022-01-10 17:45:48,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 17:45:48,783 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-01-10 17:45:48,783 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:48,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-01-10 17:45:48,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=120, Unknown=2, NotChecked=46, Total=210 [2022-01-10 17:45:48,784 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:49,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:49,061 INFO L93 Difference]: Finished difference Result 148 states and 160 transitions. [2022-01-10 17:45:49,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 17:45:49,062 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-01-10 17:45:49,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:49,063 INFO L225 Difference]: With dead ends: 148 [2022-01-10 17:45:49,063 INFO L226 Difference]: Without dead ends: 146 [2022-01-10 17:45:49,063 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=76, Invalid=202, Unknown=2, NotChecked=62, Total=342 [2022-01-10 17:45:49,064 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 221 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 17:45:49,064 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 482 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 174 Invalid, 0 Unknown, 195 Unchecked, 0.1s Time] [2022-01-10 17:45:49,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-01-10 17:45:49,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 95. [2022-01-10 17:45:49,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 88 states have (on average 1.1818181818181819) internal successors, (104), 94 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:49,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 104 transitions. [2022-01-10 17:45:49,070 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 104 transitions. Word has length 25 [2022-01-10 17:45:49,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:49,070 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 104 transitions. [2022-01-10 17:45:49,071 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.6) internal successors, (69), 15 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:49,071 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 104 transitions. [2022-01-10 17:45:49,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 17:45:49,071 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:49,071 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:45:49,102 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 17:45:49,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:45:49,284 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-01-10 17:45:49,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:49,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1916676407, now seen corresponding path program 1 times [2022-01-10 17:45:49,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:49,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994364607] [2022-01-10 17:45:49,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:49,285 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:49,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:49,327 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 17:45:49,327 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:49,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994364607] [2022-01-10 17:45:49,327 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994364607] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 17:45:49,327 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 17:45:49,327 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 17:45:49,327 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685337465] [2022-01-10 17:45:49,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 17:45:49,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 17:45:49,328 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 17:45:49,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 17:45:49,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:45:49,328 INFO L87 Difference]: Start difference. First operand 95 states and 104 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:49,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 17:45:49,352 INFO L93 Difference]: Finished difference Result 166 states and 183 transitions. [2022-01-10 17:45:49,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 17:45:49,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-01-10 17:45:49,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 17:45:49,353 INFO L225 Difference]: With dead ends: 166 [2022-01-10 17:45:49,353 INFO L226 Difference]: Without dead ends: 109 [2022-01-10 17:45:49,354 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 17:45:49,354 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 27 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 17:45:49,355 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 129 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 17:45:49,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-01-10 17:45:49,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2022-01-10 17:45:49,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 92 states have (on average 1.1630434782608696) internal successors, (107), 98 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:49,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2022-01-10 17:45:49,359 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 26 [2022-01-10 17:45:49,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 17:45:49,359 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2022-01-10 17:45:49,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 17:45:49,359 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2022-01-10 17:45:49,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 17:45:49,363 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 17:45:49,363 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 17:45:49,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 17:45:49,363 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-01-10 17:45:49,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 17:45:49,364 INFO L85 PathProgramCache]: Analyzing trace with hash 791793033, now seen corresponding path program 1 times [2022-01-10 17:45:49,364 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 17:45:49,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705824951] [2022-01-10 17:45:49,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:49,364 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 17:45:49,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:49,617 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:49,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 17:45:49,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705824951] [2022-01-10 17:45:49,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705824951] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 17:45:49,618 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858652866] [2022-01-10 17:45:49,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 17:45:49,618 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 17:45:49,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 17:45:49,632 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 17:45:49,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 17:45:49,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 17:45:49,770 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 53 conjunts are in the unsatisfiable core [2022-01-10 17:45:49,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 17:45:49,784 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 17:45:49,809 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-01-10 17:45:49,817 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 17:45:49,817 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-01-10 17:45:49,824 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-10 17:45:49,830 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-01-10 17:45:49,840 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 17:45:49,841 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-01-10 17:45:49,846 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-01-10 17:45:49,870 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 17:45:49,870 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 29 [2022-01-10 17:45:49,921 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 17:45:49,929 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 17:45:50,027 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:45:50,033 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-01-10 17:45:50,033 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 42 [2022-01-10 17:45:50,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:45:50,046 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 17:45:50,046 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 50 [2022-01-10 17:45:50,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:45:50,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 17:45:50,057 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 21 treesize of output 25 [2022-01-10 17:45:50,070 INFO L353 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-01-10 17:45:50,071 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 27 [2022-01-10 17:45:50,166 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-01-10 17:45:50,166 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 54 [2022-01-10 17:45:50,176 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 22 treesize of output 24 [2022-01-10 17:45:50,486 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:45:50,486 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 17:45:50,493 INFO L353 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-01-10 17:45:50,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 26 [2022-01-10 17:45:50,497 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-10 17:45:50,507 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 17:45:50,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 17:45:50,591 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_687 (Array Int Int))) (let ((.cse0 (select (let ((.cse1 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| v_ArrVal_688))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|))) (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| v_ArrVal_687) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)))) (or (not (<= 0 .cse0)) (<= 1 .cse0)))) is different from false [2022-01-10 17:45:50,621 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_688 (Array Int Int)) (v_ArrVal_681 Int) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_687 (Array Int Int))) (let ((.cse0 (select (let ((.cse2 (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt| v_ArrVal_681)) v_ArrVal_681 v_ArrVal_688))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|))) (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| v_ArrVal_682) v_ArrVal_681 v_ArrVal_687) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|))) (.cse1 (select |c_#validInt| v_ArrVal_681))) (or (= v_ArrVal_681 0) (<= 1 .cse0) (not (<= 0 .cse0)) (not (<= (mod .cse1 2) 0)) (not (< .cse1 2))))) is different from false [2022-01-10 17:45:50,720 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:45:50,720 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 1 case distinctions, treesize of input 80 treesize of output 74 [2022-01-10 17:45:50,743 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_688 (Array Int Int)) (v_arrayElimArr_12 (Array Int Int)) (v_ArrVal_682 (Array Int Int)) (v_ArrVal_687 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_12 |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt|))) (let ((.cse0 (select |c_#validInt| .cse1)) (.cse2 (select (let ((.cse3 (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| v_arrayElimArr_12) .cse1 v_ArrVal_688))) (select .cse3 (select (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|))) (select (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| v_ArrVal_682) .cse1 v_ArrVal_687) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)))) (or (not (<= (mod .cse0 2) 0)) (= .cse1 0) (not (< .cse0 2)) (<= 1 .cse2) (not (<= 0 .cse2)))))) is different from false [2022-01-10 17:45:50,766 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:45:50,766 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 120 [2022-01-10 17:45:50,773 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:45:50,773 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 88 [2022-01-10 17:45:50,828 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:45:50,829 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 3262 treesize of output 2347 [2022-01-10 17:45:50,891 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:45:50,891 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 2363 treesize of output 1895 [2022-01-10 17:45:50,944 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:45:50,944 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1752 treesize of output 1554 [2022-01-10 17:45:50,996 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 17:45:50,996 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 540 treesize of output 511 [2022-01-10 17:45:51,059 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 496 treesize of output 460 [2022-01-10 17:45:51,093 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 460 treesize of output 442