/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml -i ../sv-benchmarks/c/forester-heap/dll-queue-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-03-31 00:08:53,434 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-03-31 00:08:53,436 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-03-31 00:08:53,468 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-03-31 00:08:53,468 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-03-31 00:08:53,472 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-03-31 00:08:53,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-03-31 00:08:53,477 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-03-31 00:08:53,479 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-03-31 00:08:53,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-03-31 00:08:53,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-03-31 00:08:53,486 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-03-31 00:08:53,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-03-31 00:08:53,488 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-03-31 00:08:53,489 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-03-31 00:08:53,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-03-31 00:08:53,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-03-31 00:08:53,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-03-31 00:08:53,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-03-31 00:08:53,496 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-03-31 00:08:53,497 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-03-31 00:08:53,498 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-03-31 00:08:53,498 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-03-31 00:08:53,499 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-03-31 00:08:53,505 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-03-31 00:08:53,506 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-03-31 00:08:53,506 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-03-31 00:08:53,507 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-03-31 00:08:53,508 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-03-31 00:08:53,508 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-03-31 00:08:53,508 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-03-31 00:08:53,509 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-03-31 00:08:53,510 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-03-31 00:08:53,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-03-31 00:08:53,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-03-31 00:08:53,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-03-31 00:08:53,511 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-03-31 00:08:53,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-03-31 00:08:53,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-03-31 00:08:53,512 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-03-31 00:08:53,513 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-03-31 00:08:53,514 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-03-31 00:08:53,537 INFO L113 SettingsManager]: Loading preferences was successful [2023-03-31 00:08:53,537 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-03-31 00:08:53,538 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-03-31 00:08:53,538 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-03-31 00:08:53,539 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-03-31 00:08:53,539 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-03-31 00:08:53,539 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-03-31 00:08:53,540 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-03-31 00:08:53,540 INFO L138 SettingsManager]: * Use SBE=true [2023-03-31 00:08:53,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-03-31 00:08:53,540 INFO L138 SettingsManager]: * sizeof long=4 [2023-03-31 00:08:53,541 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-03-31 00:08:53,541 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-03-31 00:08:53,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-03-31 00:08:53,541 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-03-31 00:08:53,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-03-31 00:08:53,541 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-03-31 00:08:53,541 INFO L138 SettingsManager]: * sizeof long double=12 [2023-03-31 00:08:53,541 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-03-31 00:08:53,541 INFO L138 SettingsManager]: * Use constant arrays=true [2023-03-31 00:08:53,541 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-03-31 00:08:53,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-03-31 00:08:53,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-03-31 00:08:53,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-03-31 00:08:53,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 00:08:53,542 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-03-31 00:08:53,542 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-03-31 00:08:53,543 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-03-31 00:08:53,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-03-31 00:08:53,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-03-31 00:08:53,543 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-03-31 00:08:53,543 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-03-31 00:08:53,543 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-03-31 00:08:53,543 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-03-31 00:08:53,543 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-03-31 00:08:53,544 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2023-03-31 00:08:53,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-03-31 00:08:53,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-03-31 00:08:53,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-03-31 00:08:53,787 INFO L271 PluginConnector]: Initializing CDTParser... [2023-03-31 00:08:53,787 INFO L275 PluginConnector]: CDTParser initialized [2023-03-31 00:08:53,788 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-queue-2.i [2023-03-31 00:08:54,809 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-03-31 00:08:55,043 INFO L351 CDTParser]: Found 1 translation units. [2023-03-31 00:08:55,043 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i [2023-03-31 00:08:55,056 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a37d2565d/7e80e34e3ace4ebebb0f6722d243aa87/FLAG29d9ff919 [2023-03-31 00:08:55,070 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a37d2565d/7e80e34e3ace4ebebb0f6722d243aa87 [2023-03-31 00:08:55,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-03-31 00:08:55,074 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-03-31 00:08:55,077 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-03-31 00:08:55,077 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-03-31 00:08:55,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-03-31 00:08:55,080 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 12:08:55" (1/1) ... [2023-03-31 00:08:55,081 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5fdcfe92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:08:55, skipping insertion in model container [2023-03-31 00:08:55,081 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.03 12:08:55" (1/1) ... [2023-03-31 00:08:55,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-03-31 00:08:55,127 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-03-31 00:08:55,368 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22460,22473] [2023-03-31 00:08:55,373 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22531,22544] [2023-03-31 00:08:55,374 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22605,22618] [2023-03-31 00:08:55,375 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22697,22710] [2023-03-31 00:08:55,376 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22774,22787] [2023-03-31 00:08:55,377 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22869,22882] [2023-03-31 00:08:55,378 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22946,22959] [2023-03-31 00:08:55,379 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23029,23042] [2023-03-31 00:08:55,380 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23124,23137] [2023-03-31 00:08:55,381 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23201,23214] [2023-03-31 00:08:55,383 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23284,23297] [2023-03-31 00:08:55,384 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23373,23386] [2023-03-31 00:08:55,385 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23459,23472] [2023-03-31 00:08:55,387 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23604,23617] [2023-03-31 00:08:55,392 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 00:08:55,400 INFO L203 MainTranslator]: Completed pre-run [2023-03-31 00:08:55,444 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22460,22473] [2023-03-31 00:08:55,445 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22531,22544] [2023-03-31 00:08:55,445 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22605,22618] [2023-03-31 00:08:55,445 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22697,22710] [2023-03-31 00:08:55,446 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22774,22787] [2023-03-31 00:08:55,446 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22869,22882] [2023-03-31 00:08:55,447 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[22946,22959] [2023-03-31 00:08:55,447 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23029,23042] [2023-03-31 00:08:55,448 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23124,23137] [2023-03-31 00:08:55,448 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23201,23214] [2023-03-31 00:08:55,449 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23284,23297] [2023-03-31 00:08:55,449 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23373,23386] [2023-03-31 00:08:55,450 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23459,23472] [2023-03-31 00:08:55,451 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-queue-2.i[23604,23617] [2023-03-31 00:08:55,452 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-03-31 00:08:55,480 INFO L208 MainTranslator]: Completed translation [2023-03-31 00:08:55,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:08:55 WrapperNode [2023-03-31 00:08:55,480 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-03-31 00:08:55,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-03-31 00:08:55,481 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-03-31 00:08:55,481 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-03-31 00:08:55,490 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:08:55" (1/1) ... [2023-03-31 00:08:55,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:08:55" (1/1) ... [2023-03-31 00:08:55,505 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:08:55" (1/1) ... [2023-03-31 00:08:55,505 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:08:55" (1/1) ... [2023-03-31 00:08:55,519 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:08:55" (1/1) ... [2023-03-31 00:08:55,525 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:08:55" (1/1) ... [2023-03-31 00:08:55,529 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:08:55" (1/1) ... [2023-03-31 00:08:55,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:08:55" (1/1) ... [2023-03-31 00:08:55,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-03-31 00:08:55,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-03-31 00:08:55,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-03-31 00:08:55,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-03-31 00:08:55,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:08:55" (1/1) ... [2023-03-31 00:08:55,541 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-03-31 00:08:55,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:08:55,563 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) [2023-03-31 00:08:55,572 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 [2023-03-31 00:08:55,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-03-31 00:08:55,592 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-03-31 00:08:55,592 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-03-31 00:08:55,592 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-03-31 00:08:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2023-03-31 00:08:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2023-03-31 00:08:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2023-03-31 00:08:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2023-03-31 00:08:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2023-03-31 00:08:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2023-03-31 00:08:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2023-03-31 00:08:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2023-03-31 00:08:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2023-03-31 00:08:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2023-03-31 00:08:55,593 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2023-03-31 00:08:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2023-03-31 00:08:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2023-03-31 00:08:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2023-03-31 00:08:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2023-03-31 00:08:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2023-03-31 00:08:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure select [2023-03-31 00:08:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2023-03-31 00:08:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2023-03-31 00:08:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2023-03-31 00:08:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2023-03-31 00:08:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure random [2023-03-31 00:08:55,594 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2023-03-31 00:08:55,595 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2023-03-31 00:08:55,595 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2023-03-31 00:08:55,595 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2023-03-31 00:08:55,595 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2023-03-31 00:08:55,595 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2023-03-31 00:08:55,595 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2023-03-31 00:08:55,595 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2023-03-31 00:08:55,595 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2023-03-31 00:08:55,595 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2023-03-31 00:08:55,595 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2023-03-31 00:08:55,596 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2023-03-31 00:08:55,596 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2023-03-31 00:08:55,596 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2023-03-31 00:08:55,596 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2023-03-31 00:08:55,596 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2023-03-31 00:08:55,596 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2023-03-31 00:08:55,596 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2023-03-31 00:08:55,596 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2023-03-31 00:08:55,596 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2023-03-31 00:08:55,596 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2023-03-31 00:08:55,597 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2023-03-31 00:08:55,597 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2023-03-31 00:08:55,597 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2023-03-31 00:08:55,597 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2023-03-31 00:08:55,597 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2023-03-31 00:08:55,597 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2023-03-31 00:08:55,597 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2023-03-31 00:08:55,597 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2023-03-31 00:08:55,597 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2023-03-31 00:08:55,597 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2023-03-31 00:08:55,597 INFO L130 BoogieDeclarations]: Found specification of procedure free [2023-03-31 00:08:55,597 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2023-03-31 00:08:55,597 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2023-03-31 00:08:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2023-03-31 00:08:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2023-03-31 00:08:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2023-03-31 00:08:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-03-31 00:08:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2023-03-31 00:08:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2023-03-31 00:08:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2023-03-31 00:08:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2023-03-31 00:08:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2023-03-31 00:08:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2023-03-31 00:08:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2023-03-31 00:08:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2023-03-31 00:08:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2023-03-31 00:08:55,598 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2023-03-31 00:08:55,599 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2023-03-31 00:08:55,599 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2023-03-31 00:08:55,599 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2023-03-31 00:08:55,599 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2023-03-31 00:08:55,599 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2023-03-31 00:08:55,599 INFO L130 BoogieDeclarations]: Found specification of procedure system [2023-03-31 00:08:55,599 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2023-03-31 00:08:55,599 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2023-03-31 00:08:55,599 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2023-03-31 00:08:55,599 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2023-03-31 00:08:55,599 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2023-03-31 00:08:55,599 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2023-03-31 00:08:55,599 INFO L130 BoogieDeclarations]: Found specification of procedure div [2023-03-31 00:08:55,600 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2023-03-31 00:08:55,600 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2023-03-31 00:08:55,600 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2023-03-31 00:08:55,600 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2023-03-31 00:08:55,600 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2023-03-31 00:08:55,600 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2023-03-31 00:08:55,600 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2023-03-31 00:08:55,600 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2023-03-31 00:08:55,600 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2023-03-31 00:08:55,600 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2023-03-31 00:08:55,600 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2023-03-31 00:08:55,600 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2023-03-31 00:08:55,601 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2023-03-31 00:08:55,601 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2023-03-31 00:08:55,601 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2023-03-31 00:08:55,601 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2023-03-31 00:08:55,601 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2023-03-31 00:08:55,601 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2023-03-31 00:08:55,601 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2023-03-31 00:08:55,601 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2023-03-31 00:08:55,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2023-03-31 00:08:55,601 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-03-31 00:08:55,601 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2023-03-31 00:08:55,601 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2023-03-31 00:08:55,601 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-03-31 00:08:55,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-03-31 00:08:55,602 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-03-31 00:08:55,602 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-03-31 00:08:55,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-03-31 00:08:55,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-03-31 00:08:55,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-03-31 00:08:55,602 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-03-31 00:08:55,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-03-31 00:08:55,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-03-31 00:08:55,602 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-03-31 00:08:55,602 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-03-31 00:08:55,780 INFO L236 CfgBuilder]: Building ICFG [2023-03-31 00:08:55,782 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-03-31 00:08:56,028 INFO L277 CfgBuilder]: Performing block encoding [2023-03-31 00:08:56,033 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-03-31 00:08:56,033 INFO L302 CfgBuilder]: Removed 31 assume(true) statements. [2023-03-31 00:08:56,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 12:08:56 BoogieIcfgContainer [2023-03-31 00:08:56,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-03-31 00:08:56,036 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-03-31 00:08:56,036 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-03-31 00:08:56,039 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-03-31 00:08:56,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.03 12:08:55" (1/3) ... [2023-03-31 00:08:56,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b4faf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 12:08:56, skipping insertion in model container [2023-03-31 00:08:56,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.03 12:08:55" (2/3) ... [2023-03-31 00:08:56,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b4faf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.03 12:08:56, skipping insertion in model container [2023-03-31 00:08:56,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.03 12:08:56" (3/3) ... [2023-03-31 00:08:56,041 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-queue-2.i [2023-03-31 00:08:56,054 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-03-31 00:08:56,054 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2023-03-31 00:08:56,104 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-03-31 00:08:56,110 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6c47e6a9, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-03-31 00:08:56,110 INFO L358 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2023-03-31 00:08:56,114 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 71 states have (on average 1.9859154929577465) internal successors, (141), 85 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-03-31 00:08:56,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-03-31 00:08:56,119 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:08:56,120 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:08:56,120 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-03-31 00:08:56,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:08:56,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1836202114, now seen corresponding path program 1 times [2023-03-31 00:08:56,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:08:56,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942968301] [2023-03-31 00:08:56,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:08:56,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:08:56,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:08:56,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:08:56,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:08:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:08:56,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:08:56,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942968301] [2023-03-31 00:08:56,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942968301] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:08:56,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:08:56,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-03-31 00:08:56,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080702950] [2023-03-31 00:08:56,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:08:56,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-03-31 00:08:56,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:08:56,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-03-31 00:08:56,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-03-31 00:08:56,347 INFO L87 Difference]: Start difference. First operand has 90 states, 71 states have (on average 1.9859154929577465) internal successors, (141), 85 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:08:56,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:08:56,509 INFO L93 Difference]: Finished difference Result 174 states and 284 transitions. [2023-03-31 00:08:56,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-03-31 00:08:56,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2023-03-31 00:08:56,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:08:56,537 INFO L225 Difference]: With dead ends: 174 [2023-03-31 00:08:56,537 INFO L226 Difference]: Without dead ends: 84 [2023-03-31 00:08:56,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-03-31 00:08:56,542 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 93 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 00:08:56,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 10 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 00:08:56,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-03-31 00:08:56,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2023-03-31 00:08:56,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 80 states have internal predecessors, (90), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:08:56,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions. [2023-03-31 00:08:56,570 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 9 [2023-03-31 00:08:56,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:08:56,570 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions. [2023-03-31 00:08:56,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:08:56,571 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions. [2023-03-31 00:08:56,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-03-31 00:08:56,571 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:08:56,571 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:08:56,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-03-31 00:08:56,572 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr2ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-03-31 00:08:56,572 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:08:56,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1089446386, now seen corresponding path program 1 times [2023-03-31 00:08:56,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:08:56,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396002716] [2023-03-31 00:08:56,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:08:56,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:08:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:08:56,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:08:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:08:56,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:08:56,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:08:56,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396002716] [2023-03-31 00:08:56,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396002716] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:08:56,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:08:56,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-03-31 00:08:56,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858996136] [2023-03-31 00:08:56,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:08:56,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-31 00:08:56,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:08:56,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-31 00:08:56,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-03-31 00:08:56,629 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:08:56,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:08:56,765 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions. [2023-03-31 00:08:56,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-31 00:08:56,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2023-03-31 00:08:56,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:08:56,768 INFO L225 Difference]: With dead ends: 84 [2023-03-31 00:08:56,768 INFO L226 Difference]: Without dead ends: 74 [2023-03-31 00:08:56,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-03-31 00:08:56,769 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 153 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 00:08:56,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 12 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 00:08:56,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-03-31 00:08:56,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-03-31 00:08:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 70 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:08:56,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2023-03-31 00:08:56,781 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 10 [2023-03-31 00:08:56,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:08:56,781 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2023-03-31 00:08:56,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:08:56,782 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2023-03-31 00:08:56,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-03-31 00:08:56,782 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:08:56,782 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:08:56,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-03-31 00:08:56,783 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr1ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-03-31 00:08:56,783 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:08:56,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1376070252, now seen corresponding path program 1 times [2023-03-31 00:08:56,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:08:56,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515981335] [2023-03-31 00:08:56,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:08:56,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:08:56,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:08:57,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:08:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:08:57,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:08:57,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:08:57,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515981335] [2023-03-31 00:08:57,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515981335] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:08:57,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:08:57,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-03-31 00:08:57,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880477707] [2023-03-31 00:08:57,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:08:57,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-31 00:08:57,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:08:57,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-31 00:08:57,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-03-31 00:08:57,259 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:08:57,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:08:57,461 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2023-03-31 00:08:57,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-03-31 00:08:57,462 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-03-31 00:08:57,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:08:57,466 INFO L225 Difference]: With dead ends: 123 [2023-03-31 00:08:57,466 INFO L226 Difference]: Without dead ends: 121 [2023-03-31 00:08:57,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-03-31 00:08:57,469 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 288 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 00:08:57,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 16 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 00:08:57,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-03-31 00:08:57,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 72. [2023-03-31 00:08:57,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 61 states have (on average 1.278688524590164) internal successors, (78), 68 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:08:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2023-03-31 00:08:57,495 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 13 [2023-03-31 00:08:57,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:08:57,495 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2023-03-31 00:08:57,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:08:57,496 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2023-03-31 00:08:57,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-03-31 00:08:57,497 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:08:57,497 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:08:57,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-03-31 00:08:57,500 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-03-31 00:08:57,500 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:08:57,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1443269219, now seen corresponding path program 1 times [2023-03-31 00:08:57,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:08:57,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855145844] [2023-03-31 00:08:57,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:08:57,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:08:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:08:57,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:08:57,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:08:57,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:08:57,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:08:57,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855145844] [2023-03-31 00:08:57,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855145844] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:08:57,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:08:57,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-03-31 00:08:57,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443965689] [2023-03-31 00:08:57,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:08:57,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-31 00:08:57,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:08:57,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-31 00:08:57,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-03-31 00:08:57,556 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:08:57,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:08:57,686 INFO L93 Difference]: Finished difference Result 157 states and 182 transitions. [2023-03-31 00:08:57,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-31 00:08:57,686 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2023-03-31 00:08:57,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:08:57,687 INFO L225 Difference]: With dead ends: 157 [2023-03-31 00:08:57,688 INFO L226 Difference]: Without dead ends: 91 [2023-03-31 00:08:57,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-03-31 00:08:57,690 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 115 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 00:08:57,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 12 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 00:08:57,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-03-31 00:08:57,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 80. [2023-03-31 00:08:57,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 76 states have internal predecessors, (87), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:08:57,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2023-03-31 00:08:57,711 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 16 [2023-03-31 00:08:57,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:08:57,711 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2023-03-31 00:08:57,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:08:57,711 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2023-03-31 00:08:57,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-03-31 00:08:57,712 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:08:57,712 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:08:57,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-03-31 00:08:57,712 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-03-31 00:08:57,713 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:08:57,713 INFO L85 PathProgramCache]: Analyzing trace with hash -811880030, now seen corresponding path program 1 times [2023-03-31 00:08:57,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:08:57,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252734711] [2023-03-31 00:08:57,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:08:57,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:08:57,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:08:57,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:08:57,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:08:57,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:08:57,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:08:57,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252734711] [2023-03-31 00:08:57,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252734711] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:08:57,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:08:57,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-03-31 00:08:57,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123610211] [2023-03-31 00:08:57,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:08:57,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-31 00:08:57,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:08:57,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-31 00:08:57,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-03-31 00:08:57,776 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:08:57,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:08:57,873 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions. [2023-03-31 00:08:57,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-31 00:08:57,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-03-31 00:08:57,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:08:57,877 INFO L225 Difference]: With dead ends: 83 [2023-03-31 00:08:57,877 INFO L226 Difference]: Without dead ends: 81 [2023-03-31 00:08:57,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-03-31 00:08:57,878 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 77 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 00:08:57,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 12 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 00:08:57,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-03-31 00:08:57,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-03-31 00:08:57,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 70 states have (on average 1.2571428571428571) internal successors, (88), 77 states have internal predecessors, (88), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:08:57,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions. [2023-03-31 00:08:57,889 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 21 [2023-03-31 00:08:57,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:08:57,889 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions. [2023-03-31 00:08:57,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:08:57,889 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions. [2023-03-31 00:08:57,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-03-31 00:08:57,890 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:08:57,891 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:08:57,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-03-31 00:08:57,891 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-03-31 00:08:57,891 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:08:57,892 INFO L85 PathProgramCache]: Analyzing trace with hash -811878108, now seen corresponding path program 1 times [2023-03-31 00:08:57,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:08:57,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516491407] [2023-03-31 00:08:57,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:08:57,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:08:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:08:57,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:08:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:08:57,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:08:57,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:08:57,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516491407] [2023-03-31 00:08:57,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516491407] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:08:57,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:08:57,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-03-31 00:08:57,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980350807] [2023-03-31 00:08:57,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:08:57,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-03-31 00:08:57,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:08:57,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-03-31 00:08:57,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-03-31 00:08:57,938 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:08:58,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:08:58,074 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions. [2023-03-31 00:08:58,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-03-31 00:08:58,074 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2023-03-31 00:08:58,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:08:58,075 INFO L225 Difference]: With dead ends: 101 [2023-03-31 00:08:58,075 INFO L226 Difference]: Without dead ends: 76 [2023-03-31 00:08:58,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-03-31 00:08:58,076 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 104 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 00:08:58,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 17 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 00:08:58,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-03-31 00:08:58,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-03-31 00:08:58,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 72 states have internal predecessors, (82), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:08:58,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions. [2023-03-31 00:08:58,083 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 21 [2023-03-31 00:08:58,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:08:58,083 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions. [2023-03-31 00:08:58,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:08:58,083 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2023-03-31 00:08:58,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-03-31 00:08:58,085 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:08:58,085 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:08:58,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-03-31 00:08:58,086 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-03-31 00:08:58,086 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:08:58,086 INFO L85 PathProgramCache]: Analyzing trace with hash 480843432, now seen corresponding path program 1 times [2023-03-31 00:08:58,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:08:58,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123063314] [2023-03-31 00:08:58,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:08:58,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:08:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:08:58,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:08:58,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:08:58,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:08:58,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:08:58,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123063314] [2023-03-31 00:08:58,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123063314] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 00:08:58,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486071179] [2023-03-31 00:08:58,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:08:58,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:08:58,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:08:58,485 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) [2023-03-31 00:08:58,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-03-31 00:08:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:08:58,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 29 conjunts are in the unsatisfiable core [2023-03-31 00:08:58,620 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:08:58,665 INFO L350 Elim1Store]: Elim1 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 [2023-03-31 00:08:58,708 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-03-31 00:08:58,724 INFO L321 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2023-03-31 00:08:58,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 53 [2023-03-31 00:08:58,735 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-03-31 00:08:58,735 INFO L350 Elim1Store]: Elim1 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 15 treesize of output 15 [2023-03-31 00:08:58,761 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-03-31 00:08:58,762 INFO L350 Elim1Store]: Elim1 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 [2023-03-31 00:08:58,833 INFO L350 Elim1Store]: Elim1 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 [2023-03-31 00:08:58,836 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:08:58,837 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 00:08:58,913 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:08:58,913 INFO L350 Elim1Store]: Elim1 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 37 treesize of output 30 [2023-03-31 00:08:58,921 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:08:58,921 INFO L350 Elim1Store]: Elim1 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 190 treesize of output 133 [2023-03-31 00:08:58,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 68 [2023-03-31 00:08:58,950 INFO L350 Elim1Store]: Elim1 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 68 treesize of output 64 [2023-03-31 00:08:58,970 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 62 [2023-03-31 00:08:59,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:08:59,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486071179] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 00:08:59,100 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 00:08:59,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2023-03-31 00:08:59,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393517458] [2023-03-31 00:08:59,100 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 00:08:59,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-03-31 00:08:59,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:08:59,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-03-31 00:08:59,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=97, Unknown=4, NotChecked=0, Total=132 [2023-03-31 00:08:59,102 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:08:59,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:08:59,492 INFO L93 Difference]: Finished difference Result 151 states and 168 transitions. [2023-03-31 00:08:59,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-03-31 00:08:59,492 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2023-03-31 00:08:59,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:08:59,494 INFO L225 Difference]: With dead ends: 151 [2023-03-31 00:08:59,494 INFO L226 Difference]: Without dead ends: 149 [2023-03-31 00:08:59,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=174, Unknown=4, NotChecked=0, Total=240 [2023-03-31 00:08:59,495 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 405 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-03-31 00:08:59,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 35 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-03-31 00:08:59,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2023-03-31 00:08:59,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 89. [2023-03-31 00:08:59,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 78 states have (on average 1.2435897435897436) internal successors, (97), 85 states have internal predecessors, (97), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:08:59,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2023-03-31 00:08:59,507 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 23 [2023-03-31 00:08:59,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:08:59,508 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2023-03-31 00:08:59,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 11 states have internal predecessors, (41), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:08:59,508 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2023-03-31 00:08:59,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-03-31 00:08:59,512 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:08:59,512 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:08:59,523 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-03-31 00:08:59,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:08:59,723 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-03-31 00:08:59,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:08:59,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1956013058, now seen corresponding path program 1 times [2023-03-31 00:08:59,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:08:59,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243436473] [2023-03-31 00:08:59,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:08:59,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:08:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:08:59,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:08:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:08:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:08:59,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:08:59,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243436473] [2023-03-31 00:08:59,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243436473] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:08:59,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:08:59,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-03-31 00:08:59,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540192812] [2023-03-31 00:08:59,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:08:59,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-31 00:08:59,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:08:59,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-31 00:08:59,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-03-31 00:08:59,762 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:08:59,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:08:59,897 INFO L93 Difference]: Finished difference Result 181 states and 209 transitions. [2023-03-31 00:08:59,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-31 00:08:59,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2023-03-31 00:08:59,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:08:59,898 INFO L225 Difference]: With dead ends: 181 [2023-03-31 00:08:59,898 INFO L226 Difference]: Without dead ends: 114 [2023-03-31 00:08:59,899 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-03-31 00:08:59,899 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 126 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 00:08:59,900 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 12 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 00:08:59,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-03-31 00:08:59,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2023-03-31 00:08:59,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 91 states have (on average 1.2087912087912087) internal successors, (110), 98 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:08:59,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 113 transitions. [2023-03-31 00:08:59,908 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 113 transitions. Word has length 24 [2023-03-31 00:08:59,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:08:59,908 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 113 transitions. [2023-03-31 00:08:59,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:08:59,909 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 113 transitions. [2023-03-31 00:08:59,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-03-31 00:08:59,909 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:08:59,909 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:08:59,909 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-03-31 00:08:59,909 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr4ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-03-31 00:08:59,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:08:59,910 INFO L85 PathProgramCache]: Analyzing trace with hash -2123760808, now seen corresponding path program 1 times [2023-03-31 00:08:59,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:08:59,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843298546] [2023-03-31 00:08:59,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:08:59,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:08:59,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:08:59,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:08:59,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:08:59,966 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-03-31 00:08:59,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:08:59,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843298546] [2023-03-31 00:08:59,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843298546] provided 1 perfect and 0 imperfect interpolant sequences [2023-03-31 00:08:59,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-03-31 00:08:59,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-03-31 00:08:59,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993102699] [2023-03-31 00:08:59,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-03-31 00:08:59,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-03-31 00:08:59,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:08:59,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-03-31 00:08:59,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-03-31 00:08:59,968 INFO L87 Difference]: Start difference. First operand 102 states and 113 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:00,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:09:00,098 INFO L93 Difference]: Finished difference Result 208 states and 238 transitions. [2023-03-31 00:09:00,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-03-31 00:09:00,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2023-03-31 00:09:00,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:09:00,100 INFO L225 Difference]: With dead ends: 208 [2023-03-31 00:09:00,100 INFO L226 Difference]: Without dead ends: 128 [2023-03-31 00:09:00,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-03-31 00:09:00,100 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 111 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-03-31 00:09:00,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 12 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-03-31 00:09:00,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-03-31 00:09:00,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 115. [2023-03-31 00:09:00,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 104 states have (on average 1.1923076923076923) internal successors, (124), 111 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:00,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2023-03-31 00:09:00,109 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 31 [2023-03-31 00:09:00,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:09:00,109 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2023-03-31 00:09:00,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:00,109 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2023-03-31 00:09:00,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-03-31 00:09:00,110 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:09:00,110 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:09:00,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-03-31 00:09:00,110 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr6ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-03-31 00:09:00,110 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:09:00,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1094365874, now seen corresponding path program 1 times [2023-03-31 00:09:00,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:09:00,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182035143] [2023-03-31 00:09:00,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:09:00,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:09:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:00,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:09:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:00,821 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:09:00,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:09:00,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182035143] [2023-03-31 00:09:00,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182035143] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 00:09:00,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454079171] [2023-03-31 00:09:00,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:09:00,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:09:00,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:09:00,823 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) [2023-03-31 00:09:00,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-03-31 00:09:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:00,971 INFO L262 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 50 conjunts are in the unsatisfiable core [2023-03-31 00:09:00,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:09:00,979 INFO L350 Elim1Store]: Elim1 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 [2023-03-31 00:09:01,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2023-03-31 00:09:01,036 INFO L321 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2023-03-31 00:09:01,036 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 61 [2023-03-31 00:09:01,043 INFO L350 Elim1Store]: Elim1 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 [2023-03-31 00:09:01,059 INFO L321 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2023-03-31 00:09:01,060 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 29 [2023-03-31 00:09:01,094 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-03-31 00:09:01,094 INFO L350 Elim1Store]: Elim1 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 39 treesize of output 35 [2023-03-31 00:09:01,193 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-03-31 00:09:01,193 INFO L350 Elim1Store]: Elim1 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 50 [2023-03-31 00:09:01,219 INFO L321 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2023-03-31 00:09:01,219 INFO L350 Elim1Store]: Elim1 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 4 case distinctions, treesize of input 106 treesize of output 80 [2023-03-31 00:09:01,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2023-03-31 00:09:01,240 INFO L321 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2023-03-31 00:09:01,240 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 38 [2023-03-31 00:09:01,295 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-03-31 00:09:01,295 INFO L350 Elim1Store]: Elim1 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 59 treesize of output 52 [2023-03-31 00:09:01,431 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-03-31 00:09:01,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2023-03-31 00:09:01,434 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:09:01,435 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 00:09:01,540 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:01,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2023-03-31 00:09:01,547 WARN L839 $PredicateComparison]: unable to prove that (forall ((main_~item~0.offset Int) (v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_756 (Array Int Int)) (v_ArrVal_767 (Array Int Int)) (v_ArrVal_761 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_5 main_~item~0.offset))) (or (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_main_~item~0.base v_arrayElimArr_5))) (store (store .cse0 .cse1 v_ArrVal_761) (select (select (store .cse0 .cse1 v_ArrVal_756) c_main_~item~0.base) main_~item~0.offset) v_ArrVal_767)) c_main_~head~0.base) c_main_~head~0.offset) 0)) (not (= (select |c_#valid| .cse1) 0))))) is different from false [2023-03-31 00:09:01,561 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:01,561 INFO L350 Elim1Store]: Elim1 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 98 treesize of output 67 [2023-03-31 00:09:01,574 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:01,574 INFO L350 Elim1Store]: Elim1 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 11651 treesize of output 8250 [2023-03-31 00:09:01,886 INFO L350 Elim1Store]: Elim1 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 1866 treesize of output 1710 [2023-03-31 00:09:01,913 INFO L350 Elim1Store]: Elim1 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 1710 treesize of output 1690 [2023-03-31 00:09:01,940 INFO L350 Elim1Store]: Elim1 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 1690 treesize of output 1650 [2023-03-31 00:09:01,966 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:01,967 INFO L350 Elim1Store]: Elim1 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 1662 treesize of output 1468 [2023-03-31 00:09:01,988 INFO L350 Elim1Store]: Elim1 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 1450 treesize of output 1402 [2023-03-31 00:09:02,011 INFO L350 Elim1Store]: Elim1 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 1402 treesize of output 1396 [2023-03-31 00:09:02,381 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-03-31 00:09:02,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454079171] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 00:09:02,381 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 00:09:02,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 8] total 18 [2023-03-31 00:09:02,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760000666] [2023-03-31 00:09:02,382 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 00:09:02,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-03-31 00:09:02,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:09:02,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-03-31 00:09:02,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=212, Unknown=7, NotChecked=30, Total=306 [2023-03-31 00:09:02,383 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:04,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-03-31 00:09:06,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-03-31 00:09:08,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-03-31 00:09:09,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:09:09,375 INFO L93 Difference]: Finished difference Result 181 states and 201 transitions. [2023-03-31 00:09:09,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-03-31 00:09:09,376 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2023-03-31 00:09:09,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:09:09,377 INFO L225 Difference]: With dead ends: 181 [2023-03-31 00:09:09,377 INFO L226 Difference]: Without dead ends: 179 [2023-03-31 00:09:09,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=608, Unknown=7, NotChecked=54, Total=870 [2023-03-31 00:09:09,377 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 668 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 792 mSolverCounterSat, 47 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 668 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 792 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2023-03-31 00:09:09,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [668 Valid, 43 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 792 Invalid, 3 Unknown, 174 Unchecked, 6.6s Time] [2023-03-31 00:09:09,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-03-31 00:09:09,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 113. [2023-03-31 00:09:09,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 103 states have (on average 1.1844660194174756) internal successors, (122), 109 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:09,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2023-03-31 00:09:09,388 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 32 [2023-03-31 00:09:09,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:09:09,388 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2023-03-31 00:09:09,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.7222222222222223) internal successors, (67), 17 states have internal predecessors, (67), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:09,388 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2023-03-31 00:09:09,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-03-31 00:09:09,389 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:09:09,389 INFO L195 NwaCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1] [2023-03-31 00:09:09,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-03-31 00:09:09,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-03-31 00:09:09,594 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr13ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-03-31 00:09:09,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:09:09,595 INFO L85 PathProgramCache]: Analyzing trace with hash 303285182, now seen corresponding path program 1 times [2023-03-31 00:09:09,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:09:09,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940142589] [2023-03-31 00:09:09,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:09:09,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:09:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:10,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:09:10,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:10,269 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:09:10,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:09:10,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940142589] [2023-03-31 00:09:10,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940142589] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 00:09:10,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302693798] [2023-03-31 00:09:10,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:09:10,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:09:10,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:09:10,270 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) [2023-03-31 00:09:10,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-03-31 00:09:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:10,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 45 conjunts are in the unsatisfiable core [2023-03-31 00:09:10,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:09:10,438 INFO L350 Elim1Store]: Elim1 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 [2023-03-31 00:09:10,464 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 27 [2023-03-31 00:09:10,468 INFO L350 Elim1Store]: Elim1 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 44 treesize of output 35 [2023-03-31 00:09:10,481 INFO L321 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2023-03-31 00:09:10,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 70 [2023-03-31 00:09:10,490 INFO L350 Elim1Store]: Elim1 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 [2023-03-31 00:09:10,510 INFO L321 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2023-03-31 00:09:10,510 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 51 treesize of output 69 [2023-03-31 00:09:10,515 INFO L350 Elim1Store]: Elim1 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 [2023-03-31 00:09:10,521 INFO L350 Elim1Store]: Elim1 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 [2023-03-31 00:09:10,529 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-03-31 00:09:10,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-03-31 00:09:10,549 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-03-31 00:09:10,550 INFO L350 Elim1Store]: Elim1 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 [2023-03-31 00:09:10,554 INFO L350 Elim1Store]: Elim1 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 [2023-03-31 00:09:10,560 INFO L350 Elim1Store]: Elim1 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 [2023-03-31 00:09:10,691 INFO L173 IndexEqualityManager]: detected equality via solver [2023-03-31 00:09:10,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-03-31 00:09:10,695 INFO L350 Elim1Store]: Elim1 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 [2023-03-31 00:09:10,738 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-03-31 00:09:10,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:09:10,741 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 00:09:10,792 INFO L350 Elim1Store]: Elim1 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 72 treesize of output 52 [2023-03-31 00:09:10,797 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_926 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| c_main_~item~0.base v_ArrVal_926) c_main_~head~0.base) c_main_~head~0.offset) c_main_~item~0.offset)) (forall ((v_ArrVal_924 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| c_main_~item~0.base v_ArrVal_924) c_main_~head~0.base) c_main_~head~0.offset) c_main_~item~0.base))) is different from false [2023-03-31 00:09:10,832 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:10,833 INFO L350 Elim1Store]: Elim1 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 103 treesize of output 96 [2023-03-31 00:09:10,839 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:10,840 INFO L350 Elim1Store]: Elim1 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 87 treesize of output 64 [2023-03-31 00:09:10,850 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:10,850 INFO L350 Elim1Store]: Elim1 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 315 treesize of output 230 [2023-03-31 00:09:10,868 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:10,869 INFO L350 Elim1Store]: Elim1 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 320 treesize of output 287 [2023-03-31 00:09:10,885 INFO L350 Elim1Store]: Elim1 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 181 treesize of output 173 [2023-03-31 00:09:10,916 INFO L350 Elim1Store]: Elim1 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 173 treesize of output 167 [2023-03-31 00:09:10,923 INFO L350 Elim1Store]: Elim1 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 167 treesize of output 165 [2023-03-31 00:09:10,927 INFO L350 Elim1Store]: Elim1 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 165 treesize of output 163 [2023-03-31 00:09:10,932 INFO L350 Elim1Store]: Elim1 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 163 treesize of output 157 [2023-03-31 00:09:10,949 INFO L350 Elim1Store]: Elim1 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 157 treesize of output 137 [2023-03-31 00:09:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:09:11,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302693798] provided 0 perfect and 2 imperfect interpolant sequences [2023-03-31 00:09:11,028 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-03-31 00:09:11,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2023-03-31 00:09:11,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042229961] [2023-03-31 00:09:11,028 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-03-31 00:09:11,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-03-31 00:09:11,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-03-31 00:09:11,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-03-31 00:09:11,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=178, Unknown=1, NotChecked=26, Total=240 [2023-03-31 00:09:11,029 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 16 states, 16 states have (on average 5.0) internal successors, (80), 15 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:15,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-03-31 00:09:15,970 INFO L93 Difference]: Finished difference Result 192 states and 212 transitions. [2023-03-31 00:09:15,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-03-31 00:09:15,971 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.0) internal successors, (80), 15 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2023-03-31 00:09:15,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-03-31 00:09:15,971 INFO L225 Difference]: With dead ends: 192 [2023-03-31 00:09:15,972 INFO L226 Difference]: Without dead ends: 190 [2023-03-31 00:09:15,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=122, Invalid=433, Unknown=1, NotChecked=44, Total=600 [2023-03-31 00:09:15,972 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 401 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 401 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 1023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 174 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-03-31 00:09:15,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [401 Valid, 48 Invalid, 1023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 832 Invalid, 0 Unknown, 174 Unchecked, 0.5s Time] [2023-03-31 00:09:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-03-31 00:09:15,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 122. [2023-03-31 00:09:15,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 112 states have (on average 1.1875) internal successors, (133), 118 states have internal predecessors, (133), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:15,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 136 transitions. [2023-03-31 00:09:15,986 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 136 transitions. Word has length 33 [2023-03-31 00:09:15,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-03-31 00:09:15,987 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 136 transitions. [2023-03-31 00:09:15,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.0) internal successors, (80), 15 states have internal predecessors, (80), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-03-31 00:09:15,987 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 136 transitions. [2023-03-31 00:09:15,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-03-31 00:09:15,987 INFO L187 NwaCegarLoop]: Found error trace [2023-03-31 00:09:15,987 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-03-31 00:09:15,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-03-31 00:09:16,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:09:16,194 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr7ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION (and 10 more)] === [2023-03-31 00:09:16,195 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-03-31 00:09:16,195 INFO L85 PathProgramCache]: Analyzing trace with hash 847066109, now seen corresponding path program 1 times [2023-03-31 00:09:16,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-03-31 00:09:16,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415986162] [2023-03-31 00:09:16,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:09:16,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-03-31 00:09:16,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:17,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-03-31 00:09:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:17,269 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:09:17,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-03-31 00:09:17,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415986162] [2023-03-31 00:09:17,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415986162] provided 0 perfect and 1 imperfect interpolant sequences [2023-03-31 00:09:17,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084271240] [2023-03-31 00:09:17,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-03-31 00:09:17,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-03-31 00:09:17,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-03-31 00:09:17,283 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) [2023-03-31 00:09:17,284 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-03-31 00:09:17,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-03-31 00:09:17,445 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 73 conjunts are in the unsatisfiable core [2023-03-31 00:09:17,450 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-03-31 00:09:17,458 INFO L350 Elim1Store]: Elim1 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 [2023-03-31 00:09:17,496 INFO L350 Elim1Store]: Elim1 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 36 treesize of output 27 [2023-03-31 00:09:17,503 INFO L350 Elim1Store]: Elim1 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 44 treesize of output 35 [2023-03-31 00:09:17,518 INFO L321 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2023-03-31 00:09:17,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 78 [2023-03-31 00:09:17,527 INFO L350 Elim1Store]: Elim1 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 [2023-03-31 00:09:17,552 INFO L321 Elim1Store]: treesize reduction 48, result has 39.2 percent of original size [2023-03-31 00:09:17,552 INFO L350 Elim1Store]: Elim1 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 2 case distinctions, treesize of input 51 treesize of output 69 [2023-03-31 00:09:17,565 INFO L350 Elim1Store]: Elim1 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 [2023-03-31 00:09:17,580 INFO L321 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2023-03-31 00:09:17,580 INFO L350 Elim1Store]: Elim1 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 25 treesize of output 29 [2023-03-31 00:09:17,620 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-03-31 00:09:17,620 INFO L350 Elim1Store]: Elim1 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 [2023-03-31 00:09:17,635 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-03-31 00:09:17,635 INFO L350 Elim1Store]: Elim1 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 31 treesize of output 29 [2023-03-31 00:09:17,754 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-03-31 00:09:17,755 INFO L350 Elim1Store]: Elim1 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 89 treesize of output 58 [2023-03-31 00:09:17,781 INFO L321 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2023-03-31 00:09:17,781 INFO L350 Elim1Store]: Elim1 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 4 case distinctions, treesize of input 134 treesize of output 96 [2023-03-31 00:09:17,797 INFO L321 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2023-03-31 00:09:17,797 INFO L350 Elim1Store]: Elim1 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 28 treesize of output 38 [2023-03-31 00:09:17,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-03-31 00:09:17,829 INFO L321 Elim1Store]: treesize reduction 54, result has 49.1 percent of original size [2023-03-31 00:09:17,830 INFO L350 Elim1Store]: Elim1 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 3 case distinctions, treesize of input 32 treesize of output 62 [2023-03-31 00:09:17,893 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-03-31 00:09:17,894 INFO L350 Elim1Store]: Elim1 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 [2023-03-31 00:09:17,900 INFO L350 Elim1Store]: Elim1 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 [2023-03-31 00:09:18,051 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-03-31 00:09:18,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2023-03-31 00:09:18,057 INFO L350 Elim1Store]: Elim1 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 [2023-03-31 00:09:18,058 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-03-31 00:09:18,058 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-03-31 00:09:18,089 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1212 (Array Int Int)) (v_ArrVal_1211 (Array Int Int))) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| c_main_~item~0.base v_ArrVal_1212))) (select .cse0 (select (select .cse0 c_main_~head~0.base) c_main_~head~0.offset))) (select (select (store |c_#memory_$Pointer$.offset| c_main_~item~0.base v_ArrVal_1211) c_main_~head~0.base) c_main_~head~0.offset)) 0))) is different from false [2023-03-31 00:09:18,108 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1204 (Array Int Int)) (v_ArrVal_1201 (Array Int Int)) (v_ArrVal_1212 (Array Int Int)) (v_ArrVal_1211 (Array Int Int)) (v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1197 (Array Int Int)) (v_ArrVal_1208 Int)) (or (not (= (let ((.cse1 (store |c_#memory_$Pointer$.base| c_main_~item~0.base (store (select |c_#memory_$Pointer$.base| c_main_~item~0.base) c_main_~item~0.offset v_ArrVal_1208)))) (let ((.cse2 (select (select (store .cse1 v_ArrVal_1208 v_ArrVal_1197) c_main_~item~0.base) c_main_~item~0.offset))) (select (let ((.cse0 (store (store .cse1 v_ArrVal_1208 v_ArrVal_1201) .cse2 v_ArrVal_1212))) (select .cse0 (select (select .cse0 c_main_~head~0.base) c_main_~head~0.offset))) (select (select (store (store (store |c_#memory_$Pointer$.offset| c_main_~item~0.base v_ArrVal_1204) v_ArrVal_1208 v_ArrVal_1199) .cse2 v_ArrVal_1211) c_main_~head~0.base) c_main_~head~0.offset)))) 0)) (= v_ArrVal_1208 0) (not (= (select |c_#valid| v_ArrVal_1208) 0)))) is different from false [2023-03-31 00:09:18,174 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:18,174 INFO L350 Elim1Store]: Elim1 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 88 treesize of output 80 [2023-03-31 00:09:18,186 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1204 (Array Int Int)) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_1201 (Array Int Int)) (v_ArrVal_1212 (Array Int Int)) (v_ArrVal_1211 (Array Int Int)) (v_ArrVal_1199 (Array Int Int)) (v_ArrVal_1197 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_14 c_main_~item~0.offset))) (or (not (= (select |c_#valid| .cse0) 0)) (= .cse0 0) (not (= (let ((.cse2 (store |c_#memory_$Pointer$.base| c_main_~item~0.base v_arrayElimArr_14))) (let ((.cse3 (select (select (store .cse2 .cse0 v_ArrVal_1197) c_main_~item~0.base) c_main_~item~0.offset))) (select (let ((.cse1 (store (store .cse2 .cse0 v_ArrVal_1201) .cse3 v_ArrVal_1212))) (select .cse1 (select (select .cse1 c_main_~head~0.base) c_main_~head~0.offset))) (select (select (store (store (store |c_#memory_$Pointer$.offset| c_main_~item~0.base v_ArrVal_1204) .cse0 v_ArrVal_1199) .cse3 v_ArrVal_1211) c_main_~head~0.base) c_main_~head~0.offset)))) 0))))) is different from false [2023-03-31 00:09:18,203 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:18,204 INFO L350 Elim1Store]: Elim1 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 468 treesize of output 380 [2023-03-31 00:09:18,211 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:18,212 INFO L350 Elim1Store]: Elim1 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 341 treesize of output 238 [2023-03-31 00:09:20,280 INFO L321 Elim1Store]: treesize reduction 1174, result has 38.2 percent of original size [2023-03-31 00:09:20,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 18 select indices, 18 select index equivalence classes, 0 disjoint index pairs (out of 153 index pairs), introduced 23 new quantified variables, introduced 153 case distinctions, treesize of input 476824 treesize of output 364622 [2023-03-31 00:09:32,882 WARN L223 SmtUtils]: Spent 12.59s on a formula simplification. DAG size of input: 1886 DAG size of output: 983 (called from [L 809] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-03-31 00:09:33,535 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:09:33,539 INFO L350 Elim1Store]: Elim1 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 444580 treesize of output 377187 [2023-03-31 00:09:56,570 WARN L223 SmtUtils]: Spent 23.02s on a formula simplification. DAG size of input: 2483 DAG size of output: 1710 (called from [L 809] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-03-31 00:09:58,427 INFO L350 Elim1Store]: Elim1 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 88606 treesize of output 84930 [2023-03-31 00:10:00,289 INFO L350 Elim1Store]: Elim1 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 97684 treesize of output 89568 [2023-03-31 00:10:02,367 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-03-31 00:10:02,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 89668 treesize of output 79302