./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-buckets-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5317dae Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-buckets-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:35:44,427 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:35:44,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:35:44,460 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:35:44,460 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:35:44,463 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:35:44,465 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:35:44,467 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:35:44,469 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:35:44,473 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:35:44,474 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:35:44,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:35:44,477 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:35:44,478 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:35:44,479 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:35:44,481 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:35:44,481 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:35:44,484 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:35:44,485 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:35:44,487 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:35:44,488 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:35:44,489 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:35:44,490 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:35:44,490 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:35:44,499 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:35:44,499 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:35:44,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:35:44,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:35:44,501 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:35:44,502 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:35:44,502 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:35:44,503 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:35:44,504 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:35:44,505 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:35:44,506 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:35:44,507 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:35:44,507 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:35:44,507 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:35:44,507 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:35:44,508 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:35:44,509 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:35:44,510 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-16 03:35:44,536 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:35:44,537 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:35:44,537 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:35:44,537 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:35:44,538 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:35:44,538 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:35:44,539 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:35:44,539 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:35:44,539 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:35:44,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:35:44,540 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:35:44,540 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:35:44,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:35:44,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:35:44,541 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:35:44,541 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:35:44,541 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:35:44,541 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:35:44,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:35:44,541 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:35:44,542 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:35:44,542 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:35:44,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:35:44,542 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:35:44,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:35:44,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:35:44,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:35:44,543 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:35:44,543 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:35:44,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:35:44,543 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:35:44,543 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:35:44,544 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:35:44,544 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:35:44,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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c6b726a83620fff2a21a6dbfdec50e244c1786dd86dd76b1719515a59b3627ac [2023-02-16 03:35:44,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:35:44,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:35:44,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:35:44,798 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:35:44,799 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:35:44,800 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-buckets-1.i [2023-02-16 03:35:45,892 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:35:46,116 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:35:46,118 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-buckets-1.i [2023-02-16 03:35:46,132 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8ee25199/f320ede894854f64a9880e234b3a9a2e/FLAG7ee9b5e63 [2023-02-16 03:35:46,147 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8ee25199/f320ede894854f64a9880e234b3a9a2e [2023-02-16 03:35:46,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:35:46,151 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:35:46,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:35:46,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:35:46,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:35:46,157 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:35:46" (1/1) ... [2023-02-16 03:35:46,158 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dede5d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:46, skipping insertion in model container [2023-02-16 03:35:46,158 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:35:46" (1/1) ... [2023-02-16 03:35:46,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:35:46,213 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:35:46,503 WARN L237 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/sll-buckets-1.i[22663,22676] [2023-02-16 03:35:46,508 WARN L237 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/sll-buckets-1.i[22734,22747] [2023-02-16 03:35:46,510 WARN L237 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/sll-buckets-1.i[22862,22875] [2023-02-16 03:35:46,516 WARN L237 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/sll-buckets-1.i[23275,23288] [2023-02-16 03:35:46,519 WARN L237 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/sll-buckets-1.i[23364,23377] [2023-02-16 03:35:46,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:35:46,537 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:35:46,586 WARN L237 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/sll-buckets-1.i[22663,22676] [2023-02-16 03:35:46,591 WARN L237 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/sll-buckets-1.i[22734,22747] [2023-02-16 03:35:46,594 WARN L237 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/sll-buckets-1.i[22862,22875] [2023-02-16 03:35:46,597 WARN L237 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/sll-buckets-1.i[23275,23288] [2023-02-16 03:35:46,598 WARN L237 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/sll-buckets-1.i[23364,23377] [2023-02-16 03:35:46,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:35:46,627 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:35:46,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:46 WrapperNode [2023-02-16 03:35:46,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:35:46,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:35:46,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:35:46,629 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:35:46,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:46" (1/1) ... [2023-02-16 03:35:46,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:46" (1/1) ... [2023-02-16 03:35:46,683 INFO L138 Inliner]: procedures = 119, calls = 42, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 161 [2023-02-16 03:35:46,684 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:35:46,684 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:35:46,684 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:35:46,685 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:35:46,693 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:46" (1/1) ... [2023-02-16 03:35:46,693 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:46" (1/1) ... [2023-02-16 03:35:46,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:46" (1/1) ... [2023-02-16 03:35:46,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:46" (1/1) ... [2023-02-16 03:35:46,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:46" (1/1) ... [2023-02-16 03:35:46,707 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:46" (1/1) ... [2023-02-16 03:35:46,717 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:46" (1/1) ... [2023-02-16 03:35:46,725 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:46" (1/1) ... [2023-02-16 03:35:46,728 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:35:46,729 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:35:46,729 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:35:46,729 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:35:46,730 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:46" (1/1) ... [2023-02-16 03:35:46,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:35:46,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:35:46,759 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-02-16 03:35:46,770 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-02-16 03:35:46,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 03:35:46,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 03:35:46,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:35:46,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:35:46,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 03:35:46,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 03:35:46,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 03:35:46,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 03:35:46,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:35:46,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:35:46,897 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:35:46,899 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:35:47,290 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:35:47,296 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:35:47,296 INFO L300 CfgBuilder]: Removed 15 assume(true) statements. [2023-02-16 03:35:47,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:35:47 BoogieIcfgContainer [2023-02-16 03:35:47,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:35:47,301 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:35:47,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:35:47,304 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:35:47,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:35:46" (1/3) ... [2023-02-16 03:35:47,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522b62aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:35:47, skipping insertion in model container [2023-02-16 03:35:47,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:46" (2/3) ... [2023-02-16 03:35:47,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@522b62aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:35:47, skipping insertion in model container [2023-02-16 03:35:47,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:35:47" (3/3) ... [2023-02-16 03:35:47,307 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-buckets-1.i [2023-02-16 03:35:47,322 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:35:47,323 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 72 error locations. [2023-02-16 03:35:47,395 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:35:47,402 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@1af38bd4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:35:47,403 INFO L358 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2023-02-16 03:35:47,422 INFO L276 IsEmpty]: Start isEmpty. Operand has 155 states, 82 states have (on average 2.2195121951219514) internal successors, (182), 154 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:47,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-16 03:35:47,428 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:47,428 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-16 03:35:47,429 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:35:47,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:47,435 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-16 03:35:47,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:47,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872354884] [2023-02-16 03:35:47,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:47,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:47,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:47,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:47,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:47,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872354884] [2023-02-16 03:35:47,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872354884] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:47,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:47,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:35:47,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794333998] [2023-02-16 03:35:47,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:47,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:35:47,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:47,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:35:47,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:35:47,684 INFO L87 Difference]: Start difference. First operand has 155 states, 82 states have (on average 2.2195121951219514) internal successors, (182), 154 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:47,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:47,856 INFO L93 Difference]: Finished difference Result 190 states and 198 transitions. [2023-02-16 03:35:47,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:35:47,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-16 03:35:47,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:47,867 INFO L225 Difference]: With dead ends: 190 [2023-02-16 03:35:47,871 INFO L226 Difference]: Without dead ends: 186 [2023-02-16 03:35:47,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-16 03:35:47,877 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 141 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:47,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 120 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:47,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-16 03:35:47,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 149. [2023-02-16 03:35:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 81 states have (on average 1.9259259259259258) internal successors, (156), 148 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 156 transitions. [2023-02-16 03:35:47,930 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 156 transitions. Word has length 3 [2023-02-16 03:35:47,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:47,930 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 156 transitions. [2023-02-16 03:35:47,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:47,931 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 156 transitions. [2023-02-16 03:35:47,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-16 03:35:47,931 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:47,931 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-16 03:35:47,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 03:35:47,932 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:35:47,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:47,933 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-16 03:35:47,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:47,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651799153] [2023-02-16 03:35:47,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:47,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:47,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:48,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:48,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:48,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651799153] [2023-02-16 03:35:48,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651799153] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:48,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:48,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:35:48,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231573920] [2023-02-16 03:35:48,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:48,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:35:48,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:48,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:35:48,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:35:48,046 INFO L87 Difference]: Start difference. First operand 149 states and 156 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:48,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:48,174 INFO L93 Difference]: Finished difference Result 185 states and 194 transitions. [2023-02-16 03:35:48,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:35:48,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-16 03:35:48,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:48,180 INFO L225 Difference]: With dead ends: 185 [2023-02-16 03:35:48,180 INFO L226 Difference]: Without dead ends: 185 [2023-02-16 03:35:48,183 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-16 03:35:48,185 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 70 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:48,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 190 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:48,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-02-16 03:35:48,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 145. [2023-02-16 03:35:48,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 81 states have (on average 1.876543209876543) internal successors, (152), 144 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:48,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 152 transitions. [2023-02-16 03:35:48,209 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 152 transitions. Word has length 3 [2023-02-16 03:35:48,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:48,210 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 152 transitions. [2023-02-16 03:35:48,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:48,211 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 152 transitions. [2023-02-16 03:35:48,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-16 03:35:48,211 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:48,212 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:48,212 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 03:35:48,212 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:35:48,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:48,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924362, now seen corresponding path program 1 times [2023-02-16 03:35:48,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:48,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323548677] [2023-02-16 03:35:48,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:48,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:48,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:48,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:48,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323548677] [2023-02-16 03:35:48,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323548677] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:48,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:48,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:35:48,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375060579] [2023-02-16 03:35:48,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:48,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:35:48,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:48,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:35:48,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:35:48,405 INFO L87 Difference]: Start difference. First operand 145 states and 152 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:48,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:48,645 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2023-02-16 03:35:48,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:35:48,646 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-16 03:35:48,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:48,647 INFO L225 Difference]: With dead ends: 151 [2023-02-16 03:35:48,647 INFO L226 Difference]: Without dead ends: 151 [2023-02-16 03:35:48,647 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:35:48,648 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 99 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:48,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 305 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:35:48,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-16 03:35:48,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 143. [2023-02-16 03:35:48,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 90 states have (on average 1.7555555555555555) internal successors, (158), 142 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:48,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 158 transitions. [2023-02-16 03:35:48,673 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 158 transitions. Word has length 10 [2023-02-16 03:35:48,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:48,674 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 158 transitions. [2023-02-16 03:35:48,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:48,674 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 158 transitions. [2023-02-16 03:35:48,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-16 03:35:48,675 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:48,675 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:48,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 03:35:48,676 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:35:48,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:48,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924363, now seen corresponding path program 1 times [2023-02-16 03:35:48,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:48,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772842219] [2023-02-16 03:35:48,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:48,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:48,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:48,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:48,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772842219] [2023-02-16 03:35:48,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772842219] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:48,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:48,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:35:48,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588918536] [2023-02-16 03:35:48,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:48,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:35:48,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:48,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:35:48,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:35:48,919 INFO L87 Difference]: Start difference. First operand 143 states and 158 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:49,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:49,134 INFO L93 Difference]: Finished difference Result 139 states and 154 transitions. [2023-02-16 03:35:49,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:35:49,134 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-16 03:35:49,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:49,135 INFO L225 Difference]: With dead ends: 139 [2023-02-16 03:35:49,135 INFO L226 Difference]: Without dead ends: 139 [2023-02-16 03:35:49,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:35:49,136 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 8 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:49,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 416 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:35:49,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-02-16 03:35:49,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2023-02-16 03:35:49,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 90 states have (on average 1.711111111111111) internal successors, (154), 138 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:49,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2023-02-16 03:35:49,140 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 10 [2023-02-16 03:35:49,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:49,140 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2023-02-16 03:35:49,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:49,146 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2023-02-16 03:35:49,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:35:49,146 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:49,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:49,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 03:35:49,147 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:35:49,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:49,148 INFO L85 PathProgramCache]: Analyzing trace with hash 592229104, now seen corresponding path program 1 times [2023-02-16 03:35:49,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:49,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734572860] [2023-02-16 03:35:49,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:49,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:49,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:49,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:49,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734572860] [2023-02-16 03:35:49,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734572860] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:49,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:49,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:35:49,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676640642] [2023-02-16 03:35:49,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:49,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:35:49,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:49,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:35:49,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:35:49,265 INFO L87 Difference]: Start difference. First operand 139 states and 154 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:49,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:49,468 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2023-02-16 03:35:49,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:35:49,468 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-16 03:35:49,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:49,469 INFO L225 Difference]: With dead ends: 146 [2023-02-16 03:35:49,469 INFO L226 Difference]: Without dead ends: 146 [2023-02-16 03:35:49,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:35:49,470 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 94 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 295 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:49,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 297 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 295 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:35:49,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-16 03:35:49,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 138. [2023-02-16 03:35:49,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 90 states have (on average 1.7) internal successors, (153), 137 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:49,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 153 transitions. [2023-02-16 03:35:49,474 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 153 transitions. Word has length 17 [2023-02-16 03:35:49,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:49,474 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 153 transitions. [2023-02-16 03:35:49,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:49,475 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 153 transitions. [2023-02-16 03:35:49,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:35:49,475 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:49,475 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:49,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 03:35:49,475 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:35:49,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:49,476 INFO L85 PathProgramCache]: Analyzing trace with hash 592229105, now seen corresponding path program 1 times [2023-02-16 03:35:49,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:49,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36590447] [2023-02-16 03:35:49,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:49,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:49,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:49,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:49,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36590447] [2023-02-16 03:35:49,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36590447] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:49,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:49,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:35:49,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500070876] [2023-02-16 03:35:49,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:49,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:35:49,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:49,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:35:49,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:35:49,708 INFO L87 Difference]: Start difference. First operand 138 states and 153 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:49,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:49,883 INFO L93 Difference]: Finished difference Result 138 states and 154 transitions. [2023-02-16 03:35:49,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:35:49,884 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-16 03:35:49,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:49,885 INFO L225 Difference]: With dead ends: 138 [2023-02-16 03:35:49,885 INFO L226 Difference]: Without dead ends: 138 [2023-02-16 03:35:49,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:35:49,886 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 8 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:49,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 403 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:35:49,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-02-16 03:35:49,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 135. [2023-02-16 03:35:49,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 90 states have (on average 1.6666666666666667) internal successors, (150), 134 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:49,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2023-02-16 03:35:49,889 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 17 [2023-02-16 03:35:49,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:49,889 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2023-02-16 03:35:49,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:49,889 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2023-02-16 03:35:49,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-16 03:35:49,890 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:49,890 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, 1, 1] [2023-02-16 03:35:49,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-16 03:35:49,890 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:35:49,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:49,891 INFO L85 PathProgramCache]: Analyzing trace with hash 840457529, now seen corresponding path program 1 times [2023-02-16 03:35:49,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:49,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844932285] [2023-02-16 03:35:49,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:49,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:49,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:49,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:49,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844932285] [2023-02-16 03:35:49,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844932285] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:49,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:49,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:35:49,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129079865] [2023-02-16 03:35:49,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:49,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:35:49,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:49,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:35:49,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:35:49,996 INFO L87 Difference]: Start difference. First operand 135 states and 150 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:50,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:50,062 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2023-02-16 03:35:50,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:35:50,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-16 03:35:50,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:50,064 INFO L225 Difference]: With dead ends: 141 [2023-02-16 03:35:50,064 INFO L226 Difference]: Without dead ends: 141 [2023-02-16 03:35:50,064 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-16 03:35:50,066 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 67 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:50,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 143 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:50,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-16 03:35:50,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 130. [2023-02-16 03:35:50,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 90 states have (on average 1.6111111111111112) internal successors, (145), 129 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 145 transitions. [2023-02-16 03:35:50,071 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 145 transitions. Word has length 23 [2023-02-16 03:35:50,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:50,071 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 145 transitions. [2023-02-16 03:35:50,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:50,071 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 145 transitions. [2023-02-16 03:35:50,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-16 03:35:50,073 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:50,073 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, 1, 1] [2023-02-16 03:35:50,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-16 03:35:50,073 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:35:50,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:50,074 INFO L85 PathProgramCache]: Analyzing trace with hash 840457530, now seen corresponding path program 1 times [2023-02-16 03:35:50,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:50,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772888185] [2023-02-16 03:35:50,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:50,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:50,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:50,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:50,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772888185] [2023-02-16 03:35:50,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772888185] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:50,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:50,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:35:50,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52515870] [2023-02-16 03:35:50,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:50,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:35:50,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:50,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:35:50,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:35:50,173 INFO L87 Difference]: Start difference. First operand 130 states and 145 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:50,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:50,248 INFO L93 Difference]: Finished difference Result 136 states and 152 transitions. [2023-02-16 03:35:50,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:35:50,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-16 03:35:50,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:50,250 INFO L225 Difference]: With dead ends: 136 [2023-02-16 03:35:50,251 INFO L226 Difference]: Without dead ends: 136 [2023-02-16 03:35:50,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-16 03:35:50,251 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 62 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:50,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 144 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:50,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-16 03:35:50,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 125. [2023-02-16 03:35:50,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 90 states have (on average 1.5555555555555556) internal successors, (140), 124 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:50,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 140 transitions. [2023-02-16 03:35:50,255 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 140 transitions. Word has length 23 [2023-02-16 03:35:50,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:50,256 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 140 transitions. [2023-02-16 03:35:50,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:50,256 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 140 transitions. [2023-02-16 03:35:50,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 03:35:50,257 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:50,257 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, 1, 1, 1, 1] [2023-02-16 03:35:50,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-16 03:35:50,258 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:35:50,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:50,258 INFO L85 PathProgramCache]: Analyzing trace with hash 225913191, now seen corresponding path program 1 times [2023-02-16 03:35:50,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:50,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853671142] [2023-02-16 03:35:50,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:50,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:50,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:50,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:50,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:50,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853671142] [2023-02-16 03:35:50,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853671142] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:50,437 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:50,437 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:35:50,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128874331] [2023-02-16 03:35:50,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:50,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:35:50,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:50,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:35:50,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:35:50,439 INFO L87 Difference]: Start difference. First operand 125 states and 140 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:50,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:50,552 INFO L93 Difference]: Finished difference Result 175 states and 184 transitions. [2023-02-16 03:35:50,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:35:50,553 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-16 03:35:50,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:50,554 INFO L225 Difference]: With dead ends: 175 [2023-02-16 03:35:50,554 INFO L226 Difference]: Without dead ends: 175 [2023-02-16 03:35:50,554 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-02-16 03:35:50,556 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 217 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:50,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 109 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:50,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2023-02-16 03:35:50,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 132. [2023-02-16 03:35:50,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 97 states have (on average 1.5670103092783505) internal successors, (152), 131 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:50,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 152 transitions. [2023-02-16 03:35:50,560 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 152 transitions. Word has length 25 [2023-02-16 03:35:50,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:50,562 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 152 transitions. [2023-02-16 03:35:50,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:50,562 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 152 transitions. [2023-02-16 03:35:50,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 03:35:50,563 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:50,563 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, 1, 1, 1, 1] [2023-02-16 03:35:50,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-16 03:35:50,563 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:35:50,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:50,571 INFO L85 PathProgramCache]: Analyzing trace with hash 225913192, now seen corresponding path program 1 times [2023-02-16 03:35:50,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:50,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427771965] [2023-02-16 03:35:50,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:50,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:50,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:50,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:50,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427771965] [2023-02-16 03:35:50,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427771965] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:50,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:50,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:35:50,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863929015] [2023-02-16 03:35:50,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:50,806 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:35:50,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:50,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:35:50,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:35:50,807 INFO L87 Difference]: Start difference. First operand 132 states and 152 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:50,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:50,930 INFO L93 Difference]: Finished difference Result 188 states and 217 transitions. [2023-02-16 03:35:50,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:35:50,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-16 03:35:50,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:50,933 INFO L225 Difference]: With dead ends: 188 [2023-02-16 03:35:50,933 INFO L226 Difference]: Without dead ends: 188 [2023-02-16 03:35:50,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:35:50,937 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 74 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:50,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 202 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:50,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-02-16 03:35:50,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 166. [2023-02-16 03:35:50,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 131 states have (on average 1.5725190839694656) internal successors, (206), 165 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:50,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 206 transitions. [2023-02-16 03:35:50,944 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 206 transitions. Word has length 25 [2023-02-16 03:35:50,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:50,945 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 206 transitions. [2023-02-16 03:35:50,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:50,945 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 206 transitions. [2023-02-16 03:35:50,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-16 03:35:50,946 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:50,946 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, 1, 1, 1, 1, 1] [2023-02-16 03:35:50,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-16 03:35:50,947 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr71ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:35:50,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:50,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1586624732, now seen corresponding path program 1 times [2023-02-16 03:35:50,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:50,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252152651] [2023-02-16 03:35:50,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:50,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:51,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:51,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:51,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252152651] [2023-02-16 03:35:51,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252152651] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:51,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:51,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:35:51,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394342822] [2023-02-16 03:35:51,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:51,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:35:51,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:51,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:35:51,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:35:51,019 INFO L87 Difference]: Start difference. First operand 166 states and 206 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:51,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:51,105 INFO L93 Difference]: Finished difference Result 254 states and 308 transitions. [2023-02-16 03:35:51,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:35:51,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-16 03:35:51,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:51,106 INFO L225 Difference]: With dead ends: 254 [2023-02-16 03:35:51,107 INFO L226 Difference]: Without dead ends: 254 [2023-02-16 03:35:51,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:35:51,107 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 208 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:51,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 214 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:51,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-02-16 03:35:51,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 167. [2023-02-16 03:35:51,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 133 states have (on average 1.5488721804511278) internal successors, (206), 166 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:51,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 206 transitions. [2023-02-16 03:35:51,112 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 206 transitions. Word has length 26 [2023-02-16 03:35:51,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:51,112 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 206 transitions. [2023-02-16 03:35:51,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:51,113 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 206 transitions. [2023-02-16 03:35:51,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 03:35:51,113 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:51,113 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, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:51,113 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-16 03:35:51,114 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:35:51,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:51,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1044883735, now seen corresponding path program 1 times [2023-02-16 03:35:51,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:51,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677170577] [2023-02-16 03:35:51,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:51,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:51,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:51,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:51,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:51,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677170577] [2023-02-16 03:35:51,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677170577] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:51,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:51,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-02-16 03:35:51,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404142813] [2023-02-16 03:35:51,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:51,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-16 03:35:51,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:51,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-16 03:35:51,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2023-02-16 03:35:51,782 INFO L87 Difference]: Start difference. First operand 167 states and 206 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:52,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:52,591 INFO L93 Difference]: Finished difference Result 179 states and 201 transitions. [2023-02-16 03:35:52,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-16 03:35:52,592 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-16 03:35:52,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:52,593 INFO L225 Difference]: With dead ends: 179 [2023-02-16 03:35:52,593 INFO L226 Difference]: Without dead ends: 179 [2023-02-16 03:35:52,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=240, Invalid=950, Unknown=0, NotChecked=0, Total=1190 [2023-02-16 03:35:52,594 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 222 mSDsluCounter, 632 mSDsCounter, 0 mSdLazyCounter, 696 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 696 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:52,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 710 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 696 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:35:52,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-02-16 03:35:52,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 145. [2023-02-16 03:35:52,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 112 states have (on average 1.4732142857142858) internal successors, (165), 144 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:52,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 165 transitions. [2023-02-16 03:35:52,598 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 165 transitions. Word has length 29 [2023-02-16 03:35:52,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:52,598 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 165 transitions. [2023-02-16 03:35:52,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:52,599 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 165 transitions. [2023-02-16 03:35:52,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-16 03:35:52,599 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:52,599 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:52,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-16 03:35:52,600 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:35:52,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:52,600 INFO L85 PathProgramCache]: Analyzing trace with hash 981328753, now seen corresponding path program 1 times [2023-02-16 03:35:52,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:52,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21022792] [2023-02-16 03:35:52,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:52,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:52,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:52,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:52,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:52,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21022792] [2023-02-16 03:35:52,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21022792] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:52,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:52,661 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:35:52,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239198934] [2023-02-16 03:35:52,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:52,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:35:52,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:52,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:35:52,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:35:52,662 INFO L87 Difference]: Start difference. First operand 145 states and 165 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:52,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:52,681 INFO L93 Difference]: Finished difference Result 145 states and 164 transitions. [2023-02-16 03:35:52,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:35:52,681 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-16 03:35:52,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:52,682 INFO L225 Difference]: With dead ends: 145 [2023-02-16 03:35:52,682 INFO L226 Difference]: Without dead ends: 145 [2023-02-16 03:35:52,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:35:52,683 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 47 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:52,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 175 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:35:52,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-16 03:35:52,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2023-02-16 03:35:52,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 111 states have (on average 1.4684684684684686) internal successors, (163), 142 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:52,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 163 transitions. [2023-02-16 03:35:52,686 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 163 transitions. Word has length 31 [2023-02-16 03:35:52,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:52,687 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 163 transitions. [2023-02-16 03:35:52,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:52,687 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 163 transitions. [2023-02-16 03:35:52,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-16 03:35:52,688 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:52,688 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:52,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-16 03:35:52,688 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:35:52,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:52,689 INFO L85 PathProgramCache]: Analyzing trace with hash 356424450, now seen corresponding path program 1 times [2023-02-16 03:35:52,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:52,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629316364] [2023-02-16 03:35:52,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:52,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:53,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:53,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:53,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629316364] [2023-02-16 03:35:53,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629316364] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:53,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:53,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:35:53,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493458044] [2023-02-16 03:35:53,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:53,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-16 03:35:53,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:53,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-16 03:35:53,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-16 03:35:53,016 INFO L87 Difference]: Start difference. First operand 143 states and 163 transitions. Second operand has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:53,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:53,266 INFO L93 Difference]: Finished difference Result 225 states and 249 transitions. [2023-02-16 03:35:53,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:35:53,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-16 03:35:53,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:53,268 INFO L225 Difference]: With dead ends: 225 [2023-02-16 03:35:53,268 INFO L226 Difference]: Without dead ends: 225 [2023-02-16 03:35:53,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-02-16 03:35:53,268 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 388 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:53,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 219 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:35:53,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-02-16 03:35:53,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 172. [2023-02-16 03:35:53,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 140 states have (on average 1.4785714285714286) internal successors, (207), 171 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:53,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 207 transitions. [2023-02-16 03:35:53,272 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 207 transitions. Word has length 32 [2023-02-16 03:35:53,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:53,274 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 207 transitions. [2023-02-16 03:35:53,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.333333333333333) internal successors, (32), 7 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:53,274 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 207 transitions. [2023-02-16 03:35:53,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-16 03:35:53,278 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:53,278 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:53,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-16 03:35:53,279 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:35:53,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:53,280 INFO L85 PathProgramCache]: Analyzing trace with hash 873646240, now seen corresponding path program 1 times [2023-02-16 03:35:53,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:53,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449963047] [2023-02-16 03:35:53,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:53,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:53,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:53,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:53,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449963047] [2023-02-16 03:35:53,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449963047] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:53,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:53,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:35:53,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251903702] [2023-02-16 03:35:53,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:53,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:35:53,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:53,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:35:53,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:35:53,400 INFO L87 Difference]: Start difference. First operand 172 states and 207 transitions. Second operand has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:53,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:53,493 INFO L93 Difference]: Finished difference Result 209 states and 238 transitions. [2023-02-16 03:35:53,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:35:53,494 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2023-02-16 03:35:53,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:53,495 INFO L225 Difference]: With dead ends: 209 [2023-02-16 03:35:53,495 INFO L226 Difference]: Without dead ends: 209 [2023-02-16 03:35:53,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:35:53,497 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 170 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:53,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 216 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:53,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-02-16 03:35:53,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 174. [2023-02-16 03:35:53,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 142 states have (on average 1.471830985915493) internal successors, (209), 173 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:53,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 209 transitions. [2023-02-16 03:35:53,501 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 209 transitions. Word has length 35 [2023-02-16 03:35:53,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:53,501 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 209 transitions. [2023-02-16 03:35:53,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.666666666666666) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:53,502 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 209 transitions. [2023-02-16 03:35:53,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 03:35:53,502 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:53,502 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:53,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-16 03:35:53,503 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:35:53,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:53,503 INFO L85 PathProgramCache]: Analyzing trace with hash 124937643, now seen corresponding path program 1 times [2023-02-16 03:35:53,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:53,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046148370] [2023-02-16 03:35:53,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:53,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:53,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:54,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:54,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:54,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046148370] [2023-02-16 03:35:54,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046148370] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:35:54,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1726906498] [2023-02-16 03:35:54,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:54,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:35:54,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:35:54,252 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-02-16 03:35:54,270 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-02-16 03:35:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:54,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-16 03:35:54,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:35:54,511 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-02-16 03:35:54,552 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:35:54,553 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 11 treesize of output 11 [2023-02-16 03:35:54,567 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 11 treesize of output 7 [2023-02-16 03:35:54,611 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 14 treesize of output 16 [2023-02-16 03:35:54,623 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 14 treesize of output 16 [2023-02-16 03:35:54,666 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:35:54,666 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 17 treesize of output 21 [2023-02-16 03:35:54,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-16 03:35:54,886 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-16 03:35:54,887 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2023-02-16 03:35:54,900 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 12 treesize of output 8 [2023-02-16 03:35:54,990 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-16 03:35:54,990 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 56 [2023-02-16 03:35:55,008 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 03:35:55,092 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-16 03:35:55,093 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 56 [2023-02-16 03:35:55,111 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 03:35:55,183 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-02-16 03:35:55,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2023-02-16 03:35:55,237 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 32 treesize of output 30 [2023-02-16 03:35:55,281 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 32 treesize of output 30 [2023-02-16 03:35:55,492 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:35:55,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-02-16 03:35:55,565 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:55,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:36:04,375 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:04,376 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 27 treesize of output 31 [2023-02-16 03:36:17,779 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:17,779 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 36 treesize of output 37 [2023-02-16 03:36:17,788 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:36:17,789 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:36:17,803 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:17,803 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 50 treesize of output 50 [2023-02-16 03:36:17,818 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:17,818 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 68 treesize of output 64 [2023-02-16 03:36:17,988 INFO L321 Elim1Store]: treesize reduction 27, result has 77.7 percent of original size [2023-02-16 03:36:17,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 171 treesize of output 250 [2023-02-16 03:36:21,720 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:21,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1726906498] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:36:21,721 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:36:21,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 44 [2023-02-16 03:36:21,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122892292] [2023-02-16 03:36:21,721 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:36:21,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-02-16 03:36:21,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:36:21,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-02-16 03:36:21,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1721, Unknown=24, NotChecked=0, Total=1980 [2023-02-16 03:36:21,723 INFO L87 Difference]: Start difference. First operand 174 states and 209 transitions. Second operand has 45 states, 44 states have (on average 2.25) internal successors, (99), 45 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:36:33,180 WARN L233 SmtUtils]: Spent 8.17s on a formula simplification. DAG size of input: 67 DAG size of output: 56 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 03:36:48,125 WARN L233 SmtUtils]: Spent 14.30s on a formula simplification. DAG size of input: 68 DAG size of output: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 03:36:59,131 WARN L233 SmtUtils]: Spent 10.30s on a formula simplification. DAG size of input: 62 DAG size of output: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 03:37:12,365 WARN L233 SmtUtils]: Spent 12.57s on a formula simplification. DAG size of input: 90 DAG size of output: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 03:37:19,600 WARN L233 SmtUtils]: Spent 5.90s on a formula simplification. DAG size of input: 81 DAG size of output: 70 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 03:37:20,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:37:20,846 INFO L93 Difference]: Finished difference Result 225 states and 254 transitions. [2023-02-16 03:37:20,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-02-16 03:37:20,846 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.25) internal successors, (99), 45 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-16 03:37:20,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:37:20,847 INFO L225 Difference]: With dead ends: 225 [2023-02-16 03:37:20,847 INFO L226 Difference]: Without dead ends: 225 [2023-02-16 03:37:20,849 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 48 SyntacticMatches, 5 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1440 ImplicationChecksByTransitivity, 79.2s TimeCoverageRelationStatistics Valid=822, Invalid=4262, Unknown=28, NotChecked=0, Total=5112 [2023-02-16 03:37:20,849 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 852 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 115 mSolverCounterUnsat, 41 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 1227 SdHoareTripleChecker+Invalid, 1857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 41 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-02-16 03:37:20,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 1227 Invalid, 1857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1701 Invalid, 41 Unknown, 0 Unchecked, 4.8s Time] [2023-02-16 03:37:20,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-02-16 03:37:20,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 176. [2023-02-16 03:37:20,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 144 states have (on average 1.4722222222222223) internal successors, (212), 175 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:37:20,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 212 transitions. [2023-02-16 03:37:20,853 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 212 transitions. Word has length 37 [2023-02-16 03:37:20,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:37:20,853 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 212 transitions. [2023-02-16 03:37:20,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.25) internal successors, (99), 45 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:37:20,854 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 212 transitions. [2023-02-16 03:37:20,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-16 03:37:20,854 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:37:20,854 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:37:20,864 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-02-16 03:37:21,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-02-16 03:37:21,055 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:37:21,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:37:21,055 INFO L85 PathProgramCache]: Analyzing trace with hash 124937644, now seen corresponding path program 1 times [2023-02-16 03:37:21,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:37:21,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651955748] [2023-02-16 03:37:21,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:37:21,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:37:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:37:22,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:37:22,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:37:22,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651955748] [2023-02-16 03:37:22,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651955748] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:37:22,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646042918] [2023-02-16 03:37:22,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:37:22,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:37:22,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:37:22,888 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-02-16 03:37:22,890 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-02-16 03:37:23,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:37:23,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 58 conjunts are in the unsatisfiable core [2023-02-16 03:37:23,034 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:37:23,042 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-02-16 03:37:23,057 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:37:23,129 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 23 treesize of output 22 [2023-02-16 03:37:23,152 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:37:23,153 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 11 treesize of output 11 [2023-02-16 03:37:23,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:37:23,205 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 21 treesize of output 20 [2023-02-16 03:37:23,215 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 11 treesize of output 7 [2023-02-16 03:37:23,288 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 16 treesize of output 8 [2023-02-16 03:37:23,389 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 16 treesize of output 18 [2023-02-16 03:37:23,411 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 16 treesize of output 18 [2023-02-16 03:37:23,450 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:37:23,451 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 17 treesize of output 21 [2023-02-16 03:37:23,521 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:37:23,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-16 03:37:23,614 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 16 treesize of output 8 [2023-02-16 03:37:23,709 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 16 treesize of output 18 [2023-02-16 03:37:23,730 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 16 treesize of output 18 [2023-02-16 03:37:23,745 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 16 treesize of output 18 [2023-02-16 03:37:23,793 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:37:23,793 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 11 treesize of output 11 [2023-02-16 03:37:23,868 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 16 treesize of output 18 [2023-02-16 03:37:23,907 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 23 treesize of output 22 [2023-02-16 03:37:24,161 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:37:24,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 21 [2023-02-16 03:37:24,282 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:37:24,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:37:24,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646042918] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:37:24,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 03:37:24,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [17] total 32 [2023-02-16 03:37:24,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104064557] [2023-02-16 03:37:24,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:37:24,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-16 03:37:24,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:37:24,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-16 03:37:24,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=881, Unknown=0, NotChecked=0, Total=992 [2023-02-16 03:37:24,284 INFO L87 Difference]: Start difference. First operand 176 states and 212 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:37:25,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:37:25,802 INFO L93 Difference]: Finished difference Result 288 states and 333 transitions. [2023-02-16 03:37:25,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-16 03:37:25,803 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-16 03:37:25,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:37:25,804 INFO L225 Difference]: With dead ends: 288 [2023-02-16 03:37:25,804 INFO L226 Difference]: Without dead ends: 287 [2023-02-16 03:37:25,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=271, Invalid=1985, Unknown=0, NotChecked=0, Total=2256 [2023-02-16 03:37:25,806 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 492 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 721 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-16 03:37:25,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 721 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-16 03:37:25,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2023-02-16 03:37:25,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 195. [2023-02-16 03:37:25,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 163 states have (on average 1.4355828220858895) internal successors, (234), 194 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:37:25,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 234 transitions. [2023-02-16 03:37:25,810 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 234 transitions. Word has length 37 [2023-02-16 03:37:25,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:37:25,811 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 234 transitions. [2023-02-16 03:37:25,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:37:25,811 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 234 transitions. [2023-02-16 03:37:25,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 03:37:25,811 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:37:25,811 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, 1, 1, 1, 1, 1] [2023-02-16 03:37:25,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-16 03:37:26,018 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,SelfDestructingSolverStorable16 [2023-02-16 03:37:26,019 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:37:26,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:37:26,019 INFO L85 PathProgramCache]: Analyzing trace with hash -706370693, now seen corresponding path program 1 times [2023-02-16 03:37:26,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:37:26,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648620424] [2023-02-16 03:37:26,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:37:26,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:37:26,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:37:26,902 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:37:26,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:37:26,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648620424] [2023-02-16 03:37:26,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648620424] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:37:26,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [533708386] [2023-02-16 03:37:26,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:37:26,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:37:26,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:37:26,905 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-02-16 03:37:26,930 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-02-16 03:37:27,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:37:27,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-16 03:37:27,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:37:27,074 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-02-16 03:37:27,106 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:37:27,106 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 11 treesize of output 11 [2023-02-16 03:37:27,122 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 11 treesize of output 7 [2023-02-16 03:37:27,179 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 14 treesize of output 16 [2023-02-16 03:37:27,194 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 14 treesize of output 16 [2023-02-16 03:37:27,218 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:37:27,219 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 11 treesize of output 11 [2023-02-16 03:37:27,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-02-16 03:37:27,419 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-16 03:37:27,420 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2023-02-16 03:37:27,434 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 12 treesize of output 8 [2023-02-16 03:37:27,575 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-16 03:37:27,576 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 56 [2023-02-16 03:37:27,603 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 03:37:27,687 INFO L321 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2023-02-16 03:37:27,688 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 56 [2023-02-16 03:37:27,824 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-02-16 03:37:27,825 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 32 [2023-02-16 03:37:28,044 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:37:28,050 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:37:28,050 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 42 treesize of output 33 [2023-02-16 03:37:28,080 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-02-16 03:37:28,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:37:28,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:37:28,857 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:37:28,857 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 65 treesize of output 69 [2023-02-16 03:37:29,288 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:37:29,288 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 16 treesize of output 20 [2023-02-16 03:37:29,614 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:37:29,614 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 23 treesize of output 24 [2023-02-16 03:37:29,618 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:37:29,628 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:37:29,629 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 30 treesize of output 30 [2023-02-16 03:37:29,639 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:37:29,640 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 18 treesize of output 22 [2023-02-16 03:37:29,651 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-16 03:37:29,652 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 13 treesize of output 12 [2023-02-16 03:37:29,792 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:37:29,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [533708386] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:37:29,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:37:29,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 17] total 36 [2023-02-16 03:37:29,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350971728] [2023-02-16 03:37:29,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:37:29,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-02-16 03:37:29,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:37:29,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-02-16 03:37:29,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1175, Unknown=17, NotChecked=0, Total=1332 [2023-02-16 03:37:29,794 INFO L87 Difference]: Start difference. First operand 195 states and 234 transitions. Second operand has 37 states, 36 states have (on average 2.388888888888889) internal successors, (86), 37 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:37:35,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:37:35,456 INFO L93 Difference]: Finished difference Result 238 states and 269 transitions. [2023-02-16 03:37:35,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-16 03:37:35,456 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.388888888888889) internal successors, (86), 37 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-02-16 03:37:35,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:37:35,457 INFO L225 Difference]: With dead ends: 238 [2023-02-16 03:37:35,457 INFO L226 Difference]: Without dead ends: 238 [2023-02-16 03:37:35,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 54 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 791 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=431, Invalid=2522, Unknown=17, NotChecked=0, Total=2970 [2023-02-16 03:37:35,459 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 323 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 1205 SdHoareTripleChecker+Invalid, 1665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:37:35,459 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 1205 Invalid, 1665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1609 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-02-16 03:37:35,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2023-02-16 03:37:35,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 205. [2023-02-16 03:37:35,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 173 states have (on average 1.4219653179190752) internal successors, (246), 204 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:37:35,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 246 transitions. [2023-02-16 03:37:35,463 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 246 transitions. Word has length 38 [2023-02-16 03:37:35,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:37:35,464 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 246 transitions. [2023-02-16 03:37:35,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.388888888888889) internal successors, (86), 37 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:37:35,464 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 246 transitions. [2023-02-16 03:37:35,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 03:37:35,465 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:37:35,465 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, 1, 1, 1, 1, 1] [2023-02-16 03:37:35,475 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-02-16 03:37:35,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-02-16 03:37:35,680 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:37:35,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:37:35,680 INFO L85 PathProgramCache]: Analyzing trace with hash -706370692, now seen corresponding path program 1 times [2023-02-16 03:37:35,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:37:35,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918363773] [2023-02-16 03:37:35,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:37:35,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:37:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:37:36,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:37:36,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:37:36,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918363773] [2023-02-16 03:37:36,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918363773] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:37:36,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [738965125] [2023-02-16 03:37:36,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:37:36,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:37:36,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:37:36,963 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-02-16 03:37:36,964 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-02-16 03:37:37,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:37:37,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 67 conjunts are in the unsatisfiable core [2023-02-16 03:37:37,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:37:37,106 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-02-16 03:37:37,169 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:37:37,169 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 17 treesize of output 21 [2023-02-16 03:37:37,227 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 11 treesize of output 7 [2023-02-16 03:37:37,234 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:37:37,497 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:37:37,498 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-02-16 03:37:37,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:37:37,522 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 14 treesize of output 16 [2023-02-16 03:37:37,604 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:37:37,605 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-02-16 03:37:37,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:37:37,622 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 14 treesize of output 16 [2023-02-16 03:37:37,666 INFO L321 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2023-02-16 03:37:37,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-16 03:37:37,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:37:37,792 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:37:37,793 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-02-16 03:37:37,800 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-02-16 03:37:37,837 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-16 03:37:37,837 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 1 case distinctions, treesize of input 35 treesize of output 26 [2023-02-16 03:37:38,332 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-16 03:37:38,333 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 55 [2023-02-16 03:37:38,379 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:37:38,379 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-02-16 03:37:38,388 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-02-16 03:37:38,482 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-16 03:37:38,482 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 55 [2023-02-16 03:37:38,530 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:37:38,531 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-02-16 03:37:38,535 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-02-16 03:37:38,650 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-16 03:37:38,650 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 76 treesize of output 63 [2023-02-16 03:37:38,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-16 03:37:39,118 INFO L321 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2023-02-16 03:37:39,119 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 21 treesize of output 26 [2023-02-16 03:37:39,165 INFO L321 Elim1Store]: treesize reduction 54, result has 28.0 percent of original size [2023-02-16 03:37:39,166 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 52 [2023-02-16 03:37:39,540 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:37:39,591 INFO L321 Elim1Store]: treesize reduction 36, result has 41.0 percent of original size [2023-02-16 03:37:39,592 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 96 treesize of output 83 [2023-02-16 03:37:39,602 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:37:39,602 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 21 treesize of output 13 [2023-02-16 03:37:39,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:37:39,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:37:41,059 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:37:41,060 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 37 [2023-02-16 03:37:41,286 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:37:41,287 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 142 treesize of output 146 [2023-02-16 03:37:41,381 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 26 treesize of output 22 [2023-02-16 03:37:41,880 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_5 Int) (v_prenex_4 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_12| Int) (v_prenex_6 (Array Int Int))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_12|))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_prenex_6) |v_ULTIMATE.start_main_#t~malloc4#1.base_12| v_prenex_4) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_5) 4)) (not (<= v_prenex_5 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 v_prenex_5)))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int)) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_59| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_5 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (forall ((v_ArrVal_1347 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_5) .cse0 v_ArrVal_1347) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) .cse0))) (not (= 0 (select |c_#valid| .cse0)))))) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_59|)))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (forall ((v_ArrVal_1348 (Array Int Int)) (v_arrayElimCell_111 Int) (|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int) (v_ArrVal_1341 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_59| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= 0 (select |c_#valid| v_arrayElimCell_111))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_ArrVal_1341) v_arrayElimCell_111 v_ArrVal_1348) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|) 5) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_59|)))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((|v_ULTIMATE.start_main_~bcki~0#1.offset_59| Int)) (or (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_59| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (forall ((v_arrayElimArr_5 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_5 |ULTIMATE.start_main_~bcki~0#1.offset|))) (or (forall ((v_ArrVal_1347 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem3#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_5) .cse1 v_ArrVal_1347) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_59|))) (not (= 0 (select |c_#valid| .cse1)))))) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_59|)))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|))))) is different from false [2023-02-16 03:37:42,410 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:37:42,410 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 23 treesize of output 24 [2023-02-16 03:37:42,414 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:37:42,431 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:37:42,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 34 [2023-02-16 03:37:42,442 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 11 treesize of output 9 [2023-02-16 03:37:42,488 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:37:42,488 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 26 treesize of output 27 [2023-02-16 03:37:42,492 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:37:42,500 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:37:42,501 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 37 treesize of output 37 [2023-02-16 03:37:42,512 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:37:42,512 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 33 treesize of output 33 [2023-02-16 03:37:42,614 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:37:42,615 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 23 treesize of output 24 [2023-02-16 03:37:42,622 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:37:42,635 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:37:42,635 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 30 treesize of output 30 [2023-02-16 03:37:42,650 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:37:42,650 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 18 treesize of output 22 [2023-02-16 03:37:42,692 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:37:42,692 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 21 treesize of output 22 [2023-02-16 03:37:42,699 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:37:42,714 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:37:42,714 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 30 treesize of output 30 [2023-02-16 03:37:42,720 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 9 treesize of output 7 [2023-02-16 03:37:43,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:37:43,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [738965125] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:37:43,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:37:43,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 42 [2023-02-16 03:37:43,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457933165] [2023-02-16 03:37:43,208 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:37:43,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-02-16 03:37:43,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:37:43,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-02-16 03:37:43,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1509, Unknown=18, NotChecked=80, Total=1806 [2023-02-16 03:37:43,210 INFO L87 Difference]: Start difference. First operand 205 states and 246 transitions. Second operand has 43 states, 42 states have (on average 2.5) internal successors, (105), 43 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:37:57,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:37:57,414 INFO L93 Difference]: Finished difference Result 260 states and 301 transitions. [2023-02-16 03:37:57,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-16 03:37:57,415 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 2.5) internal successors, (105), 43 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-02-16 03:37:57,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:37:57,416 INFO L225 Difference]: With dead ends: 260 [2023-02-16 03:37:57,416 INFO L226 Difference]: Without dead ends: 260 [2023-02-16 03:37:57,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1109 ImplicationChecksByTransitivity, 13.9s TimeCoverageRelationStatistics Valid=529, Invalid=3489, Unknown=18, NotChecked=124, Total=4160 [2023-02-16 03:37:57,418 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 523 mSDsluCounter, 1461 mSDsCounter, 0 mSdLazyCounter, 2109 mSolverCounterSat, 64 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 2369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2109 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:37:57,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 1533 Invalid, 2369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2109 Invalid, 7 Unknown, 189 Unchecked, 3.5s Time] [2023-02-16 03:37:57,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-02-16 03:37:57,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 228. [2023-02-16 03:37:57,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 199 states have (on average 1.4221105527638191) internal successors, (283), 227 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:37:57,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 283 transitions. [2023-02-16 03:37:57,423 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 283 transitions. Word has length 38 [2023-02-16 03:37:57,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:37:57,423 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 283 transitions. [2023-02-16 03:37:57,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 2.5) internal successors, (105), 43 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:37:57,424 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 283 transitions. [2023-02-16 03:37:57,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 03:37:57,424 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:37:57,424 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:37:57,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-02-16 03:37:57,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:37:57,631 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 69 more)] === [2023-02-16 03:37:57,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:37:57,631 INFO L85 PathProgramCache]: Analyzing trace with hash 448725100, now seen corresponding path program 1 times [2023-02-16 03:37:57,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:37:57,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947746711] [2023-02-16 03:37:57,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:37:57,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:37:57,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:37:59,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:37:59,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:37:59,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947746711] [2023-02-16 03:37:59,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947746711] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:37:59,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672565472] [2023-02-16 03:37:59,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:37:59,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:37:59,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:37:59,129 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:37:59,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-16 03:37:59,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:37:59,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 75 conjunts are in the unsatisfiable core [2023-02-16 03:37:59,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:37:59,309 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-02-16 03:37:59,341 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:37:59,342 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 17 treesize of output 21 [2023-02-16 03:37:59,382 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 11 treesize of output 7 [2023-02-16 03:37:59,392 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:37:59,465 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 14 treesize of output 16 [2023-02-16 03:37:59,473 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 14 treesize of output 16 [2023-02-16 03:37:59,494 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 14 treesize of output 16 [2023-02-16 03:37:59,517 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 14 treesize of output 16 [2023-02-16 03:37:59,559 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-02-16 03:37:59,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 33 [2023-02-16 03:37:59,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:37:59,640 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 14 treesize of output 16 [2023-02-16 03:37:59,653 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 19 treesize of output 18 [2023-02-16 03:37:59,966 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:37:59,967 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-02-16 03:37:59,971 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-02-16 03:37:59,998 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-16 03:37:59,999 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 71 [2023-02-16 03:38:00,112 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:38:00,112 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-02-16 03:38:00,123 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-02-16 03:38:00,163 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-16 03:38:00,164 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 71 [2023-02-16 03:38:00,274 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-16 03:38:00,275 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 100 treesize of output 79 [2023-02-16 03:38:00,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-16 03:38:00,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:38:00,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-16 03:38:00,525 INFO L321 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2023-02-16 03:38:00,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 37 [2023-02-16 03:38:00,682 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:38:00,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 62 [2023-02-16 03:38:00,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:38:00,891 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:38:00,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 74 treesize of output 62 [2023-02-16 03:38:00,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 14 treesize of output 16 [2023-02-16 03:38:01,307 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:38:01,313 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-16 03:38:01,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 26 [2023-02-16 03:38:01,325 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:38:01,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-16 03:38:01,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:38:01,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:38:09,727 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:38:09,728 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 42 treesize of output 46 [2023-02-16 03:38:17,872 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:38:17,872 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 589 treesize of output 576 [2023-02-16 03:38:18,216 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 51 treesize of output 43 [2023-02-16 03:38:23,728 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse6 (forall ((|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_ArrVal_1526 (Array Int Int)) (v_ArrVal_1514 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int) (v_ArrVal_1520 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_15| Int)) (let ((.cse8 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_15| 1))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_15|))) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_ArrVal_1514) |v_ULTIMATE.start_main_#t~malloc4#1.base_15| v_ArrVal_1520) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1526) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) 8)) (not (= 0 (select .cse8 |v_ULTIMATE.start_main_~item~0#1.base_41|))) (not (= 1 (select .cse8 |c_ULTIMATE.start_main_#t~mem3#1.base|))) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_65| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_65|))))))) (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_1525 (Array Int Int)) (v_prenex_11 Int) (v_ArrVal_1521 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse0 (select v_arrayElimArr_10 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse1 (store |c_#valid| .cse0 1))) (or (not (= 0 (select |c_#valid| .cse0))) (not (<= 0 v_prenex_11)) (not (= 1 (select .cse1 |c_ULTIMATE.start_main_#t~mem3#1.base|))) (not (<= v_prenex_11 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= 0 (select .cse1 v_prenex_8))) (= |c_ULTIMATE.start_main_#t~mem3#1.base| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_10) .cse0 v_ArrVal_1521) v_prenex_8 v_ArrVal_1525) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_11)))))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_1525 (Array Int Int)) (v_prenex_11 Int) (v_ArrVal_1521 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse2 (select v_arrayElimArr_10 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse3 (store |c_#valid| .cse2 1))) (or (not (= 0 (select |c_#valid| .cse2))) (not (<= 0 v_prenex_11)) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_10) .cse2 v_ArrVal_1521) v_prenex_8 v_ArrVal_1525) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_11) v_prenex_8)) (not (= 1 (select .cse3 |c_ULTIMATE.start_main_#t~mem3#1.base|))) (not (<= v_prenex_11 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= 0 (select .cse3 v_prenex_8))))))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_1525 (Array Int Int)) (v_prenex_11 Int) (v_ArrVal_1521 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse4 (select v_arrayElimArr_10 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse5 (store |c_#valid| .cse4 1))) (or (not (= 0 (select |c_#valid| .cse4))) (not (<= 0 v_prenex_11)) (not (= 1 (select .cse5 |c_ULTIMATE.start_main_#t~mem3#1.base|))) (not (<= v_prenex_11 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= 0 (select .cse5 v_prenex_8))) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_10) .cse4 v_ArrVal_1521) v_prenex_8 v_ArrVal_1525) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_11) .cse4)))))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (or (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_1525 (Array Int Int)) (v_prenex_11 Int) (v_ArrVal_1521 (Array Int Int)) (v_prenex_8 Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (= |c_ULTIMATE.start_main_#t~mem3#1.base| (select (select (store (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem3#1.base| v_arrayElimArr_10) (select v_arrayElimArr_10 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1521) v_prenex_8 v_ArrVal_1525) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_11)))) .cse6) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_165 Int) (v_prenex_12 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse7 (store |c_#valid| v_arrayElimCell_165 1))) (or (not (= 0 (select |c_#valid| v_arrayElimCell_165))) (not (<= 0 v_prenex_11)) (< (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem3#1.base| v_prenex_10) v_arrayElimCell_165 v_prenex_12) v_prenex_8 v_prenex_9) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_11) 1) (not (<= v_prenex_11 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= 1 (select .cse7 |c_ULTIMATE.start_main_#t~mem3#1.base|))) (not (= 0 (select .cse7 v_prenex_8)))))) .cse6)) is different from false [2023-02-16 03:38:23,990 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse8 (forall ((|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_ArrVal_1526 (Array Int Int)) (v_ArrVal_1514 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int) (v_ArrVal_1520 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_15| Int)) (let ((.cse9 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_15| 1))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_15|))) (not (= 1 (select .cse9 .cse2))) (not (= 0 (select .cse9 |v_ULTIMATE.start_main_~item~0#1.base_41|))) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_65| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_65|)) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1514) |v_ULTIMATE.start_main_#t~malloc4#1.base_15| v_ArrVal_1520) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1526) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) 8))))))) (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_1525 (Array Int Int)) (v_prenex_11 Int) (v_ArrVal_1521 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse0 (select v_arrayElimArr_10 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse1 (store |c_#valid| .cse0 1))) (or (not (= 0 (select |c_#valid| .cse0))) (not (<= 0 v_prenex_11)) (not (<= v_prenex_11 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= 0 (select .cse1 v_prenex_8))) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| .cse2 v_arrayElimArr_10) .cse0 v_ArrVal_1521) v_prenex_8 v_ArrVal_1525) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_11) .cse0)) (not (= 1 (select .cse1 .cse2))))))))) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_165 Int) (v_prenex_12 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse3 (store |c_#valid| v_arrayElimCell_165 1))) (or (not (= 0 (select |c_#valid| v_arrayElimCell_165))) (not (<= 0 v_prenex_11)) (not (<= v_prenex_11 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (< (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_prenex_10) v_arrayElimCell_165 v_prenex_12) v_prenex_8 v_prenex_9) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_11) 1) (not (= 0 (select .cse3 v_prenex_8))) (not (= 1 (select .cse3 .cse2)))))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_1525 (Array Int Int)) (v_prenex_11 Int) (v_ArrVal_1521 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse4 (select v_arrayElimArr_10 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse5 (store |c_#valid| .cse4 1))) (or (not (= 0 (select |c_#valid| .cse4))) (not (<= 0 v_prenex_11)) (not (<= v_prenex_11 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= 0 (select .cse5 v_prenex_8))) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| .cse2 v_arrayElimArr_10) .cse4 v_ArrVal_1521) v_prenex_8 v_ArrVal_1525) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_11) v_prenex_8)) (not (= 1 (select .cse5 .cse2))))))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_1525 (Array Int Int)) (v_prenex_11 Int) (v_ArrVal_1521 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse6 (select v_arrayElimArr_10 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse7 (store |c_#valid| .cse6 1))) (or (not (= 0 (select |c_#valid| .cse6))) (not (<= 0 v_prenex_11)) (not (<= v_prenex_11 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= 0 (select .cse7 v_prenex_8))) (= .cse2 (select (select (store (store (store |c_#memory_$Pointer$.base| .cse2 v_arrayElimArr_10) .cse6 v_ArrVal_1521) v_prenex_8 v_ArrVal_1525) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_11)) (not (= 1 (select .cse7 .cse2))))))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (or (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_1525 (Array Int Int)) (v_prenex_11 Int) (v_ArrVal_1521 (Array Int Int)) (v_prenex_8 Int)) (or (= .cse2 (select (select (store (store (store |c_#memory_$Pointer$.base| .cse2 v_arrayElimArr_10) (select v_arrayElimArr_10 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1521) v_prenex_8 v_ArrVal_1525) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_11)) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))) .cse8) .cse8))) is different from false [2023-02-16 03:38:24,288 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:38:24,289 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 26 treesize of output 27 [2023-02-16 03:38:24,296 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:38:24,296 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:38:24,317 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:38:24,317 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 30 treesize of output 30 [2023-02-16 03:38:24,343 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:38:24,343 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 40 treesize of output 40 [2023-02-16 03:38:24,419 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:38:24,419 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 24 treesize of output 25 [2023-02-16 03:38:24,427 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:38:24,428 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:38:24,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:38:24,456 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 30 treesize of output 30 [2023-02-16 03:38:24,484 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 9 treesize of output 7 [2023-02-16 03:38:24,549 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:38:24,549 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 26 treesize of output 27 [2023-02-16 03:38:24,572 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:38:24,573 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 1046 treesize of output 1018 [2023-02-16 03:38:24,581 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 1006 treesize of output 974 [2023-02-16 03:38:24,589 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 974 treesize of output 910 [2023-02-16 03:38:24,615 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:38:24,615 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 910 treesize of output 830 [2023-02-16 03:38:42,943 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:38:42,943 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 26 treesize of output 27 [2023-02-16 03:38:42,951 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:38:42,952 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:38:42,972 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:38:42,972 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 34 treesize of output 34 [2023-02-16 03:38:42,980 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 11 treesize of output 9 [2023-02-16 03:38:43,061 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:38:43,062 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 29 treesize of output 30 [2023-02-16 03:38:43,069 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:38:43,070 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:38:43,089 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:38:43,089 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 37 treesize of output 37 [2023-02-16 03:38:43,112 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:38:43,112 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 55 treesize of output 51 [2023-02-16 03:38:43,248 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:38:43,248 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 27 treesize of output 28 [2023-02-16 03:38:43,256 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:38:43,257 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:38:43,276 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:38:43,276 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 33 treesize of output 33 [2023-02-16 03:38:43,299 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:38:43,299 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 51 treesize of output 51 [2023-02-16 03:38:43,481 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:38:43,481 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 26 treesize of output 27 [2023-02-16 03:38:43,494 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:38:43,495 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:38:43,517 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:38:43,518 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 34 treesize of output 34 [2023-02-16 03:38:43,539 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 11 treesize of output 9 [2023-02-16 03:38:46,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:38:46,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [672565472] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:38:46,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:38:46,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 18] total 44 [2023-02-16 03:38:46,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702371096] [2023-02-16 03:38:46,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:38:46,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2023-02-16 03:38:46,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:38:46,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2023-02-16 03:38:46,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1593, Unknown=18, NotChecked=166, Total=1980 [2023-02-16 03:38:46,613 INFO L87 Difference]: Start difference. First operand 228 states and 283 transitions. Second operand has 45 states, 44 states have (on average 2.3636363636363638) internal successors, (104), 45 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:38:47,135 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|))) (let ((.cse3 (select |c_#valid| |c_ULTIMATE.start_main_~bucket~0#1.base|)) (.cse9 (forall ((|v_ULTIMATE.start_main_~item~0#1.base_41| Int) (v_ArrVal_1526 (Array Int Int)) (v_ArrVal_1514 (Array Int Int)) (|v_ULTIMATE.start_main_~bcki~0#1.offset_65| Int) (v_ArrVal_1520 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc4#1.base_15| Int)) (let ((.cse10 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_15| 1))) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc4#1.base_15|))) (not (= 1 (select .cse10 .cse2))) (not (= 0 (select .cse10 |v_ULTIMATE.start_main_~item~0#1.base_41|))) (not (<= |v_ULTIMATE.start_main_~bcki~0#1.offset_65| |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~bcki~0#1.offset_65|)) (<= 0 (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1514) |v_ULTIMATE.start_main_#t~malloc4#1.base_15| v_ArrVal_1520) |v_ULTIMATE.start_main_~item~0#1.base_41| v_ArrVal_1526) |c_ULTIMATE.start_main_~bucket~0#1.base|) |v_ULTIMATE.start_main_~bcki~0#1.offset_65|) 8))))))) (and (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)) (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_1525 (Array Int Int)) (v_prenex_11 Int) (v_ArrVal_1521 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse0 (select v_arrayElimArr_10 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse1 (store |c_#valid| .cse0 1))) (or (not (= 0 (select |c_#valid| .cse0))) (not (<= 0 v_prenex_11)) (not (<= v_prenex_11 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= 0 (select .cse1 v_prenex_8))) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| .cse2 v_arrayElimArr_10) .cse0 v_ArrVal_1521) v_prenex_8 v_ArrVal_1525) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_11) .cse0)) (not (= 1 (select .cse1 .cse2))))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~bucket~0#1.base|) |c_ULTIMATE.start_main_~bucket~0#1.offset|) 0) (= (select |c_#valid| .cse2) .cse3) (= 1 .cse3) (forall ((v_prenex_9 (Array Int Int)) (v_prenex_10 (Array Int Int)) (v_prenex_11 Int) (v_arrayElimCell_165 Int) (v_prenex_12 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse4 (store |c_#valid| v_arrayElimCell_165 1))) (or (not (= 0 (select |c_#valid| v_arrayElimCell_165))) (not (<= 0 v_prenex_11)) (not (<= v_prenex_11 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (< (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_prenex_10) v_arrayElimCell_165 v_prenex_12) v_prenex_8 v_prenex_9) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_11) 1) (not (= 0 (select .cse4 v_prenex_8))) (not (= 1 (select .cse4 .cse2)))))) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| |c_ULTIMATE.start_main_#t~malloc2#1.base|)) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_1525 (Array Int Int)) (v_prenex_11 Int) (v_ArrVal_1521 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse5 (select v_arrayElimArr_10 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse6 (store |c_#valid| .cse5 1))) (or (not (= 0 (select |c_#valid| .cse5))) (not (<= 0 v_prenex_11)) (not (<= v_prenex_11 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= 0 (select .cse6 v_prenex_8))) (not (= (select (select (store (store (store |c_#memory_$Pointer$.base| .cse2 v_arrayElimArr_10) .cse5 v_ArrVal_1521) v_prenex_8 v_ArrVal_1525) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_11) v_prenex_8)) (not (= 1 (select .cse6 .cse2))))))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int)) (or (forall ((v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_1525 (Array Int Int)) (v_prenex_11 Int) (v_ArrVal_1521 (Array Int Int)) (v_prenex_8 Int)) (let ((.cse7 (select v_arrayElimArr_10 |ULTIMATE.start_main_~bcki~0#1.offset|))) (let ((.cse8 (store |c_#valid| .cse7 1))) (or (not (= 0 (select |c_#valid| .cse7))) (not (<= 0 v_prenex_11)) (not (<= v_prenex_11 |c_ULTIMATE.start_main_~bucket~0#1.offset|)) (not (= 0 (select .cse8 v_prenex_8))) (= .cse2 (select (select (store (store (store |c_#memory_$Pointer$.base| .cse2 v_arrayElimArr_10) .cse7 v_ArrVal_1521) v_prenex_8 v_ArrVal_1525) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_11)) (not (= 1 (select .cse8 .cse2))))))) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))) (= (select |c_#valid| |c_ULTIMATE.start_main_#t~malloc2#1.base|) 1) (= |c_ULTIMATE.start_main_~bucket~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~bucket~0#1.base| .cse2)) (or (forall ((|ULTIMATE.start_main_~bcki~0#1.offset| Int) (v_arrayElimArr_10 (Array Int Int)) (v_ArrVal_1525 (Array Int Int)) (v_prenex_11 Int) (v_ArrVal_1521 (Array Int Int)) (v_prenex_8 Int)) (or (= .cse2 (select (select (store (store (store |c_#memory_$Pointer$.base| .cse2 v_arrayElimArr_10) (select v_arrayElimArr_10 |ULTIMATE.start_main_~bcki~0#1.offset|) v_ArrVal_1521) v_prenex_8 v_ArrVal_1525) |c_ULTIMATE.start_main_~bucket~0#1.base|) v_prenex_11)) (not (<= 0 |ULTIMATE.start_main_~bcki~0#1.offset|)))) .cse9) .cse9 (= 0 |c_ULTIMATE.start_main_#t~malloc2#1.offset|)))) is different from false [2023-02-16 03:39:02,927 WARN L233 SmtUtils]: Spent 8.70s on a formula simplification. DAG size of input: 118 DAG size of output: 113 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 03:39:40,694 WARN L233 SmtUtils]: Spent 23.37s on a formula simplification that was a NOOP. DAG size: 183 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 03:39:43,047 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, 1] [2023-02-16 03:39:49,925 WARN L233 SmtUtils]: Spent 6.62s on a formula simplification. DAG size of input: 94 DAG size of output: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)