./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 6c24879c 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-?-6c24879 [2022-07-12 19:27:39,501 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 19:27:39,528 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 19:27:39,565 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 19:27:39,566 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 19:27:39,567 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 19:27:39,569 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 19:27:39,571 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 19:27:39,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 19:27:39,575 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 19:27:39,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 19:27:39,578 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 19:27:39,578 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 19:27:39,580 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 19:27:39,580 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 19:27:39,583 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 19:27:39,584 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 19:27:39,585 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 19:27:39,586 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 19:27:39,590 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 19:27:39,592 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 19:27:39,593 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 19:27:39,593 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 19:27:39,594 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 19:27:39,595 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 19:27:39,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 19:27:39,601 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 19:27:39,601 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 19:27:39,602 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 19:27:39,603 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 19:27:39,604 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 19:27:39,604 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 19:27:39,605 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 19:27:39,606 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 19:27:39,606 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 19:27:39,607 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 19:27:39,607 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 19:27:39,607 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 19:27:39,609 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 19:27:39,609 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 19:27:39,610 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 19:27:39,611 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 19:27:39,611 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2022-07-12 19:27:39,635 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 19:27:39,636 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 19:27:39,636 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 19:27:39,636 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 19:27:39,637 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 19:27:39,637 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 19:27:39,638 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 19:27:39,638 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 19:27:39,638 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 19:27:39,639 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 19:27:39,639 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 19:27:39,639 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 19:27:39,639 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 19:27:39,639 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 19:27:39,639 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 19:27:39,640 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 19:27:39,640 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 19:27:39,640 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 19:27:39,641 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 19:27:39,641 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 19:27:39,641 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 19:27:39,641 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 19:27:39,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:27:39,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 19:27:39,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 19:27:39,642 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 19:27:39,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 19:27:39,642 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-12 19:27:39,862 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 19:27:39,878 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 19:27:39,880 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 19:27:39,881 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 19:27:39,881 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 19:27:39,882 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-12 19:27:39,923 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67b79b468/ba380932c1c440a7a1cad2da8b7034bc/FLAGbad2f526b [2022-07-12 19:27:40,222 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 19:27:40,223 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2022-07-12 19:27:40,228 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67b79b468/ba380932c1c440a7a1cad2da8b7034bc/FLAGbad2f526b [2022-07-12 19:27:40,651 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67b79b468/ba380932c1c440a7a1cad2da8b7034bc [2022-07-12 19:27:40,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 19:27:40,655 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 19:27:40,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 19:27:40,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 19:27:40,659 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 19:27:40,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:27:40" (1/1) ... [2022-07-12 19:27:40,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41c207d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:27:40, skipping insertion in model container [2022-07-12 19:27:40,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 07:27:40" (1/1) ... [2022-07-12 19:27:40,665 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 19:27:40,672 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 19:27:40,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:27:40,771 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 19:27:40,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 19:27:40,792 INFO L208 MainTranslator]: Completed translation [2022-07-12 19:27:40,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:27:40 WrapperNode [2022-07-12 19:27:40,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 19:27:40,793 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 19:27:40,793 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 19:27:40,793 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 19:27:40,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:27:40" (1/1) ... [2022-07-12 19:27:40,804 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:27:40" (1/1) ... [2022-07-12 19:27:40,819 INFO L137 Inliner]: procedures = 7, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 61 [2022-07-12 19:27:40,820 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 19:27:40,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 19:27:40,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 19:27:40,822 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 19:27:40,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:27:40" (1/1) ... [2022-07-12 19:27:40,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:27:40" (1/1) ... [2022-07-12 19:27:40,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:27:40" (1/1) ... [2022-07-12 19:27:40,836 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:27:40" (1/1) ... [2022-07-12 19:27:40,840 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:27:40" (1/1) ... [2022-07-12 19:27:40,844 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:27:40" (1/1) ... [2022-07-12 19:27:40,848 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:27:40" (1/1) ... [2022-07-12 19:27:40,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 19:27:40,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 19:27:40,854 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 19:27:40,854 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 19:27:40,855 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:27:40" (1/1) ... [2022-07-12 19:27:40,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 19:27:40,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:27:40,877 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-12 19:27:40,923 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-12 19:27:40,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 19:27:40,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 19:27:40,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 19:27:40,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 19:27:40,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 19:27:40,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 19:27:41,020 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 19:27:41,021 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 19:27:41,240 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 19:27:41,244 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 19:27:41,245 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 19:27:41,246 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:27:41 BoogieIcfgContainer [2022-07-12 19:27:41,246 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 19:27:41,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 19:27:41,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 19:27:41,258 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 19:27:41,258 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 07:27:40" (1/3) ... [2022-07-12 19:27:41,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78961c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:27:41, skipping insertion in model container [2022-07-12 19:27:41,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 07:27:40" (2/3) ... [2022-07-12 19:27:41,259 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78961c42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 07:27:41, skipping insertion in model container [2022-07-12 19:27:41,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:27:41" (3/3) ... [2022-07-12 19:27:41,260 INFO L111 eAbstractionObserver]: Analyzing ICFG 4BitCounterPointer.c [2022-07-12 19:27:41,269 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 19:27:41,271 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2022-07-12 19:27:41,307 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 19:27:41,311 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@33a4ff4a, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2eebb3c6 [2022-07-12 19:27:41,312 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-07-12 19:27:41,314 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-12 19:27:41,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 19:27:41,318 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:41,318 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 19:27:41,319 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-12 19:27:41,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:41,322 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-12 19:27:41,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:41,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307460194] [2022-07-12 19:27:41,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:41,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:41,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:41,512 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-12 19:27:41,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:41,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307460194] [2022-07-12 19:27:41,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307460194] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:27:41,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:27:41,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:27:41,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425335238] [2022-07-12 19:27:41,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:27:41,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:27:41,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:41,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:27:41,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:27:41,541 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-12 19:27:41,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:41,606 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-07-12 19:27:41,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:27:41,609 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-12 19:27:41,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:41,614 INFO L225 Difference]: With dead ends: 52 [2022-07-12 19:27:41,614 INFO L226 Difference]: Without dead ends: 50 [2022-07-12 19:27:41,616 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-12 19:27:41,619 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 49 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12 19:27:41,620 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-12 19:27:41,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-12 19:27:41,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-07-12 19:27:41,638 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-12 19:27:41,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-07-12 19:27:41,640 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 3 [2022-07-12 19:27:41,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:41,640 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-07-12 19:27:41,640 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-12 19:27:41,641 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-07-12 19:27:41,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-12 19:27:41,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:41,641 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-12 19:27:41,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 19:27:41,642 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-12 19:27:41,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:41,642 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-12 19:27:41,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:41,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [937250046] [2022-07-12 19:27:41,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:41,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:41,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:41,699 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-12 19:27:41,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:41,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [937250046] [2022-07-12 19:27:41,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [937250046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:27:41,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:27:41,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:27:41,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663109353] [2022-07-12 19:27:41,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:27:41,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:27:41,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:41,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:27:41,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:27:41,703 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-12 19:27:41,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:41,731 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-07-12 19:27:41,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:27:41,732 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-12 19:27:41,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:41,732 INFO L225 Difference]: With dead ends: 46 [2022-07-12 19:27:41,733 INFO L226 Difference]: Without dead ends: 46 [2022-07-12 19:27:41,733 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-12 19:27:41,734 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-12 19:27:41,734 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-12 19:27:41,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-12 19:27:41,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-07-12 19:27:41,738 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-12 19:27:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-07-12 19:27:41,739 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 3 [2022-07-12 19:27:41,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:41,739 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-07-12 19:27:41,739 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-12 19:27:41,740 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-07-12 19:27:41,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-12 19:27:41,740 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:41,740 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-12 19:27:41,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 19:27:41,740 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-12 19:27:41,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:41,741 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2022-07-12 19:27:41,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:41,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538047917] [2022-07-12 19:27:41,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:41,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:41,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:41,768 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-12 19:27:41,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:41,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538047917] [2022-07-12 19:27:41,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538047917] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:27:41,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:27:41,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:27:41,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727757117] [2022-07-12 19:27:41,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:27:41,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:27:41,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:41,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:27:41,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:27:41,771 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-12 19:27:41,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:41,800 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-07-12 19:27:41,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:27:41,801 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-12 19:27:41,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:41,802 INFO L225 Difference]: With dead ends: 42 [2022-07-12 19:27:41,802 INFO L226 Difference]: Without dead ends: 42 [2022-07-12 19:27:41,802 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-12 19:27:41,803 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-12 19:27:41,803 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-12 19:27:41,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-12 19:27:41,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-07-12 19:27:41,806 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-12 19:27:41,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-07-12 19:27:41,807 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 4 [2022-07-12 19:27:41,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:41,807 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-07-12 19:27:41,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-12 19:27:41,807 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-07-12 19:27:41,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-12 19:27:41,808 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:41,808 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-12 19:27:41,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 19:27:41,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-12 19:27:41,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:41,809 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2022-07-12 19:27:41,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:41,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178850083] [2022-07-12 19:27:41,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:41,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:41,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:41,850 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-12 19:27:41,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:41,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178850083] [2022-07-12 19:27:41,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178850083] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:27:41,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:27:41,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:27:41,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545664004] [2022-07-12 19:27:41,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:27:41,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:27:41,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:41,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:27:41,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:27:41,852 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-12 19:27:41,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:41,876 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-07-12 19:27:41,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:27:41,877 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-12 19:27:41,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:41,877 INFO L225 Difference]: With dead ends: 38 [2022-07-12 19:27:41,877 INFO L226 Difference]: Without dead ends: 38 [2022-07-12 19:27:41,878 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-12 19:27:41,879 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-12 19:27:41,879 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-12 19:27:41,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-12 19:27:41,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-12 19:27:41,881 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-12 19:27:41,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-07-12 19:27:41,882 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 4 [2022-07-12 19:27:41,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:41,882 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-07-12 19:27:41,882 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-12 19:27:41,882 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-07-12 19:27:41,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 19:27:41,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:41,883 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 19:27:41,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 19:27:41,883 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-12 19:27:41,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:41,884 INFO L85 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times [2022-07-12 19:27:41,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:41,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678141581] [2022-07-12 19:27:41,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:41,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:41,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:41,930 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-12 19:27:41,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:41,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678141581] [2022-07-12 19:27:41,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678141581] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:27:41,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:27:41,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:27:41,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238513830] [2022-07-12 19:27:41,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:27:41,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:27:41,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:41,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:27:41,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:27:41,932 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-12 19:27:41,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:41,969 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-07-12 19:27:41,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:27:41,970 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-12 19:27:41,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:41,970 INFO L225 Difference]: With dead ends: 34 [2022-07-12 19:27:41,971 INFO L226 Difference]: Without dead ends: 34 [2022-07-12 19:27:41,971 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-12 19:27:41,972 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-12 19:27:41,972 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-12 19:27:41,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-12 19:27:41,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-12 19:27:41,975 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-12 19:27:41,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-07-12 19:27:41,975 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 5 [2022-07-12 19:27:41,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:41,976 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-07-12 19:27:41,976 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-12 19:27:41,976 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-07-12 19:27:41,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-12 19:27:41,976 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:41,976 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-12 19:27:41,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 19:27:41,977 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-12 19:27:41,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:41,977 INFO L85 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times [2022-07-12 19:27:41,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:41,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904205087] [2022-07-12 19:27:41,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:41,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:41,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:42,010 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-12 19:27:42,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:42,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904205087] [2022-07-12 19:27:42,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904205087] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:27:42,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:27:42,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:27:42,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789452865] [2022-07-12 19:27:42,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:27:42,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:27:42,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:42,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:27:42,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:27:42,013 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-12 19:27:42,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:42,033 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-07-12 19:27:42,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:27:42,033 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-12 19:27:42,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:42,034 INFO L225 Difference]: With dead ends: 30 [2022-07-12 19:27:42,034 INFO L226 Difference]: Without dead ends: 30 [2022-07-12 19:27:42,034 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-12 19:27:42,035 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-12 19:27:42,036 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-12 19:27:42,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-12 19:27:42,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-12 19:27:42,038 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-12 19:27:42,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-07-12 19:27:42,038 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 5 [2022-07-12 19:27:42,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:42,038 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-07-12 19:27:42,039 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-12 19:27:42,039 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-07-12 19:27:42,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 19:27:42,039 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:42,039 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 19:27:42,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 19:27:42,040 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-12 19:27:42,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:42,040 INFO L85 PathProgramCache]: Analyzing trace with hash 889446154, now seen corresponding path program 1 times [2022-07-12 19:27:42,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:42,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297028631] [2022-07-12 19:27:42,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:42,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:42,064 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-12 19:27:42,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:42,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297028631] [2022-07-12 19:27:42,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297028631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:27:42,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:27:42,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:27:42,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689139394] [2022-07-12 19:27:42,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:27:42,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:27:42,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:42,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:27:42,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:27:42,067 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-12 19:27:42,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:42,086 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-07-12 19:27:42,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:27:42,087 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-12 19:27:42,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:42,087 INFO L225 Difference]: With dead ends: 27 [2022-07-12 19:27:42,088 INFO L226 Difference]: Without dead ends: 27 [2022-07-12 19:27:42,088 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-12 19:27:42,089 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-12 19:27:42,089 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-12 19:27:42,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-12 19:27:42,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-12 19:27:42,091 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-12 19:27:42,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-07-12 19:27:42,092 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2022-07-12 19:27:42,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:42,092 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-07-12 19:27:42,092 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-12 19:27:42,092 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-07-12 19:27:42,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 19:27:42,093 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:42,093 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 19:27:42,093 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 19:27:42,093 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-12 19:27:42,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:42,094 INFO L85 PathProgramCache]: Analyzing trace with hash 889446155, now seen corresponding path program 1 times [2022-07-12 19:27:42,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:42,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608549340] [2022-07-12 19:27:42,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:42,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:42,129 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-12 19:27:42,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:42,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608549340] [2022-07-12 19:27:42,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608549340] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:27:42,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:27:42,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 19:27:42,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352843022] [2022-07-12 19:27:42,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:27:42,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 19:27:42,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:42,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 19:27:42,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 19:27:42,131 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-12 19:27:42,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:42,147 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-07-12 19:27:42,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 19:27:42,148 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-12 19:27:42,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:42,148 INFO L225 Difference]: With dead ends: 24 [2022-07-12 19:27:42,148 INFO L226 Difference]: Without dead ends: 24 [2022-07-12 19:27:42,149 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-12 19:27:42,149 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-12 19:27:42,150 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-12 19:27:42,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-12 19:27:42,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-12 19:27:42,152 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-12 19:27:42,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-07-12 19:27:42,152 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 6 [2022-07-12 19:27:42,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:42,152 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-07-12 19:27:42,153 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-12 19:27:42,153 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-07-12 19:27:42,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 19:27:42,153 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:42,153 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:27:42,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 19:27:42,154 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-12 19:27:42,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:42,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1115961648, now seen corresponding path program 1 times [2022-07-12 19:27:42,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:42,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374636739] [2022-07-12 19:27:42,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:42,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:42,187 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-12 19:27:42,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:42,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374636739] [2022-07-12 19:27:42,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374636739] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:27:42,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:27:42,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:27:42,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920043823] [2022-07-12 19:27:42,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:27:42,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:27:42,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:42,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:27:42,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:27:42,190 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-12 19:27:42,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:42,227 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-07-12 19:27:42,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:27:42,228 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-12 19:27:42,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:42,228 INFO L225 Difference]: With dead ends: 39 [2022-07-12 19:27:42,229 INFO L226 Difference]: Without dead ends: 39 [2022-07-12 19:27:42,229 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-12 19:27:42,230 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-12 19:27:42,230 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-12 19:27:42,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-12 19:27:42,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2022-07-12 19:27:42,233 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-12 19:27:42,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-07-12 19:27:42,233 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 10 [2022-07-12 19:27:42,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:42,234 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-07-12 19:27:42,234 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-12 19:27:42,234 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-07-12 19:27:42,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 19:27:42,235 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:42,235 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:27:42,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 19:27:42,235 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-12 19:27:42,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:42,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1456723757, now seen corresponding path program 1 times [2022-07-12 19:27:42,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:42,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674905327] [2022-07-12 19:27:42,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:42,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:42,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:42,303 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-12 19:27:42,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:42,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674905327] [2022-07-12 19:27:42,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674905327] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:27:42,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165810362] [2022-07-12 19:27:42,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:42,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:27:42,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:27:42,313 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-12 19:27:42,358 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-12 19:27:42,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:42,410 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 19:27:42,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:27:42,485 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-12 19:27:42,517 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-12 19:27:42,566 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-12 19:27:42,581 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-12 19:27:42,584 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-12 19:27:42,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:27:42,601 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-12 19:27:42,624 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:27:42,625 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-12 19:27:42,627 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-12 19:27:42,641 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-12 19:27:42,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165810362] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:27:42,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:27:42,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2022-07-12 19:27:42,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752183291] [2022-07-12 19:27:42,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:27:42,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 19:27:42,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:42,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 19:27:42,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2022-07-12 19:27:42,652 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-12 19:27:42,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:42,711 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-07-12 19:27:42,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 19:27:42,711 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-12 19:27:42,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:42,712 INFO L225 Difference]: With dead ends: 41 [2022-07-12 19:27:42,712 INFO L226 Difference]: Without dead ends: 41 [2022-07-12 19:27:42,712 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-12 19:27:42,713 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-12 19:27:42,713 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-12 19:27:42,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-12 19:27:42,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2022-07-12 19:27:42,716 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-12 19:27:42,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-07-12 19:27:42,716 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 15 [2022-07-12 19:27:42,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:42,717 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-07-12 19:27:42,717 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-12 19:27:42,717 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-07-12 19:27:42,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 19:27:42,717 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:42,718 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:27:42,735 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-12 19:27:42,935 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-12 19:27:42,935 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-12 19:27:42,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:42,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1715432197, now seen corresponding path program 1 times [2022-07-12 19:27:42,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:42,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057331951] [2022-07-12 19:27:42,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:42,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:43,356 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-12 19:27:43,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:43,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057331951] [2022-07-12 19:27:43,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057331951] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:27:43,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:27:43,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 19:27:43,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145351065] [2022-07-12 19:27:43,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:27:43,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 19:27:43,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:43,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 19:27:43,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 19:27:43,360 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-12 19:27:43,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:43,680 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-07-12 19:27:43,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 19:27:43,680 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-12 19:27:43,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:43,681 INFO L225 Difference]: With dead ends: 55 [2022-07-12 19:27:43,681 INFO L226 Difference]: Without dead ends: 55 [2022-07-12 19:27:43,681 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-12 19:27:43,681 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-12 19:27:43,681 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-12 19:27:43,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-12 19:27:43,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2022-07-12 19:27:43,683 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-12 19:27:43,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-07-12 19:27:43,684 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 18 [2022-07-12 19:27:43,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:43,684 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-07-12 19:27:43,684 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-12 19:27:43,684 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-07-12 19:27:43,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-12 19:27:43,685 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:43,685 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-12 19:27:43,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 19:27:43,685 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-12 19:27:43,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:43,685 INFO L85 PathProgramCache]: Analyzing trace with hash -2128935000, now seen corresponding path program 1 times [2022-07-12 19:27:43,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:43,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031976760] [2022-07-12 19:27:43,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:43,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:43,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:43,892 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-12 19:27:43,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:43,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031976760] [2022-07-12 19:27:43,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031976760] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:27:43,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144108609] [2022-07-12 19:27:43,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:43,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:27:43,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:27:43,908 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-12 19:27:43,909 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-12 19:27:43,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:43,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 19:27:43,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:27:43,998 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-12 19:27:44,046 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-12 19:27:44,187 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 19:27:44,187 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-12 19:27:44,216 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-12 19:27:44,230 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-12 19:27:44,231 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-12 19:27:44,231 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:27:44,237 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-12 19:27:44,244 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-12 19:27:44,286 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-12 19:27:44,290 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-12 19:27:44,292 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-12 19:27:44,354 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-12 19:27:44,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2144108609] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:27:44,354 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:27:44,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2022-07-12 19:27:44,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405830854] [2022-07-12 19:27:44,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:27:44,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-12 19:27:44,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:44,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-12 19:27:44,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=303, Unknown=2, NotChecked=74, Total=462 [2022-07-12 19:27:44,356 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-12 19:27:44,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:44,660 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-07-12 19:27:44,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 19:27:44,660 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-12 19:27:44,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:44,661 INFO L225 Difference]: With dead ends: 59 [2022-07-12 19:27:44,661 INFO L226 Difference]: Without dead ends: 59 [2022-07-12 19:27:44,661 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-12 19:27:44,662 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-12 19:27:44,662 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-12 19:27:44,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-12 19:27:44,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2022-07-12 19:27:44,664 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-12 19:27:44,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-07-12 19:27:44,665 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 23 [2022-07-12 19:27:44,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:44,665 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-07-12 19:27:44,665 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-12 19:27:44,665 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-07-12 19:27:44,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 19:27:44,665 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:44,665 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-12 19:27:44,686 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-12 19:27:44,866 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-12 19:27:44,866 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-12 19:27:44,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:44,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1038287010, now seen corresponding path program 1 times [2022-07-12 19:27:44,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:44,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805685198] [2022-07-12 19:27:44,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:44,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:44,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:45,248 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-12 19:27:45,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:45,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805685198] [2022-07-12 19:27:45,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805685198] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:27:45,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [913870475] [2022-07-12 19:27:45,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:45,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:27:45,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:27:45,250 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-12 19:27:45,256 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-12 19:27:45,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:45,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-12 19:27:45,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:27:45,331 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-12 19:27:45,380 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-12 19:27:45,445 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-12 19:27:45,446 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-12 19:27:45,551 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-12 19:27:45,551 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-12 19:27:45,588 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 19:27:45,589 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-12 19:27:45,626 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-12 19:27:45,642 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-12 19:27:45,643 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-12 19:27:45,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:27:45,657 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-12 19:27:45,673 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-12 19:27:45,685 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-12 19:27:45,826 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:27:45,827 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-12 19:27:45,834 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:27:45,836 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-12 19:27:45,844 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-12 19:27:45,854 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-12 19:27:45,939 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-12 19:27:46,098 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-12 19:27:46,123 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-12 19:27:46,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [913870475] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:27:46,123 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:27:46,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 29 [2022-07-12 19:27:46,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691239869] [2022-07-12 19:27:46,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:27:46,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-12 19:27:46,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:27:46,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-12 19:27:46,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=534, Unknown=3, NotChecked=150, Total=812 [2022-07-12 19:27:46,125 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-12 19:27:46,274 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-12 19:27:48,279 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-12 19:27:49,222 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-12 19:27:50,165 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-12 19:27:50,392 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-12 19:27:50,400 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-12 19:27:50,415 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-12 19:27:52,431 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-12 19:27:54,439 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-12 19:27:55,014 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-12 19:27:55,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:27:55,045 INFO L93 Difference]: Finished difference Result 137 states and 162 transitions. [2022-07-12 19:27:55,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-12 19:27:55,045 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-12 19:27:55,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:27:55,046 INFO L225 Difference]: With dead ends: 137 [2022-07-12 19:27:55,046 INFO L226 Difference]: Without dead ends: 137 [2022-07-12 19:27:55,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=273, Invalid=1026, Unknown=13, NotChecked=1040, Total=2352 [2022-07-12 19:27:55,047 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 105 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-12 19:27:55,047 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-12 19:27:55,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-12 19:27:55,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 77. [2022-07-12 19:27:55,051 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-12 19:27:55,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2022-07-12 19:27:55,052 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 26 [2022-07-12 19:27:55,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:27:55,052 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2022-07-12 19:27:55,052 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-12 19:27:55,052 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2022-07-12 19:27:55,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 19:27:55,052 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:27:55,052 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-12 19:27:55,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-12 19:27:55,253 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-12 19:27:55,253 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-12 19:27:55,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:27:55,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1790452235, now seen corresponding path program 1 times [2022-07-12 19:27:55,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:27:55,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597729456] [2022-07-12 19:27:55,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:55,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:27:55,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:55,431 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-12 19:27:55,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:27:55,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597729456] [2022-07-12 19:27:55,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597729456] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:27:55,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [573233945] [2022-07-12 19:27:55,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:27:55,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:27:55,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:27:55,448 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-12 19:27:55,449 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-12 19:27:55,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:27:55,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-12 19:27:55,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:27:55,546 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-12 19:27:55,578 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:27:55,578 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-12 19:27:55,583 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-12 19:27:55,659 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:27:55,660 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-12 19:27:55,667 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-12 19:27:55,837 INFO L356 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2022-07-12 19:27:55,837 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 31 treesize of output 49 [2022-07-12 19:27:55,920 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 19:27:55,920 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-12 19:27:55,941 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-12 19:27:55,943 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-12 19:27:55,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:27:57,155 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-12 19:27:57,973 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base|) |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)) is different from false [2022-07-12 19:28:00,138 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-12 19:28:00,164 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-12 19:28:00,176 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:28:00,177 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-12 19:28:00,185 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:28:00,185 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-12 19:28:00,211 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:28:00,212 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-12 19:28:00,304 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:28:00,304 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-12 19:28:00,499 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 148 treesize of output 140 [2022-07-12 19:28:00,608 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 663 treesize of output 651 [2022-07-12 19:28:00,820 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-12 19:28:00,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [573233945] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:28:00,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:28:00,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 24 [2022-07-12 19:28:00,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324573949] [2022-07-12 19:28:00,821 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:28:00,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 19:28:00,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:28:00,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 19:28:00,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=307, Unknown=4, NotChecked=156, Total=552 [2022-07-12 19:28:00,822 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-12 19:28:00,853 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-12 19:28:00,856 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-12 19:28:01,626 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~x2~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|))) (let ((.cse2 (or (= (select .cse6 |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) .cse3)) (.cse4 (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (.cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base|) |c_ULTIMATE.start_main_~x0~0#1.offset|) 0)) (.cse1 (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|))) (and (or (and (or (and (not (= |c_ULTIMATE.start_main_#t~malloc1#1.base| |c_ULTIMATE.start_main_#t~malloc0#1.base|)) .cse0) (not .cse1)) (or .cse1 (and .cse2 (or (and .cse0 (= |c_ULTIMATE.start_main_#t~malloc2#1.base| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (not .cse3))))) .cse4) (forall ((|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base|) |c_ULTIMATE.start_main_~x0~0#1.offset| 0)))) (store .cse5 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse5 |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)) .cse2 (= |c_ULTIMATE.start_main_~x2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x0~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (or (not .cse4) (and (= |c_ULTIMATE.start_main_#t~malloc2#1.base| |c_ULTIMATE.start_main_#t~malloc1#1.base|) .cse0)) (or (= (select .cse6 0) 0) (and .cse1 (exists ((|ULTIMATE.start_main_~x3~0#1.base| Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~x3~0#1.base|) 0) 0))))))) is different from false [2022-07-12 19:28:02,492 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_main_~x2~0#1.base|)) (.cse5 (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|))) (let ((.cse3 (or (= (select .cse6 |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) .cse5)) (.cse1 (= |c_ULTIMATE.start_main_#t~mem5#1| 0)) (.cse0 (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|))) (and (or (not .cse0) (and (= |c_ULTIMATE.start_main_#t~malloc2#1.base| |c_ULTIMATE.start_main_#t~malloc1#1.base|) .cse1)) (forall ((|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base|) |c_ULTIMATE.start_main_~x0~0#1.offset| 0)))) (store .cse2 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse2 |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)) .cse3 (= |c_ULTIMATE.start_main_~x2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x0~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (or (and (or .cse4 (and (or (and .cse1 (= |c_ULTIMATE.start_main_#t~malloc2#1.base| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) (not .cse5)) .cse3)) (or (and (not (= |c_ULTIMATE.start_main_#t~malloc1#1.base| |c_ULTIMATE.start_main_#t~malloc0#1.base|)) .cse1) (not .cse4))) .cse0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (or (= (select .cse6 0) 0) (and .cse4 (exists ((|ULTIMATE.start_main_~x3~0#1.base| Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~x3~0#1.base|) 0) 0))))))) is different from false [2022-07-12 19:28:04,495 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~x2~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_main_~x0~0#1.base| |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|)) (forall ((|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base|) |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)) (= |c_ULTIMATE.start_main_~x2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x0~0#1.offset| 0) (not .cse2) (= |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|)) (or (= (select .cse0 0) 0) (and .cse2 (exists ((|ULTIMATE.start_main_~x3~0#1.base| Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~x3~0#1.base|) 0) 0)))))) is different from false [2022-07-12 19:28:05,524 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-12 19:28:07,381 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base|) |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)) (= |c_ULTIMATE.start_main_~x2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x0~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x2~0#1.base|) 0) 0) (and (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|) (exists ((|ULTIMATE.start_main_~x3~0#1.base| Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~x3~0#1.base|) 0) 0))))) is different from false [2022-07-12 19:28:09,401 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-12 19:28:09,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:28:09,423 INFO L93 Difference]: Finished difference Result 93 states and 111 transitions. [2022-07-12 19:28:09,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 19:28:09,424 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-12 19:28:09,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:28:09,424 INFO L225 Difference]: With dead ends: 93 [2022-07-12 19:28:09,424 INFO L226 Difference]: Without dead ends: 93 [2022-07-12 19:28:09,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=141, Invalid=495, Unknown=12, NotChecked=684, Total=1332 [2022-07-12 19:28:09,425 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 7 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 19:28:09,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 90 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 97 Invalid, 0 Unknown, 129 Unchecked, 0.0s Time] [2022-07-12 19:28:09,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-12 19:28:09,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2022-07-12 19:28:09,430 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-12 19:28:09,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2022-07-12 19:28:09,431 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 27 [2022-07-12 19:28:09,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:28:09,431 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2022-07-12 19:28:09,431 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-12 19:28:09,432 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2022-07-12 19:28:09,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-12 19:28:09,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:28:09,432 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-12 19:28:09,453 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-12 19:28:09,643 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-12 19:28:09,643 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-12 19:28:09,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:28:09,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1453199205, now seen corresponding path program 2 times [2022-07-12 19:28:09,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:28:09,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568992109] [2022-07-12 19:28:09,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:28:09,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:28:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:28:09,825 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-12 19:28:09,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:28:09,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568992109] [2022-07-12 19:28:09,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568992109] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:28:09,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394610850] [2022-07-12 19:28:09,825 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:28:09,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:28:09,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:28:09,826 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-12 19:28:09,827 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-12 19:28:09,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 19:28:09,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:28:09,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-12 19:28:09,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:28:10,353 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-12 19:28:10,354 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 19:28:10,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394610850] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:28:10,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-12 19:28:10,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2022-07-12 19:28:10,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638226561] [2022-07-12 19:28:10,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:28:10,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:28:10,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:28:10,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:28:10,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-07-12 19:28:10,355 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-12 19:28:10,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:28:10,357 INFO L93 Difference]: Finished difference Result 118 states and 142 transitions. [2022-07-12 19:28:10,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:28:10,358 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-12 19:28:10,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:28:10,359 INFO L225 Difference]: With dead ends: 118 [2022-07-12 19:28:10,359 INFO L226 Difference]: Without dead ends: 116 [2022-07-12 19:28:10,360 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-12 19:28:10,361 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-12 19:28:10,362 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-12 19:28:10,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-12 19:28:10,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 74. [2022-07-12 19:28:10,371 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-12 19:28:10,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2022-07-12 19:28:10,375 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 31 [2022-07-12 19:28:10,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:28:10,375 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2022-07-12 19:28:10,375 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-12 19:28:10,375 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2022-07-12 19:28:10,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 19:28:10,376 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:28:10,376 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-12 19:28:10,394 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-12 19:28:10,591 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-12 19:28:10,591 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-12 19:28:10,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:28:10,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1610490675, now seen corresponding path program 1 times [2022-07-12 19:28:10,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:28:10,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490415570] [2022-07-12 19:28:10,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:28:10,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:28:10,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:28:10,714 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-12 19:28:10,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:28:10,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490415570] [2022-07-12 19:28:10,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490415570] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:28:10,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841166064] [2022-07-12 19:28:10,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:28:10,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:28:10,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:28:10,716 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-12 19:28:10,717 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-12 19:28:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:28:10,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-12 19:28:10,792 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:28:10,815 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-12 19:28:10,842 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:28:10,842 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-12 19:28:10,847 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-12 19:28:10,876 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:28:10,876 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-12 19:28:10,881 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-12 19:28:10,965 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 19:28:10,966 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-12 19:28:10,969 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-12 19:28:11,147 INFO L356 Elim1Store]: treesize reduction 36, result has 61.7 percent of original size [2022-07-12 19:28:11,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 83 [2022-07-12 19:28:11,366 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-12 19:28:11,366 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 26 treesize of output 25 [2022-07-12 19:28:11,424 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-12 19:28:11,458 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-12 19:28:11,474 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-12 19:28:11,486 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-12 19:28:11,486 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:28:11,513 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-12 19:28:11,523 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:28:11,523 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-12 19:28:11,529 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:28:11,529 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-12 19:28:11,532 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-12 19:28:11,744 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_652 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |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 |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_652) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))))) (and (or (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|) .cse0) (forall ((v_ArrVal_652 (Array Int Int))) (or (= (select (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_652) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) (or (= |c_ULTIMATE.start_main_~x2~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) .cse0))) is different from false [2022-07-12 19:28:11,817 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|ULTIMATE.start_main_~x3~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_652 (Array Int Int)) (v_ArrVal_651 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_main_~x3~0#1.base| v_ArrVal_651))) (or (not (= (select (select (store .cse1 |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)) (= (select (select (store .cse1 |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)))))) (and (or .cse0 (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (or .cse0 (= |c_ULTIMATE.start_main_~x2~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|)) (forall ((|ULTIMATE.start_main_~x3~0#1.base| Int) (v_ArrVal_652 (Array Int Int)) (v_ArrVal_651 (Array Int Int))) (or (= (select (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_main_~x3~0#1.base| v_ArrVal_651) |c_ULTIMATE.start_main_~x1~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-12 19:28:11,858 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~x2~0#1.base| Int)) (or (= |ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|) (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))) (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 (= (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))))))) (forall ((|ULTIMATE.start_main_~x3~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)) (or (= (select (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= (select (select (store (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) |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_652) |ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) (or (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 ((.cse1 (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 (= (select (select (store .cse1 |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 .cse1 |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))))) (= |c_ULTIMATE.start_main_~x2~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|))) is different from false [2022-07-12 19:28:11,870 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:28:11,871 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 45 [2022-07-12 19:28:11,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1092 treesize of output 1056 [2022-07-12 19:28:11,896 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:28:11,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1176 treesize of output 1118 [2022-07-12 19:28:11,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 930 treesize of output 914 [2022-07-12 19:28:11,942 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:28:11,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 934 treesize of output 908 [2022-07-12 19:28:12,255 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:28:12,256 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 45 [2022-07-12 19:28:12,258 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 19:28:12,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 80 [2022-07-12 19:28:12,265 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:28:12,265 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 79 treesize of output 81 [2022-07-12 19:28:12,272 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 19:28:12,272 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 47 treesize of output 51 [2022-07-12 19:28:12,306 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-12 19:28:12,328 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-07-12 19:28:12,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841166064] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 19:28:12,328 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 19:28:12,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 15] total 34 [2022-07-12 19:28:12,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667258493] [2022-07-12 19:28:12,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 19:28:12,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-12 19:28:12,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:28:12,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-12 19:28:12,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=756, Unknown=4, NotChecked=236, Total=1122 [2022-07-12 19:28:12,330 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-12 19:28:12,393 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (or (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (= (select .cse0 |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 .cse1 |c_ULTIMATE.start_main_~x0~0#1.offset|) 0) (= (select .cse1 0) 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) (forall ((|ULTIMATE.start_main_~x2~0#1.base| Int)) (or (= |ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|) (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))) (let ((.cse2 (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 (= (select (select (store .cse2 |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 .cse2 |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))))))) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~x3~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)) (or (= (select (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= (select (select (store (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) |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_652) |ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) (or (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 ((.cse3 (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 (= (select (select (store .cse3 |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 .cse3 |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))))) (= |c_ULTIMATE.start_main_~x2~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|)))) is different from false [2022-07-12 19:28:12,453 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0)) (.cse2 (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|))) (.cse0 (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~x2~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|)) (.cse1 (forall ((|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_652 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |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 |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_652) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))))) (and (or .cse0 .cse1) (forall ((v_ArrVal_652 (Array Int Int))) (or (= (select (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_652) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) .cse2 (not (= |c_ULTIMATE.start_main_#t~malloc1#1.base| |c_ULTIMATE.start_main_#t~malloc0#1.base|)) (or .cse3 .cse0) (= |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) (or .cse3 (and .cse2 .cse0 .cse4)) (or .cse4 .cse1))) is different from false [2022-07-12 19:28:12,456 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base|))) (let ((.cse2 (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (.cse3 (= (select .cse5 |c_ULTIMATE.start_main_~x1~0#1.offset|) 0)) (.cse1 (forall ((|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_652 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |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 |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_652) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))))) (and (or .cse0 .cse1) (forall ((v_ArrVal_652 (Array Int Int))) (or (= (select (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_652) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) (not .cse2) (not (= |c_ULTIMATE.start_main_#t~malloc1#1.base| |c_ULTIMATE.start_main_#t~malloc0#1.base|)) (or .cse3 (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|) .cse0) (= |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) (let ((.cse4 (exists ((|ULTIMATE.start_main_~x3~0#1.base| Int)) (= |c_ULTIMATE.start_main_#t~mem4#1| (select (select |c_#memory_int| |ULTIMATE.start_main_~x3~0#1.base|) 0))))) (or (and .cse4 .cse2) (= |c_ULTIMATE.start_main_#t~mem4#1| (select .cse5 0)) (and .cse4 .cse0) (and .cse3 .cse4))) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (or (= |c_ULTIMATE.start_main_~x2~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) .cse1)))) is different from false [2022-07-12 19:28:12,459 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (.cse1 (forall ((|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_652 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |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 |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_652) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))))) (and (or .cse0 .cse1) (forall ((v_ArrVal_652 (Array Int Int))) (or (= (select (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_652) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) (not .cse2) (not (= |c_ULTIMATE.start_main_#t~malloc1#1.base| |c_ULTIMATE.start_main_#t~malloc0#1.base|)) (or (= (select .cse3 |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|) .cse0) (let ((.cse4 (exists ((|ULTIMATE.start_main_~x3~0#1.base| Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~x3~0#1.base|) 0) 0)))) (or (and .cse4 .cse2) (= (select .cse3 0) 0) (and .cse0 .cse4))) (= |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) (or (= |c_ULTIMATE.start_main_~x2~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) .cse1))) is different from false [2022-07-12 19:28:12,463 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (.cse1 (forall ((|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_652 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |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 |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_652) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))))) (and (or .cse0 .cse1) (forall ((v_ArrVal_652 (Array Int Int))) (or (= (select (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_652) |c_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|)) (not (= |c_ULTIMATE.start_main_#t~malloc1#1.base| |c_ULTIMATE.start_main_#t~malloc0#1.base|)) (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|) .cse0) (= |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) (or (= |c_ULTIMATE.start_main_~x2~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) .cse1))) is different from false [2022-07-12 19:28:14,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:28:14,244 INFO L93 Difference]: Finished difference Result 344 states and 406 transitions. [2022-07-12 19:28:14,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2022-07-12 19:28:14,245 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-12 19:28:14,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:28:14,246 INFO L225 Difference]: With dead ends: 344 [2022-07-12 19:28:14,246 INFO L226 Difference]: Without dead ends: 344 [2022-07-12 19:28:14,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 49 SyntacticMatches, 12 SemanticMatches, 87 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 2198 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1097, Invalid=5243, Unknown=16, NotChecked=1476, Total=7832 [2022-07-12 19:28:14,248 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 341 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 1393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 617 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 19:28:14,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 392 Invalid, 1393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 588 Invalid, 0 Unknown, 617 Unchecked, 0.3s Time] [2022-07-12 19:28:14,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2022-07-12 19:28:14,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 190. [2022-07-12 19:28:14,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 189 states have (on average 1.2116402116402116) internal successors, (229), 189 states have internal predecessors, (229), 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-12 19:28:14,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 229 transitions. [2022-07-12 19:28:14,268 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 229 transitions. Word has length 34 [2022-07-12 19:28:14,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:28:14,269 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 229 transitions. [2022-07-12 19:28:14,269 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-12 19:28:14,269 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 229 transitions. [2022-07-12 19:28:14,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 19:28:14,274 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:28:14,274 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-12 19:28:14,301 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-12 19:28:14,475 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-12 19:28:14,475 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-12 19:28:14,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:28:14,476 INFO L85 PathProgramCache]: Analyzing trace with hash 932056085, now seen corresponding path program 2 times [2022-07-12 19:28:14,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:28:14,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143014402] [2022-07-12 19:28:14,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:28:14,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:28:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:28:14,521 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-12 19:28:14,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:28:14,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143014402] [2022-07-12 19:28:14,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143014402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 19:28:14,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 19:28:14,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 19:28:14,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301328206] [2022-07-12 19:28:14,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:28:14,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 19:28:14,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:28:14,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 19:28:14,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 19:28:14,522 INFO L87 Difference]: Start difference. First operand 190 states and 229 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-12 19:28:14,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:28:14,558 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2022-07-12 19:28:14,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:28:14,558 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-12 19:28:14,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:28:14,558 INFO L225 Difference]: With dead ends: 90 [2022-07-12 19:28:14,558 INFO L226 Difference]: Without dead ends: 90 [2022-07-12 19:28:14,558 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-12 19:28:14,559 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-12 19:28:14,559 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-12 19:28:14,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-12 19:28:14,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2022-07-12 19:28:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.1046511627906976) internal successors, (95), 86 states have internal predecessors, (95), 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-12 19:28:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2022-07-12 19:28:14,561 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 37 [2022-07-12 19:28:14,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:28:14,561 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2022-07-12 19:28:14,561 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-12 19:28:14,561 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-07-12 19:28:14,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-12 19:28:14,561 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 19:28:14,562 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-12 19:28:14,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 19:28:14,562 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-12 19:28:14,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 19:28:14,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1795695146, now seen corresponding path program 2 times [2022-07-12 19:28:14,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 19:28:14,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900144530] [2022-07-12 19:28:14,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 19:28:14,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 19:28:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 19:28:14,978 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-12 19:28:14,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 19:28:14,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900144530] [2022-07-12 19:28:14,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900144530] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 19:28:14,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [272223412] [2022-07-12 19:28:14,979 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 19:28:14,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 19:28:14,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 19:28:14,980 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-12 19:28:14,981 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-12 19:28:15,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-12 19:28:15,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 19:28:15,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 19:28:15,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 19:28:15,474 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-12 19:28:15,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 19:28:15,633 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-12 19:28:15,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [272223412] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-12 19:28:15,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-12 19:28:15,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [16, 4] total 22 [2022-07-12 19:28:15,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902536182] [2022-07-12 19:28:15,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 19:28:15,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 19:28:15,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 19:28:15,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 19:28:15,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-07-12 19:28:15,634 INFO L87 Difference]: Start difference. First operand 87 states and 95 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-12 19:28:15,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 19:28:15,665 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2022-07-12 19:28:15,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 19:28:15,665 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-12 19:28:15,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 19:28:15,665 INFO L225 Difference]: With dead ends: 86 [2022-07-12 19:28:15,665 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 19:28:15,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-07-12 19:28:15,666 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-12 19:28:15,666 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-12 19:28:15,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 19:28:15,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 19:28:15,666 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-12 19:28:15,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 19:28:15,667 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2022-07-12 19:28:15,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 19:28:15,667 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 19:28:15,667 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-12 19:28:15,667 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 19:28:15,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 19:28:15,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 31 remaining) [2022-07-12 19:28:15,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 31 remaining) [2022-07-12 19:28:15,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2022-07-12 19:28:15,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2022-07-12 19:28:15,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2022-07-12 19:28:15,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2022-07-12 19:28:15,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2022-07-12 19:28:15,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2022-07-12 19:28:15,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2022-07-12 19:28:15,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 31 remaining) [2022-07-12 19:28:15,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2022-07-12 19:28:15,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2022-07-12 19:28:15,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 31 remaining) [2022-07-12 19:28:15,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2022-07-12 19:28:15,670 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2022-07-12 19:28:15,670 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2022-07-12 19:28:15,670 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2022-07-12 19:28:15,670 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2022-07-12 19:28:15,670 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2022-07-12 19:28:15,670 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2022-07-12 19:28:15,670 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2022-07-12 19:28:15,670 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 31 remaining) [2022-07-12 19:28:15,670 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 31 remaining) [2022-07-12 19:28:15,670 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 31 remaining) [2022-07-12 19:28:15,670 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 31 remaining) [2022-07-12 19:28:15,671 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 31 remaining) [2022-07-12 19:28:15,671 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 31 remaining) [2022-07-12 19:28:15,671 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 31 remaining) [2022-07-12 19:28:15,671 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 31 remaining) [2022-07-12 19:28:15,671 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 31 remaining) [2022-07-12 19:28:15,671 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (0 of 31 remaining) [2022-07-12 19:28:15,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-12 19:28:15,871 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-12 19:28:15,874 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 19:28:15,876 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 19:28:15,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 07:28:15 BoogieIcfgContainer [2022-07-12 19:28:15,878 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 19:28:15,879 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 19:28:15,879 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 19:28:15,879 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 19:28:15,879 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 07:27:41" (3/4) ... [2022-07-12 19:28:15,881 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 19:28:15,903 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-12 19:28:15,904 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-12 19:28:15,904 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 19:28:15,904 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 19:28:15,962 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 19:28:15,963 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 19:28:15,963 INFO L158 Benchmark]: Toolchain (without parser) took 35308.30ms. Allocated memory was 109.1MB in the beginning and 192.9MB in the end (delta: 83.9MB). Free memory was 79.5MB in the beginning and 96.7MB in the end (delta: -17.3MB). Peak memory consumption was 65.2MB. Max. memory is 16.1GB. [2022-07-12 19:28:15,963 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 90.2MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:28:15,964 INFO L158 Benchmark]: CACSL2BoogieTranslator took 135.72ms. Allocated memory is still 109.1MB. Free memory was 79.5MB in the beginning and 86.2MB in the end (delta: -6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 19:28:15,964 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.36ms. Allocated memory is still 109.1MB. Free memory was 86.2MB in the beginning and 84.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 19:28:15,964 INFO L158 Benchmark]: Boogie Preprocessor took 31.27ms. Allocated memory is still 109.1MB. Free memory was 84.9MB in the beginning and 83.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 19:28:15,965 INFO L158 Benchmark]: RCFGBuilder took 400.75ms. Allocated memory is still 109.1MB. Free memory was 83.7MB in the beginning and 70.2MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-12 19:28:15,965 INFO L158 Benchmark]: TraceAbstraction took 34623.06ms. Allocated memory was 109.1MB in the beginning and 192.9MB in the end (delta: 83.9MB). Free memory was 69.5MB in the beginning and 99.6MB in the end (delta: -30.2MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. [2022-07-12 19:28:15,965 INFO L158 Benchmark]: Witness Printer took 84.05ms. Allocated memory is still 192.9MB. Free memory was 99.6MB in the beginning and 96.7MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 19:28:15,966 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 90.2MB. Free memory is still 49.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 135.72ms. Allocated memory is still 109.1MB. Free memory was 79.5MB in the beginning and 86.2MB in the end (delta: -6.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.36ms. Allocated memory is still 109.1MB. Free memory was 86.2MB in the beginning and 84.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.27ms. Allocated memory is still 109.1MB. Free memory was 84.9MB in the beginning and 83.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 400.75ms. Allocated memory is still 109.1MB. Free memory was 83.7MB in the beginning and 70.2MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 34623.06ms. Allocated memory was 109.1MB in the beginning and 192.9MB in the end (delta: 83.9MB). Free memory was 69.5MB in the beginning and 99.6MB in the end (delta: -30.2MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. * Witness Printer took 84.05ms. Allocated memory is still 192.9MB. Free memory was 99.6MB in the beginning and 96.7MB in the end (delta: 2.9MB). 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: 34.6s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 20.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1033 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1033 mSDsluCounter, 1246 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1295 IncrementalHoareTripleChecker+Unchecked, 949 mSDsCounter, 456 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1603 IncrementalHoareTripleChecker+Invalid, 3354 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 456 mSolverCounterUnsat, 297 mSDtfsCounter, 1603 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 601 GetRequests, 321 SyntacticMatches, 19 SemanticMatches, 261 ConstructedPredicates, 37 IntricatePredicates, 1 DeprecatedPredicates, 3088 ImplicationChecksByTransitivity, 25.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=190occurred in iteration=16, InterpolantAutomatonStates: 187, 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, 328 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 11.4s InterpolantComputationTime, 491 NumberOfCodeBlocks, 441 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 624 ConstructedInterpolants, 129 QuantifiedInterpolants, 12358 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-12 19:28:16,033 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