./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 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/termination-crafted/4BitCounterPointer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 07:06:58,430 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 07:06:58,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 07:06:58,481 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 07:06:58,481 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 07:06:58,482 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 07:06:58,482 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 07:06:58,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 07:06:58,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 07:06:58,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 07:06:58,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 07:06:58,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 07:06:58,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 07:06:58,492 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 07:06:58,492 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 07:06:58,494 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 07:06:58,495 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 07:06:58,496 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 07:06:58,499 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 07:06:58,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 07:06:58,503 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 07:06:58,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 07:06:58,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 07:06:58,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 07:06:58,506 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 07:06:58,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 07:06:58,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 07:06:58,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 07:06:58,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 07:06:58,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 07:06:58,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 07:06:58,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 07:06:58,514 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 07:06:58,515 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 07:06:58,515 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 07:06:58,516 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 07:06:58,516 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 07:06:58,516 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 07:06:58,517 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 07:06:58,517 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 07:06:58,518 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 07:06:58,520 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 07:06:58,521 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2022-07-14 07:06:58,541 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 07:06:58,542 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 07:06:58,542 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 07:06:58,542 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 07:06:58,543 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 07:06:58,543 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 07:06:58,543 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 07:06:58,543 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 07:06:58,544 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 07:06:58,544 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 07:06:58,544 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 07:06:58,544 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 07:06:58,545 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 07:06:58,545 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 07:06:58,545 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 07:06:58,545 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 07:06:58,545 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 07:06:58,545 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 07:06:58,545 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 07:06:58,546 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 07:06:58,546 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 07:06:58,547 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 07:06:58,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 07:06:58,547 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 07:06:58,547 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 07:06:58,547 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 07:06:58,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 07:06:58,547 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 [2022-07-14 07:06:58,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 07:06:58,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 07:06:58,756 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 07:06:58,758 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 07:06:58,758 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 07:06:58,759 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2022-07-14 07:06:58,816 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b27848b31/28aa48e819484f8bad128a89dcf8cf01/FLAGbf1d9fcf5 [2022-07-14 07:06:59,128 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 07:06:59,129 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2022-07-14 07:06:59,135 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b27848b31/28aa48e819484f8bad128a89dcf8cf01/FLAGbf1d9fcf5 [2022-07-14 07:06:59,565 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b27848b31/28aa48e819484f8bad128a89dcf8cf01 [2022-07-14 07:06:59,567 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 07:06:59,569 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 07:06:59,571 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 07:06:59,571 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 07:06:59,573 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 07:06:59,573 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 07:06:59" (1/1) ... [2022-07-14 07:06:59,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@765f8db7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:59, skipping insertion in model container [2022-07-14 07:06:59,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 07:06:59" (1/1) ... [2022-07-14 07:06:59,578 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 07:06:59,587 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 07:06:59,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 07:06:59,706 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 07:06:59,717 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 07:06:59,726 INFO L208 MainTranslator]: Completed translation [2022-07-14 07:06:59,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:59 WrapperNode [2022-07-14 07:06:59,727 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 07:06:59,729 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 07:06:59,729 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 07:06:59,729 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 07:06:59,734 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:59" (1/1) ... [2022-07-14 07:06:59,740 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:59" (1/1) ... [2022-07-14 07:06:59,754 INFO L137 Inliner]: procedures = 7, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 61 [2022-07-14 07:06:59,755 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 07:06:59,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 07:06:59,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 07:06:59,756 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 07:06:59,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:59" (1/1) ... [2022-07-14 07:06:59,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:59" (1/1) ... [2022-07-14 07:06:59,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:59" (1/1) ... [2022-07-14 07:06:59,769 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:59" (1/1) ... [2022-07-14 07:06:59,778 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:59" (1/1) ... [2022-07-14 07:06:59,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:59" (1/1) ... [2022-07-14 07:06:59,784 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:59" (1/1) ... [2022-07-14 07:06:59,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 07:06:59,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 07:06:59,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 07:06:59,787 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 07:06:59,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:59" (1/1) ... [2022-07-14 07:06:59,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 07:06:59,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:06:59,809 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 07:06:59,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 07:06:59,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 07:06:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 07:06:59,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 07:06:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 07:06:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 07:06:59,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 07:06:59,887 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 07:06:59,888 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 07:07:00,078 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 07:07:00,082 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 07:07:00,082 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-14 07:07:00,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 07:07:00 BoogieIcfgContainer [2022-07-14 07:07:00,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 07:07:00,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 07:07:00,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 07:07:00,087 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 07:07:00,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 07:06:59" (1/3) ... [2022-07-14 07:07:00,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ab0193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 07:07:00, skipping insertion in model container [2022-07-14 07:07:00,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 07:06:59" (2/3) ... [2022-07-14 07:07:00,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75ab0193 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 07:07:00, skipping insertion in model container [2022-07-14 07:07:00,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 07:07:00" (3/3) ... [2022-07-14 07:07:00,089 INFO L111 eAbstractionObserver]: Analyzing ICFG 4BitCounterPointer.c [2022-07-14 07:07:00,098 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 07:07:00,098 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2022-07-14 07:07:00,141 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 07:07:00,150 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=FINITE_AUTOMATA, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6911d291, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1e856902 [2022-07-14 07:07:00,150 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-07-14 07:07:00,154 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 24 states have (on average 2.5) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:00,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 07:07:00,163 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:07:00,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 07:07:00,165 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-14 07:07:00,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:07:00,170 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-14 07:07:00,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:07:00,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875931650] [2022-07-14 07:07:00,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:07:00,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:07:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:07:00,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:07:00,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:07:00,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875931650] [2022-07-14 07:07:00,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875931650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:07:00,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:07:00,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:07:00,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839649488] [2022-07-14 07:07:00,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:07:00,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:07:00,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:07:00,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:07:00,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:07:00,387 INFO L87 Difference]: Start difference. First operand has 56 states, 24 states have (on average 2.5) internal successors, (60), 55 states have internal predecessors, (60), 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) [2022-07-14 07:07:00,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:07:00,465 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-07-14 07:07:00,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:07:00,467 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 [2022-07-14 07:07:00,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:07:00,473 INFO L225 Difference]: With dead ends: 52 [2022-07-14 07:07:00,473 INFO L226 Difference]: Without dead ends: 50 [2022-07-14 07:07:00,474 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 [2022-07-14 07:07:00,479 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 49 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:07:00,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 25 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:07:00,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-14 07:07:00,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-07-14 07:07:00,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:00,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-07-14 07:07:00,509 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 3 [2022-07-14 07:07:00,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:07:00,509 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-07-14 07:07:00,509 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) [2022-07-14 07:07:00,509 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-07-14 07:07:00,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 07:07:00,510 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:07:00,510 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 07:07:00,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 07:07:00,511 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-14 07:07:00,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:07:00,512 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-14 07:07:00,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:07:00,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823837060] [2022-07-14 07:07:00,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:07:00,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:07:00,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:07:00,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:07:00,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:07:00,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823837060] [2022-07-14 07:07:00,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823837060] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:07:00,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:07:00,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:07:00,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909952734] [2022-07-14 07:07:00,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:07:00,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:07:00,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:07:00,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:07:00,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:07:00,606 INFO L87 Difference]: Start difference. First operand 50 states and 53 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) [2022-07-14 07:07:00,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:07:00,660 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-07-14 07:07:00,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:07:00,661 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 [2022-07-14 07:07:00,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:07:00,663 INFO L225 Difference]: With dead ends: 46 [2022-07-14 07:07:00,663 INFO L226 Difference]: Without dead ends: 46 [2022-07-14 07:07:00,665 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 [2022-07-14 07:07:00,667 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 47 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:07:00,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 24 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:07:00,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-14 07:07:00,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-07-14 07:07:00,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 23 states have (on average 2.130434782608696) internal successors, (49), 45 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:00,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-07-14 07:07:00,678 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 3 [2022-07-14 07:07:00,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:07:00,679 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-07-14 07:07:00,679 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) [2022-07-14 07:07:00,679 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-07-14 07:07:00,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-14 07:07:00,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:07:00,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-14 07:07:00,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 07:07:00,680 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-14 07:07:00,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:07:00,686 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2022-07-14 07:07:00,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:07:00,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705248566] [2022-07-14 07:07:00,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:07:00,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:07:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:07:00,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:07:00,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:07:00,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705248566] [2022-07-14 07:07:00,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705248566] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:07:00,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:07:00,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:07:00,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900580260] [2022-07-14 07:07:00,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:07:00,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:07:00,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:07:00,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:07:00,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:07:00,737 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:00,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:07:00,781 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-07-14 07:07:00,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:07:00,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-07-14 07:07:00,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:07:00,783 INFO L225 Difference]: With dead ends: 42 [2022-07-14 07:07:00,783 INFO L226 Difference]: Without dead ends: 42 [2022-07-14 07:07:00,783 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 [2022-07-14 07:07:00,787 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:07:00,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 18 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:07:00,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-14 07:07:00,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-07-14 07:07:00,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:00,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-07-14 07:07:00,807 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 4 [2022-07-14 07:07:00,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:07:00,807 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-07-14 07:07:00,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:00,807 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-07-14 07:07:00,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-14 07:07:00,808 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:07:00,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-14 07:07:00,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 07:07:00,808 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-14 07:07:00,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:07:00,809 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2022-07-14 07:07:00,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:07:00,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762707827] [2022-07-14 07:07:00,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:07:00,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:07:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:07:00,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:07:00,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:07:00,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762707827] [2022-07-14 07:07:00,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762707827] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:07:00,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:07:00,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:07:00,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847311575] [2022-07-14 07:07:00,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:07:00,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:07:00,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:07:00,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:07:00,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:07:00,888 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:00,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:07:00,928 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-07-14 07:07:00,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:07:00,929 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-07-14 07:07:00,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:07:00,930 INFO L225 Difference]: With dead ends: 38 [2022-07-14 07:07:00,930 INFO L226 Difference]: Without dead ends: 38 [2022-07-14 07:07:00,931 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 [2022-07-14 07:07:00,931 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 38 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:07:00,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 20 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:07:00,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-14 07:07:00,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-14 07:07:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-07-14 07:07:00,935 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 4 [2022-07-14 07:07:00,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:07:00,935 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-07-14 07:07:00,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:00,935 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-07-14 07:07:00,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 07:07:00,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:07:00,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 07:07:00,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 07:07:00,936 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-14 07:07:00,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:07:00,936 INFO L85 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times [2022-07-14 07:07:00,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:07:00,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834559276] [2022-07-14 07:07:00,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:07:00,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:07:00,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:07:00,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:07:00,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:07:00,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834559276] [2022-07-14 07:07:00,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834559276] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:07:00,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:07:00,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:07:00,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113155910] [2022-07-14 07:07:00,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:07:00,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:07:00,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:07:00,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:07:00,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:07:00,970 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:00,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:07:00,995 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-07-14 07:07:00,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:07:00,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 07:07:00,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:07:00,996 INFO L225 Difference]: With dead ends: 34 [2022-07-14 07:07:00,997 INFO L226 Difference]: Without dead ends: 34 [2022-07-14 07:07:00,997 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 [2022-07-14 07:07:00,997 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:07:00,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 14 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:07:00,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-14 07:07:00,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-14 07:07:01,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.608695652173913) internal successors, (37), 33 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) [2022-07-14 07:07:01,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-07-14 07:07:01,000 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 5 [2022-07-14 07:07:01,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:07:01,001 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-07-14 07:07:01,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:01,001 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-07-14 07:07:01,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-14 07:07:01,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:07:01,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-14 07:07:01,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 07:07:01,002 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-14 07:07:01,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:07:01,002 INFO L85 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times [2022-07-14 07:07:01,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:07:01,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87066009] [2022-07-14 07:07:01,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:07:01,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:07:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:07:01,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:07:01,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:07:01,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87066009] [2022-07-14 07:07:01,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87066009] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:07:01,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:07:01,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:07:01,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108350794] [2022-07-14 07:07:01,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:07:01,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:07:01,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:07:01,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:07:01,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:07:01,049 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:01,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:07:01,071 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-07-14 07:07:01,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:07:01,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-14 07:07:01,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:07:01,073 INFO L225 Difference]: With dead ends: 30 [2022-07-14 07:07:01,073 INFO L226 Difference]: Without dead ends: 30 [2022-07-14 07:07:01,074 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 [2022-07-14 07:07:01,075 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:07:01,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 16 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:07:01,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-14 07:07:01,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-14 07:07:01,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.434782608695652) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:01,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-07-14 07:07:01,082 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 5 [2022-07-14 07:07:01,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:07:01,083 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-07-14 07:07:01,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:01,083 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-07-14 07:07:01,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 07:07:01,083 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:07:01,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 07:07:01,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 07:07:01,083 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-14 07:07:01,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:07:01,084 INFO L85 PathProgramCache]: Analyzing trace with hash 889446154, now seen corresponding path program 1 times [2022-07-14 07:07:01,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:07:01,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600140073] [2022-07-14 07:07:01,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:07:01,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:07:01,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:07:01,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:07:01,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:07:01,118 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600140073] [2022-07-14 07:07:01,118 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600140073] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:07:01,118 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:07:01,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:07:01,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622044029] [2022-07-14 07:07:01,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:07:01,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:07:01,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:07:01,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:07:01,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:07:01,120 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:01,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:07:01,141 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-07-14 07:07:01,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:07:01,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-07-14 07:07:01,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:07:01,142 INFO L225 Difference]: With dead ends: 27 [2022-07-14 07:07:01,143 INFO L226 Difference]: Without dead ends: 27 [2022-07-14 07:07:01,143 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 [2022-07-14 07:07:01,144 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:07:01,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 11 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:07:01,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-14 07:07:01,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-14 07:07:01,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:01,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-07-14 07:07:01,148 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2022-07-14 07:07:01,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:07:01,148 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-07-14 07:07:01,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:01,149 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-07-14 07:07:01,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 07:07:01,149 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:07:01,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 07:07:01,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 07:07:01,149 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-14 07:07:01,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:07:01,149 INFO L85 PathProgramCache]: Analyzing trace with hash 889446155, now seen corresponding path program 1 times [2022-07-14 07:07:01,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:07:01,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46132247] [2022-07-14 07:07:01,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:07:01,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:07:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:07:01,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:07:01,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:07:01,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46132247] [2022-07-14 07:07:01,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46132247] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:07:01,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:07:01,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 07:07:01,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479282655] [2022-07-14 07:07:01,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:07:01,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 07:07:01,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:07:01,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 07:07:01,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 07:07:01,188 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:01,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:07:01,201 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-07-14 07:07:01,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 07:07:01,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-07-14 07:07:01,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:07:01,201 INFO L225 Difference]: With dead ends: 24 [2022-07-14 07:07:01,201 INFO L226 Difference]: Without dead ends: 24 [2022-07-14 07:07:01,202 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 [2022-07-14 07:07:01,202 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:07:01,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 13 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:07:01,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-14 07:07:01,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-14 07:07:01,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:01,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-07-14 07:07:01,204 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 6 [2022-07-14 07:07:01,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:07:01,204 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-07-14 07:07:01,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:01,205 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-07-14 07:07:01,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 07:07:01,205 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:07:01,205 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:07:01,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 07:07:01,205 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-14 07:07:01,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:07:01,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1115961648, now seen corresponding path program 1 times [2022-07-14 07:07:01,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:07:01,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724850046] [2022-07-14 07:07:01,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:07:01,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:07:01,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:07:01,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:07:01,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:07:01,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724850046] [2022-07-14 07:07:01,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724850046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:07:01,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:07:01,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 07:07:01,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692679251] [2022-07-14 07:07:01,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:07:01,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 07:07:01,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:07:01,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 07:07:01,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 07:07:01,231 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) [2022-07-14 07:07:01,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:07:01,264 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-07-14 07:07:01,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 07:07:01,264 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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 [2022-07-14 07:07:01,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:07:01,265 INFO L225 Difference]: With dead ends: 39 [2022-07-14 07:07:01,265 INFO L226 Difference]: Without dead ends: 39 [2022-07-14 07:07:01,265 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 [2022-07-14 07:07:01,266 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:07:01,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 39 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:07:01,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-14 07:07:01,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2022-07-14 07:07:01,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 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) [2022-07-14 07:07:01,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-07-14 07:07:01,268 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 10 [2022-07-14 07:07:01,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:07:01,268 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-07-14 07:07:01,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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) [2022-07-14 07:07:01,268 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-07-14 07:07:01,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 07:07:01,269 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:07:01,269 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:07:01,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 07:07:01,269 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-14 07:07:01,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:07:01,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1456723757, now seen corresponding path program 1 times [2022-07-14 07:07:01,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:07:01,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152690662] [2022-07-14 07:07:01,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:07:01,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:07:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:07:01,334 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:07:01,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:07:01,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152690662] [2022-07-14 07:07:01,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152690662] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:07:01,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706293625] [2022-07-14 07:07:01,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:07:01,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:07:01,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:07:01,338 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 07:07:01,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 07:07:01,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:07:01,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-14 07:07:01,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:07:01,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-07-14 07:07:01,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 07:07:01,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 07:07:01,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 07:07:01,501 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:07:01,501 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:07:01,510 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2022-07-14 07:07:01,537 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:07:01,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-14 07:07:01,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-07-14 07:07:01,558 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-14 07:07:01,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706293625] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:07:01,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:07:01,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2022-07-14 07:07:01,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725041981] [2022-07-14 07:07:01,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:07:01,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 07:07:01,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:07:01,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 07:07:01,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2022-07-14 07:07:01,560 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:01,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:07:01,611 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-07-14 07:07:01,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 07:07:01,612 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-14 07:07:01,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:07:01,612 INFO L225 Difference]: With dead ends: 41 [2022-07-14 07:07:01,613 INFO L226 Difference]: Without dead ends: 41 [2022-07-14 07:07:01,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=26, Unknown=1, NotChecked=10, Total=56 [2022-07-14 07:07:01,613 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 35 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:07:01,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 48 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 60 Invalid, 0 Unknown, 39 Unchecked, 0.0s Time] [2022-07-14 07:07:01,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-14 07:07:01,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2022-07-14 07:07:01,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:01,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-07-14 07:07:01,616 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 15 [2022-07-14 07:07:01,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:07:01,616 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-07-14 07:07:01,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:01,617 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-07-14 07:07:01,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 07:07:01,617 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:07:01,617 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:07:01,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-14 07:07:01,818 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,SelfDestructingSolverStorable9 [2022-07-14 07:07:01,819 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-14 07:07:01,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:07:01,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1715432197, now seen corresponding path program 1 times [2022-07-14 07:07:01,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:07:01,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575165029] [2022-07-14 07:07:01,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:07:01,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:07:01,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:07:02,101 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:07:02,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:07:02,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575165029] [2022-07-14 07:07:02,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575165029] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:07:02,102 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:07:02,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 07:07:02,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841272848] [2022-07-14 07:07:02,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:07:02,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 07:07:02,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:07:02,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 07:07:02,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 07:07:02,103 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:02,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:07:02,394 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-07-14 07:07:02,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 07:07:02,395 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 07:07:02,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:07:02,395 INFO L225 Difference]: With dead ends: 55 [2022-07-14 07:07:02,395 INFO L226 Difference]: Without dead ends: 55 [2022-07-14 07:07:02,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-14 07:07:02,396 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 71 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:07:02,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 70 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 07:07:02,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-14 07:07:02,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2022-07-14 07:07:02,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 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) [2022-07-14 07:07:02,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-07-14 07:07:02,398 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 18 [2022-07-14 07:07:02,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:07:02,398 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-07-14 07:07:02,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:02,398 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-07-14 07:07:02,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 07:07:02,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:07:02,398 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:07:02,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 07:07:02,399 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-14 07:07:02,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:07:02,399 INFO L85 PathProgramCache]: Analyzing trace with hash -2128935000, now seen corresponding path program 1 times [2022-07-14 07:07:02,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:07:02,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462095689] [2022-07-14 07:07:02,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:07:02,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:07:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:07:02,594 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 07:07:02,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:07:02,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462095689] [2022-07-14 07:07:02,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462095689] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:07:02,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055705932] [2022-07-14 07:07:02,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:07:02,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:07:02,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:07:02,608 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 07:07:02,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 07:07:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:07:02,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-14 07:07:02,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:07:02,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2022-07-14 07:07:02,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 07:07:02,846 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 07:07:02,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2022-07-14 07:07:02,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 07:07:02,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 07:07:02,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:07:02,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:07:02,907 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_326 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2022-07-14 07:07:02,917 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_326 (Array Int Int)) (v_ArrVal_325 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|))) is different from false [2022-07-14 07:07:02,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2022-07-14 07:07:02,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-07-14 07:07:02,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-07-14 07:07:03,043 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-14 07:07:03,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055705932] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:07:03,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:07:03,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2022-07-14 07:07:03,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676100603] [2022-07-14 07:07:03,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:07:03,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-14 07:07:03,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:07:03,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-14 07:07:03,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=303, Unknown=2, NotChecked=74, Total=462 [2022-07-14 07:07:03,046 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:03,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:07:03,380 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-07-14 07:07:03,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 07:07:03,381 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 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 [2022-07-14 07:07:03,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:07:03,381 INFO L225 Difference]: With dead ends: 59 [2022-07-14 07:07:03,381 INFO L226 Difference]: Without dead ends: 59 [2022-07-14 07:07:03,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=683, Unknown=2, NotChecked=118, Total=1056 [2022-07-14 07:07:03,382 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 157 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:07:03,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 107 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 152 Invalid, 0 Unknown, 128 Unchecked, 0.1s Time] [2022-07-14 07:07:03,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-14 07:07:03,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2022-07-14 07:07:03,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:03,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-07-14 07:07:03,384 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 23 [2022-07-14 07:07:03,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:07:03,384 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-07-14 07:07:03,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:03,384 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-07-14 07:07:03,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 07:07:03,384 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:07:03,385 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:07:03,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 07:07:03,591 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,SelfDestructingSolverStorable11 [2022-07-14 07:07:03,592 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-14 07:07:03,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:07:03,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1038287010, now seen corresponding path program 1 times [2022-07-14 07:07:03,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:07:03,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886636117] [2022-07-14 07:07:03,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:07:03,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:07:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:07:03,938 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 07:07:03,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:07:03,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886636117] [2022-07-14 07:07:03,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886636117] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:07:03,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685881721] [2022-07-14 07:07:03,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:07:03,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:07:03,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:07:03,940 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 07:07:03,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 07:07:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:07:04,005 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-14 07:07:04,011 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:07:04,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 414 treesize of output 406 [2022-07-14 07:07:04,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 07:07:04,201 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-14 07:07:04,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-14 07:07:04,290 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 07:07:04,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 25 [2022-07-14 07:07:04,326 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-14 07:07:04,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 07:07:04,360 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 07:07:04,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 07:07:04,378 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:07:04,378 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:07:04,386 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_405 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2022-07-14 07:07:04,393 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2022-07-14 07:07:04,403 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_402))) (store .cse0 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2022-07-14 07:07:04,515 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:07:04,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 40 [2022-07-14 07:07:04,524 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:07:04,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 390 treesize of output 382 [2022-07-14 07:07:04,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 368 treesize of output 344 [2022-07-14 07:07:04,544 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 356 treesize of output 346 [2022-07-14 07:07:04,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 246 treesize of output 238 [2022-07-14 07:07:04,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-14 07:07:04,763 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-14 07:07:04,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685881721] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:07:04,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:07:04,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 29 [2022-07-14 07:07:04,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709686822] [2022-07-14 07:07:04,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:07:04,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-14 07:07:04,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:07:04,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-14 07:07:04,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=534, Unknown=3, NotChecked=150, Total=812 [2022-07-14 07:07:04,765 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:04,926 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_402))) (store .cse0 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2022-07-14 07:07:05,970 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0) (forall ((v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))) is different from false [2022-07-14 07:07:06,923 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (.cse1 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))) (and (or (and (= |c_ULTIMATE.start_main_~x3~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) (= |c_ULTIMATE.start_main_#t~mem6#1| 0)) (not .cse0)) (or .cse0 .cse1) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) .cse1 (forall ((v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) is different from false [2022-07-14 07:07:07,866 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0) (forall ((v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))) is different from false [2022-07-14 07:07:08,107 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)))) (and (or (= |c_ULTIMATE.start_main_~x3~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) .cse0) (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) .cse0 (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_402))) (store .cse1 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))) is different from false [2022-07-14 07:07:08,116 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|))) (and (or (and (= |c_ULTIMATE.start_main_~x0~0#1.offset| |c_ULTIMATE.start_main_~x3~0#1.offset|) (= |c_ULTIMATE.start_main_#t~mem5#1| 0)) (not .cse0)) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_402))) (store .cse1 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (or .cse0 (and (or (= |c_ULTIMATE.start_main_~x3~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))))) is different from false [2022-07-14 07:07:08,130 WARN L833 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_main_~x3~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|))) (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_402))) (store .cse0 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2022-07-14 07:07:08,813 WARN L833 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_main_~x3~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|))) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0) (forall ((v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))) is different from false [2022-07-14 07:07:10,820 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|))) (and (or (and (= |c_ULTIMATE.start_main_~x3~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) (= |c_ULTIMATE.start_main_#t~mem6#1| 0)) (not .cse0)) (or .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (forall ((v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) is different from false [2022-07-14 07:07:12,838 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0) (forall ((v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))) is different from false [2022-07-14 07:07:12,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:07:12,868 INFO L93 Difference]: Finished difference Result 137 states and 162 transitions. [2022-07-14 07:07:12,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-14 07:07:12,869 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-14 07:07:12,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:07:12,869 INFO L225 Difference]: With dead ends: 137 [2022-07-14 07:07:12,869 INFO L226 Difference]: Without dead ends: 137 [2022-07-14 07:07:12,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=273, Invalid=1026, Unknown=13, NotChecked=1040, Total=2352 [2022-07-14 07:07:12,870 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 105 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 358 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 07:07:12,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 244 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 311 Invalid, 0 Unknown, 358 Unchecked, 0.2s Time] [2022-07-14 07:07:12,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-14 07:07:12,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 77. [2022-07-14 07:07:12,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:12,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2022-07-14 07:07:12,874 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 26 [2022-07-14 07:07:12,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:07:12,874 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2022-07-14 07:07:12,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:12,874 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2022-07-14 07:07:12,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 07:07:12,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:07:12,875 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:07:12,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 07:07:13,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:07:13,076 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-14 07:07:13,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:07:13,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1790452235, now seen corresponding path program 1 times [2022-07-14 07:07:13,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:07:13,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780189902] [2022-07-14 07:07:13,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:07:13,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:07:13,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:07:13,299 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:07:13,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:07:13,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780189902] [2022-07-14 07:07:13,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780189902] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:07:13,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1735882251] [2022-07-14 07:07:13,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:07:13,300 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:07:13,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:07:13,302 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 07:07:13,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 07:07:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:07:13,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-14 07:07:13,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:07:13,392 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 07:07:13,421 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:07:13,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 07:07:13,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 07:07:13,505 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:07:13,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-07-14 07:07:13,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 07:07:13,674 INFO L356 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-07-14 07:07:13,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 44 [2022-07-14 07:07:13,723 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-14 07:07:13,724 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 07:07:13,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 07:07:13,747 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:07:13,747 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:07:14,915 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0)) is different from false [2022-07-14 07:07:16,763 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x1~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_481 (Array Int Int))) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_481 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)))) (store .cse0 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_481) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) is different from false [2022-07-14 07:07:16,806 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x3~0#1.base| Int) (|ULTIMATE.start_main_~x1~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_481 (Array Int Int)) (v_ArrVal_480 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_main_~x3~0#1.base| v_ArrVal_480))) (or (= (select (select (let ((.cse0 (store .cse1 |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_481 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)))) (store .cse0 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (not (= (select (select (store .cse1 |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_481) |ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))))) is different from false [2022-07-14 07:07:16,812 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:07:16,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 56 [2022-07-14 07:07:16,827 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:07:16,827 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1032 treesize of output 1016 [2022-07-14 07:07:16,841 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:07:16,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1182 treesize of output 1144 [2022-07-14 07:07:16,883 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:07:16,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1074 treesize of output 1034 [2022-07-14 07:07:17,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2022-07-14 07:07:17,495 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-14 07:07:17,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1735882251] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:07:17,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:07:17,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 24 [2022-07-14 07:07:17,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319217182] [2022-07-14 07:07:17,496 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:07:17,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-14 07:07:17,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:07:17,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-14 07:07:17,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=333, Unknown=5, NotChecked=120, Total=552 [2022-07-14 07:07:17,497 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:17,532 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (forall ((|ULTIMATE.start_main_~x3~0#1.base| Int) (|ULTIMATE.start_main_~x1~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_481 (Array Int Int)) (v_ArrVal_480 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_main_~x3~0#1.base| v_ArrVal_480))) (or (= (select (select (let ((.cse0 (store .cse1 |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_481 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)))) (store .cse0 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (not (= (select (select (store .cse1 |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_481) |ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))))) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (= |c_ULTIMATE.start_main_~x2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x0~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|)) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|))) is different from false [2022-07-14 07:07:17,535 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0)) (.cse2 (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|))) (and .cse0 (forall ((|ULTIMATE.start_main_~x1~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_481 (Array Int Int))) (or (= (select (select (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_481 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)))) (store .cse1 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_481) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (or .cse0 .cse2) (= |c_ULTIMATE.start_main_~x2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x0~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|)) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (not .cse2))) is different from false [2022-07-14 07:07:18,575 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~x2~0#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (= |c_ULTIMATE.start_main_~x2~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|)) (forall ((|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0)) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)))) is different from false [2022-07-14 07:07:19,933 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~x2~0#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (= |c_ULTIMATE.start_main_~x2~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0)) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)))) is different from false [2022-07-14 07:07:21,034 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x2~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x2~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) is different from false [2022-07-14 07:07:21,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:07:21,077 INFO L93 Difference]: Finished difference Result 93 states and 111 transitions. [2022-07-14 07:07:21,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 07:07:21,078 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 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 27 [2022-07-14 07:07:21,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:07:21,079 INFO L225 Difference]: With dead ends: 93 [2022-07-14 07:07:21,079 INFO L226 Difference]: Without dead ends: 93 [2022-07-14 07:07:21,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 35 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=186, Invalid=648, Unknown=10, NotChecked=488, Total=1332 [2022-07-14 07:07:21,080 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 07:07:21,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 84 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 106 Invalid, 0 Unknown, 129 Unchecked, 0.1s Time] [2022-07-14 07:07:21,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-14 07:07:21,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2022-07-14 07:07:21,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.211111111111111) internal successors, (109), 90 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:21,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2022-07-14 07:07:21,087 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 27 [2022-07-14 07:07:21,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:07:21,087 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2022-07-14 07:07:21,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:21,087 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2022-07-14 07:07:21,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-14 07:07:21,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:07:21,091 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:07:21,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 07:07:21,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:07:21,303 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-14 07:07:21,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:07:21,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1453199205, now seen corresponding path program 2 times [2022-07-14 07:07:21,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:07:21,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199328326] [2022-07-14 07:07:21,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:07:21,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:07:21,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:07:21,420 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 07:07:21,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:07:21,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199328326] [2022-07-14 07:07:21,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199328326] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:07:21,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634587279] [2022-07-14 07:07:21,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 07:07:21,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:07:21,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:07:21,422 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 07:07:21,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 07:07:21,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-14 07:07:21,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 07:07:21,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-14 07:07:21,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:07:21,775 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-14 07:07:21,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 07:07:21,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634587279] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:07:21,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 07:07:21,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2022-07-14 07:07:21,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803619164] [2022-07-14 07:07:21,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:07:21,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 07:07:21,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:07:21,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 07:07:21,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-07-14 07:07:21,776 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:21,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:07:21,777 INFO L93 Difference]: Finished difference Result 118 states and 142 transitions. [2022-07-14 07:07:21,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 07:07:21,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-14 07:07:21,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:07:21,778 INFO L225 Difference]: With dead ends: 118 [2022-07-14 07:07:21,778 INFO L226 Difference]: Without dead ends: 116 [2022-07-14 07:07:21,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-07-14 07:07:21,778 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:07:21,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 31 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 24 Unchecked, 0.0s Time] [2022-07-14 07:07:21,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-14 07:07:21,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 74. [2022-07-14 07:07:21,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 73 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2022-07-14 07:07:21,780 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 31 [2022-07-14 07:07:21,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:07:21,781 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2022-07-14 07:07:21,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:21,781 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2022-07-14 07:07:21,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-14 07:07:21,781 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:07:21,781 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:07:21,800 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 07:07:21,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-14 07:07:21,995 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-14 07:07:21,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:07:21,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1610490675, now seen corresponding path program 1 times [2022-07-14 07:07:21,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:07:21,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976915123] [2022-07-14 07:07:21,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:07:21,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:07:22,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:07:22,118 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:07:22,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:07:22,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976915123] [2022-07-14 07:07:22,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976915123] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:07:22,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62726165] [2022-07-14 07:07:22,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:07:22,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:07:22,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:07:22,121 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 07:07:22,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 07:07:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:07:22,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-14 07:07:22,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:07:22,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 07:07:22,238 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:07:22,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-14 07:07:22,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 07:07:22,275 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:07:22,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 24 [2022-07-14 07:07:22,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 07:07:22,361 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 07:07:22,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 27 [2022-07-14 07:07:22,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 07:07:22,520 INFO L356 Elim1Store]: treesize reduction 28, result has 49.1 percent of original size [2022-07-14 07:07:22,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 47 [2022-07-14 07:07:22,586 INFO L356 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-07-14 07:07:22,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 33 [2022-07-14 07:07:22,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 07:07:22,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 07:07:22,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 07:07:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:07:22,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:07:22,722 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_657 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_657) |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0))) is different from false [2022-07-14 07:07:22,731 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:07:22,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2022-07-14 07:07:22,737 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:07:22,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2022-07-14 07:07:22,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-07-14 07:07:23,181 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x3~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_650 (Array Int Int)) (v_ArrVal_652 (Array Int Int)) (v_ArrVal_651 (Array Int Int)) (|ULTIMATE.start_main_~x2~0#1.base| Int)) (let ((.cse0 (store (store |c_#memory_int| |ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_650) |ULTIMATE.start_main_~x3~0#1.base| v_ArrVal_651))) (or (and (not (= |ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (= |ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|) (= |c_ULTIMATE.start_main_~x2~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|)) (= (select (select (store .cse0 |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)) |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= (select (select (store .cse0 |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_652) |ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))))) is different from false [2022-07-14 07:07:23,190 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:07:23,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 45 [2022-07-14 07:07:23,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1092 treesize of output 1056 [2022-07-14 07:07:23,230 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:07:23,230 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1176 treesize of output 1118 [2022-07-14 07:07:23,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 930 treesize of output 914 [2022-07-14 07:07:23,274 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 07:07:23,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 934 treesize of output 908 [2022-07-14 07:07:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-14 07:07:24,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62726165] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 07:07:24,268 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 07:07:24,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 15] total 34 [2022-07-14 07:07:24,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807097803] [2022-07-14 07:07:24,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 07:07:24,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-14 07:07:24,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:07:24,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-14 07:07:24,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=830, Unknown=38, NotChecked=122, Total=1122 [2022-07-14 07:07:24,269 INFO L87 Difference]: Start difference. First operand 74 states and 88 transitions. Second operand has 34 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:24,323 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~x3~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_650 (Array Int Int)) (v_ArrVal_652 (Array Int Int)) (v_ArrVal_651 (Array Int Int)) (|ULTIMATE.start_main_~x2~0#1.base| Int)) (let ((.cse0 (store (store |c_#memory_int| |ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_650) |ULTIMATE.start_main_~x3~0#1.base| v_ArrVal_651))) (or (and (not (= |ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (= |ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|) (= |c_ULTIMATE.start_main_~x2~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|)) (= (select (select (store .cse0 |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)) |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= (select (select (store .cse0 |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_652) |ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))))) (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_#t~malloc1#1.base| |c_ULTIMATE.start_main_#t~malloc0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base|) |c_ULTIMATE.start_main_~x0~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~x2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x0~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|)) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) is different from false [2022-07-14 07:07:26,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:07:26,054 INFO L93 Difference]: Finished difference Result 220 states and 258 transitions. [2022-07-14 07:07:26,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-07-14 07:07:26,055 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-14 07:07:26,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:07:26,055 INFO L225 Difference]: With dead ends: 220 [2022-07-14 07:07:26,055 INFO L226 Difference]: Without dead ends: 220 [2022-07-14 07:07:26,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 46 SyntacticMatches, 13 SemanticMatches, 79 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 1895 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=930, Invalid=5011, Unknown=77, NotChecked=462, Total=6480 [2022-07-14 07:07:26,058 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 122 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 443 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 07:07:26,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 282 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 371 Invalid, 0 Unknown, 443 Unchecked, 0.2s Time] [2022-07-14 07:07:26,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-07-14 07:07:26,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 159. [2022-07-14 07:07:26,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.2215189873417722) internal successors, (193), 158 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:26,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 193 transitions. [2022-07-14 07:07:26,062 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 193 transitions. Word has length 34 [2022-07-14 07:07:26,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:07:26,062 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 193 transitions. [2022-07-14 07:07:26,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:26,063 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 193 transitions. [2022-07-14 07:07:26,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-14 07:07:26,064 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:07:26,064 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:07:26,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-14 07:07:26,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-14 07:07:26,281 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-14 07:07:26,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:07:26,281 INFO L85 PathProgramCache]: Analyzing trace with hash 932056085, now seen corresponding path program 2 times [2022-07-14 07:07:26,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:07:26,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345926136] [2022-07-14 07:07:26,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:07:26,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:07:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:07:26,317 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-14 07:07:26,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:07:26,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345926136] [2022-07-14 07:07:26,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345926136] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 07:07:26,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 07:07:26,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 07:07:26,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537007993] [2022-07-14 07:07:26,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:07:26,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 07:07:26,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:07:26,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 07:07:26,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 07:07:26,320 INFO L87 Difference]: Start difference. First operand 159 states and 193 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:26,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:07:26,338 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-07-14 07:07:26,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 07:07:26,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 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 37 [2022-07-14 07:07:26,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:07:26,339 INFO L225 Difference]: With dead ends: 77 [2022-07-14 07:07:26,339 INFO L226 Difference]: Without dead ends: 77 [2022-07-14 07:07:26,339 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 [2022-07-14 07:07:26,340 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:07:26,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 66 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:07:26,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-14 07:07:26,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2022-07-14 07:07:26,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.1369863013698631) internal successors, (83), 73 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:26,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2022-07-14 07:07:26,342 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 37 [2022-07-14 07:07:26,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:07:26,342 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2022-07-14 07:07:26,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:26,342 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2022-07-14 07:07:26,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-14 07:07:26,343 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 07:07:26,346 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:07:26,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 07:07:26,347 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-14 07:07:26,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 07:07:26,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1795695146, now seen corresponding path program 2 times [2022-07-14 07:07:26,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 07:07:26,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859010537] [2022-07-14 07:07:26,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 07:07:26,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 07:07:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 07:07:26,745 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 07:07:26,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 07:07:26,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859010537] [2022-07-14 07:07:26,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859010537] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 07:07:26,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1413039399] [2022-07-14 07:07:26,746 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 07:07:26,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:07:26,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 07:07:26,747 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 07:07:26,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 07:07:26,818 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-14 07:07:26,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 07:07:26,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-14 07:07:26,821 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 07:07:27,330 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-14 07:07:27,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 07:07:27,483 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-14 07:07:27,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1413039399] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-14 07:07:27,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-14 07:07:27,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [16, 4] total 22 [2022-07-14 07:07:27,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298871494] [2022-07-14 07:07:27,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 07:07:27,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 07:07:27,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 07:07:27,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 07:07:27,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-07-14 07:07:27,485 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:27,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 07:07:27,519 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2022-07-14 07:07:27,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 07:07:27,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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 39 [2022-07-14 07:07:27,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 07:07:27,519 INFO L225 Difference]: With dead ends: 73 [2022-07-14 07:07:27,519 INFO L226 Difference]: Without dead ends: 0 [2022-07-14 07:07:27,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-07-14 07:07:27,520 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 22 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 07:07:27,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 18 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 07:07:27,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-14 07:07:27,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-14 07:07:27,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:27,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-14 07:07:27,521 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2022-07-14 07:07:27,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 07:07:27,521 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-14 07:07:27,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 07:07:27,521 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-14 07:07:27,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-14 07:07:27,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 31 remaining) [2022-07-14 07:07:27,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 31 remaining) [2022-07-14 07:07:27,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2022-07-14 07:07:27,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2022-07-14 07:07:27,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2022-07-14 07:07:27,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2022-07-14 07:07:27,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2022-07-14 07:07:27,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2022-07-14 07:07:27,523 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2022-07-14 07:07:27,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 31 remaining) [2022-07-14 07:07:27,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2022-07-14 07:07:27,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2022-07-14 07:07:27,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 31 remaining) [2022-07-14 07:07:27,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2022-07-14 07:07:27,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2022-07-14 07:07:27,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2022-07-14 07:07:27,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2022-07-14 07:07:27,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2022-07-14 07:07:27,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2022-07-14 07:07:27,524 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2022-07-14 07:07:27,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2022-07-14 07:07:27,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 31 remaining) [2022-07-14 07:07:27,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 31 remaining) [2022-07-14 07:07:27,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 31 remaining) [2022-07-14 07:07:27,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 31 remaining) [2022-07-14 07:07:27,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 31 remaining) [2022-07-14 07:07:27,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 31 remaining) [2022-07-14 07:07:27,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 31 remaining) [2022-07-14 07:07:27,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 31 remaining) [2022-07-14 07:07:27,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 31 remaining) [2022-07-14 07:07:27,525 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (0 of 31 remaining) [2022-07-14 07:07:27,542 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-14 07:07:27,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 07:07:27,742 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 07:07:27,743 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-14 07:07:27,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.07 07:07:27 BoogieIcfgContainer [2022-07-14 07:07:27,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-14 07:07:27,745 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-14 07:07:27,745 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-14 07:07:27,745 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-14 07:07:27,745 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 07:07:00" (3/4) ... [2022-07-14 07:07:27,747 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-14 07:07:27,753 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-14 07:07:27,753 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-14 07:07:27,753 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-14 07:07:27,753 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-14 07:07:27,783 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-14 07:07:27,783 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-14 07:07:27,784 INFO L158 Benchmark]: Toolchain (without parser) took 28215.04ms. Allocated memory was 121.6MB in the beginning and 180.4MB in the end (delta: 58.7MB). Free memory was 86.9MB in the beginning and 127.0MB in the end (delta: -40.1MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2022-07-14 07:07:27,784 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 75.5MB. Free memory was 32.7MB in the beginning and 32.6MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 07:07:27,784 INFO L158 Benchmark]: CACSL2BoogieTranslator took 156.90ms. Allocated memory is still 121.6MB. Free memory was 86.7MB in the beginning and 95.8MB in the end (delta: -9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 07:07:27,784 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.24ms. Allocated memory is still 121.6MB. Free memory was 95.8MB in the beginning and 94.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 07:07:27,784 INFO L158 Benchmark]: Boogie Preprocessor took 29.73ms. Allocated memory is still 121.6MB. Free memory was 94.3MB in the beginning and 93.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 07:07:27,784 INFO L158 Benchmark]: RCFGBuilder took 297.82ms. Allocated memory is still 121.6MB. Free memory was 93.1MB in the beginning and 79.7MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-14 07:07:27,785 INFO L158 Benchmark]: TraceAbstraction took 27659.75ms. Allocated memory was 121.6MB in the beginning and 180.4MB in the end (delta: 58.7MB). Free memory was 79.0MB in the beginning and 129.7MB in the end (delta: -50.7MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. [2022-07-14 07:07:27,785 INFO L158 Benchmark]: Witness Printer took 38.32ms. Allocated memory is still 180.4MB. Free memory was 129.7MB in the beginning and 127.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 07:07:27,785 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 75.5MB. Free memory was 32.7MB in the beginning and 32.6MB in the end (delta: 41.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 156.90ms. Allocated memory is still 121.6MB. Free memory was 86.7MB in the beginning and 95.8MB in the end (delta: -9.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.24ms. Allocated memory is still 121.6MB. Free memory was 95.8MB in the beginning and 94.3MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.73ms. Allocated memory is still 121.6MB. Free memory was 94.3MB in the beginning and 93.1MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 297.82ms. Allocated memory is still 121.6MB. Free memory was 93.1MB in the beginning and 79.7MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 27659.75ms. Allocated memory was 121.6MB in the beginning and 180.4MB in the end (delta: 58.7MB). Free memory was 79.0MB in the beginning and 129.7MB in the end (delta: -50.7MB). Peak memory consumption was 9.9MB. Max. memory is 16.1GB. * Witness Printer took 38.32ms. Allocated memory is still 180.4MB. Free memory was 129.7MB in the beginning and 127.0MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 56 locations, 31 error locations. Started 1 CEGAR loops. OverallTime: 27.6s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 14.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 814 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 814 mSDsluCounter, 1130 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1121 IncrementalHoareTripleChecker+Unchecked, 840 mSDsCounter, 363 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1395 IncrementalHoareTripleChecker+Invalid, 2879 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 363 mSolverCounterUnsat, 290 mSDtfsCounter, 1395 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 591 GetRequests, 316 SyntacticMatches, 22 SemanticMatches, 253 ConstructedPredicates, 27 IntricatePredicates, 2 DeprecatedPredicates, 2842 ImplicationChecksByTransitivity, 18.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=159occurred in iteration=16, InterpolantAutomatonStates: 183, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 235 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 491 NumberOfCodeBlocks, 441 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 624 ConstructedInterpolants, 130 QuantifiedInterpolants, 11976 SizeOfPredicates, 86 NumberOfNonLiveVariables, 1284 ConjunctsInSsa, 248 ConjunctsInUnsatCore, 31 InterpolantComputations, 13 PerfectInterpolantSequences, 194/324 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-07-14 07:07:27,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE