./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-sorted-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-sorted-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 06:06:57,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:06:57,372 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:06:57,412 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:06:57,412 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:06:57,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:06:57,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:06:57,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:06:57,420 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:06:57,421 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:06:57,422 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:06:57,423 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:06:57,423 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:06:57,424 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:06:57,425 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:06:57,426 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:06:57,427 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:06:57,428 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:06:57,429 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:06:57,431 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:06:57,432 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:06:57,433 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:06:57,434 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:06:57,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:06:57,435 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:06:57,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:06:57,438 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:06:57,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:06:57,439 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:06:57,440 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:06:57,441 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:06:57,441 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:06:57,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:06:57,442 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:06:57,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:06:57,444 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:06:57,444 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:06:57,445 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:06:57,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:06:57,446 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:06:57,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:06:57,447 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:06:57,448 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 06:06:57,466 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:06:57,467 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:06:57,467 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:06:57,467 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:06:57,468 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:06:57,468 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:06:57,469 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:06:57,469 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:06:57,469 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:06:57,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:06:57,469 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:06:57,470 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:06:57,470 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:06:57,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:06:57,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:06:57,471 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:06:57,471 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:06:57,471 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:06:57,471 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:06:57,471 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:06:57,471 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:06:57,472 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:06:57,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:06:57,472 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:06:57,472 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:06:57,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:06:57,473 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:06:57,473 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:06:57,473 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 06:06:57,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 06:06:57,474 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 97c87a4be2f33468a224d89594f96c367f5837bb79771cd5155d22e1299d7831 [2022-07-20 06:06:57,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:06:57,721 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:06:57,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:06:57,725 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:06:57,726 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:06:57,727 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-sorted-2.i [2022-07-20 06:06:57,796 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8cf6fb94/3d08854d2d934534bac49837d8145afd/FLAG13b33470a [2022-07-20 06:06:58,240 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:06:58,241 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i [2022-07-20 06:06:58,250 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8cf6fb94/3d08854d2d934534bac49837d8145afd/FLAG13b33470a [2022-07-20 06:06:58,264 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8cf6fb94/3d08854d2d934534bac49837d8145afd [2022-07-20 06:06:58,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:06:58,268 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:06:58,271 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:06:58,271 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:06:58,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:06:58,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:06:58" (1/1) ... [2022-07-20 06:06:58,278 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c21469f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:06:58, skipping insertion in model container [2022-07-20 06:06:58,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:06:58" (1/1) ... [2022-07-20 06:06:58,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:06:58,321 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:06:58,591 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22384,22397] [2022-07-20 06:06:58,597 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22614,22627] [2022-07-20 06:06:58,600 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22989,23002] [2022-07-20 06:06:58,601 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23053,23066] [2022-07-20 06:06:58,602 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23184,23197] [2022-07-20 06:06:58,603 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23248,23261] [2022-07-20 06:06:58,606 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:06:58,612 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:06:58,637 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22384,22397] [2022-07-20 06:06:58,639 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22614,22627] [2022-07-20 06:06:58,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[22989,23002] [2022-07-20 06:06:58,643 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23053,23066] [2022-07-20 06:06:58,644 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23184,23197] [2022-07-20 06:06:58,644 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-2.i[23248,23261] [2022-07-20 06:06:58,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:06:58,667 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:06:58,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:06:58 WrapperNode [2022-07-20 06:06:58,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:06:58,669 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:06:58,669 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:06:58,670 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:06:58,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:06:58" (1/1) ... [2022-07-20 06:06:58,696 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:06:58" (1/1) ... [2022-07-20 06:06:58,716 INFO L137 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 197 [2022-07-20 06:06:58,717 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:06:58,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:06:58,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:06:58,718 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:06:58,724 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:06:58" (1/1) ... [2022-07-20 06:06:58,725 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:06:58" (1/1) ... [2022-07-20 06:06:58,728 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:06:58" (1/1) ... [2022-07-20 06:06:58,728 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:06:58" (1/1) ... [2022-07-20 06:06:58,736 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:06:58" (1/1) ... [2022-07-20 06:06:58,741 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:06:58" (1/1) ... [2022-07-20 06:06:58,743 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:06:58" (1/1) ... [2022-07-20 06:06:58,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:06:58,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:06:58,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:06:58,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:06:58,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:06:58" (1/1) ... [2022-07-20 06:06:58,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:06:58,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:06:58,787 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-20 06:06:58,803 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-20 06:06:58,821 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 06:06:58,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 06:06:58,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 06:06:58,821 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 06:06:58,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 06:06:58,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 06:06:58,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 06:06:58,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 06:06:58,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:06:58,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:06:58,901 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:06:58,903 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:06:59,289 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:06:59,296 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:06:59,297 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2022-07-20 06:06:59,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:06:59 BoogieIcfgContainer [2022-07-20 06:06:59,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:06:59,301 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:06:59,301 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:06:59,304 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:06:59,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:06:58" (1/3) ... [2022-07-20 06:06:59,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b5dab99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:06:59, skipping insertion in model container [2022-07-20 06:06:59,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:06:58" (2/3) ... [2022-07-20 06:06:59,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b5dab99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:06:59, skipping insertion in model container [2022-07-20 06:06:59,306 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:06:59" (3/3) ... [2022-07-20 06:06:59,307 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-sorted-2.i [2022-07-20 06:06:59,320 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:06:59,320 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2022-07-20 06:06:59,359 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:06:59,365 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@cc0568e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@10c655e1 [2022-07-20 06:06:59,365 INFO L358 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-07-20 06:06:59,369 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 98 states have (on average 2.183673469387755) internal successors, (214), 178 states have internal predecessors, (214), 0 states have call successors, (0), 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-20 06:06:59,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:06:59,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:06:59,375 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:06:59,375 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-20 06:06:59,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:06:59,380 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-20 06:06:59,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:06:59,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822817736] [2022-07-20 06:06:59,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:06:59,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:06:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:06:59,534 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-20 06:06:59,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:06:59,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822817736] [2022-07-20 06:06:59,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1822817736] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:06:59,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:06:59,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:06:59,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103218110] [2022-07-20 06:06:59,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:06:59,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:06:59,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:06:59,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:06:59,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:06:59,577 INFO L87 Difference]: Start difference. First operand has 179 states, 98 states have (on average 2.183673469387755) internal successors, (214), 178 states have internal predecessors, (214), 0 states have call successors, (0), 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-20 06:06:59,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:06:59,743 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2022-07-20 06:06:59,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:06:59,748 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-20 06:06:59,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:06:59,756 INFO L225 Difference]: With dead ends: 182 [2022-07-20 06:06:59,757 INFO L226 Difference]: Without dead ends: 178 [2022-07-20 06:06:59,759 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-20 06:06:59,762 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 172 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:06:59,764 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 118 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:06:59,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-20 06:06:59,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2022-07-20 06:06:59,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 97 states have (on average 1.907216494845361) internal successors, (185), 173 states have internal predecessors, (185), 0 states have call successors, (0), 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-20 06:06:59,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 185 transitions. [2022-07-20 06:06:59,805 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 185 transitions. Word has length 3 [2022-07-20 06:06:59,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:06:59,805 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 185 transitions. [2022-07-20 06:06:59,806 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-20 06:06:59,806 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 185 transitions. [2022-07-20 06:06:59,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:06:59,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:06:59,806 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:06:59,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 06:06:59,807 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-20 06:06:59,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:06:59,808 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-20 06:06:59,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:06:59,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748235564] [2022-07-20 06:06:59,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:06:59,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:06:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:06:59,882 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-20 06:06:59,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:06:59,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748235564] [2022-07-20 06:06:59,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748235564] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:06:59,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:06:59,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:06:59,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406982205] [2022-07-20 06:06:59,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:06:59,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:06:59,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:06:59,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:06:59,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:06:59,889 INFO L87 Difference]: Start difference. First operand 174 states and 185 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-20 06:07:00,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:00,038 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2022-07-20 06:07:00,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:07:00,038 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-20 06:07:00,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:00,040 INFO L225 Difference]: With dead ends: 175 [2022-07-20 06:07:00,040 INFO L226 Difference]: Without dead ends: 175 [2022-07-20 06:07:00,041 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-20 06:07:00,042 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 167 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:00,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 116 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:00,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-20 06:07:00,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2022-07-20 06:07:00,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 97 states have (on average 1.8762886597938144) internal successors, (182), 170 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:00,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 182 transitions. [2022-07-20 06:07:00,052 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 182 transitions. Word has length 3 [2022-07-20 06:07:00,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:00,053 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 182 transitions. [2022-07-20 06:07:00,053 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-20 06:07:00,053 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 182 transitions. [2022-07-20 06:07:00,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-20 06:07:00,054 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:00,054 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:00,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 06:07:00,054 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-20 06:07:00,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:00,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2022-07-20 06:07:00,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:00,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538908963] [2022-07-20 06:07:00,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:00,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:00,125 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-20 06:07:00,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:00,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538908963] [2022-07-20 06:07:00,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538908963] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:00,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:00,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:07:00,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827034370] [2022-07-20 06:07:00,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:00,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:07:00,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:00,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:07:00,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:07:00,131 INFO L87 Difference]: Start difference. First operand 171 states and 182 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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-20 06:07:00,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:00,337 INFO L93 Difference]: Finished difference Result 178 states and 192 transitions. [2022-07-20 06:07:00,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:07:00,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-07-20 06:07:00,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:00,342 INFO L225 Difference]: With dead ends: 178 [2022-07-20 06:07:00,343 INFO L226 Difference]: Without dead ends: 178 [2022-07-20 06:07:00,344 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-20 06:07:00,347 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 294 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:00,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 89 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:07:00,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-20 06:07:00,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 167. [2022-07-20 06:07:00,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 111 states have (on average 1.7027027027027026) internal successors, (189), 166 states have internal predecessors, (189), 0 states have call successors, (0), 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-20 06:07:00,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 189 transitions. [2022-07-20 06:07:00,371 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 189 transitions. Word has length 9 [2022-07-20 06:07:00,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:00,371 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 189 transitions. [2022-07-20 06:07:00,372 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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-20 06:07:00,372 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 189 transitions. [2022-07-20 06:07:00,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-20 06:07:00,373 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:00,373 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:00,373 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 06:07:00,373 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-20 06:07:00,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:00,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2022-07-20 06:07:00,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:00,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811003646] [2022-07-20 06:07:00,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:00,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:00,495 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-20 06:07:00,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:00,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811003646] [2022-07-20 06:07:00,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811003646] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:00,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:00,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:07:00,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870459272] [2022-07-20 06:07:00,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:00,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:07:00,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:00,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:07:00,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:07:00,498 INFO L87 Difference]: Start difference. First operand 167 states and 189 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 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-20 06:07:00,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:00,755 INFO L93 Difference]: Finished difference Result 258 states and 282 transitions. [2022-07-20 06:07:00,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:07:00,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-07-20 06:07:00,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:00,757 INFO L225 Difference]: With dead ends: 258 [2022-07-20 06:07:00,757 INFO L226 Difference]: Without dead ends: 258 [2022-07-20 06:07:00,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:07:00,758 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 437 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:00,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 130 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:07:00,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-20 06:07:00,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 220. [2022-07-20 06:07:00,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 164 states have (on average 1.6097560975609757) internal successors, (264), 219 states have internal predecessors, (264), 0 states have call successors, (0), 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-20 06:07:00,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 264 transitions. [2022-07-20 06:07:00,780 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 264 transitions. Word has length 9 [2022-07-20 06:07:00,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:00,780 INFO L495 AbstractCegarLoop]: Abstraction has 220 states and 264 transitions. [2022-07-20 06:07:00,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 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-20 06:07:00,781 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 264 transitions. [2022-07-20 06:07:00,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 06:07:00,781 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:00,781 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:00,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 06:07:00,782 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-20 06:07:00,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:00,783 INFO L85 PathProgramCache]: Analyzing trace with hash 233093812, now seen corresponding path program 1 times [2022-07-20 06:07:00,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:00,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041855109] [2022-07-20 06:07:00,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:00,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:00,849 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-20 06:07:00,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:00,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041855109] [2022-07-20 06:07:00,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041855109] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:00,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:00,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:07:00,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138655884] [2022-07-20 06:07:00,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:00,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:07:00,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:00,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:07:00,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:00,852 INFO L87 Difference]: Start difference. First operand 220 states and 264 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:00,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:00,881 INFO L93 Difference]: Finished difference Result 266 states and 313 transitions. [2022-07-20 06:07:00,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:07:00,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-20 06:07:00,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:00,886 INFO L225 Difference]: With dead ends: 266 [2022-07-20 06:07:00,886 INFO L226 Difference]: Without dead ends: 266 [2022-07-20 06:07:00,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:07:00,888 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 120 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:00,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 235 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:07:00,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-07-20 06:07:00,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 233. [2022-07-20 06:07:00,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 177 states have (on average 1.6045197740112995) internal successors, (284), 232 states have internal predecessors, (284), 0 states have call successors, (0), 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-20 06:07:00,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 284 transitions. [2022-07-20 06:07:00,906 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 284 transitions. Word has length 11 [2022-07-20 06:07:00,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:00,907 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 284 transitions. [2022-07-20 06:07:00,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:00,907 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 284 transitions. [2022-07-20 06:07:00,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 06:07:00,908 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:00,908 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:00,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 06:07:00,908 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-20 06:07:00,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:00,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2022-07-20 06:07:00,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:00,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924727240] [2022-07-20 06:07:00,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:00,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:00,991 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-20 06:07:00,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:00,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924727240] [2022-07-20 06:07:00,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924727240] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:00,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:00,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:07:00,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245625768] [2022-07-20 06:07:00,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:00,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:07:00,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:00,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:07:00,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:07:00,993 INFO L87 Difference]: Start difference. First operand 233 states and 284 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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-20 06:07:01,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:01,182 INFO L93 Difference]: Finished difference Result 232 states and 281 transitions. [2022-07-20 06:07:01,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:07:01,182 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-07-20 06:07:01,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:01,183 INFO L225 Difference]: With dead ends: 232 [2022-07-20 06:07:01,183 INFO L226 Difference]: Without dead ends: 232 [2022-07-20 06:07:01,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:07:01,184 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 6 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:01,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 406 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:07:01,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-20 06:07:01,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2022-07-20 06:07:01,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 177 states have (on average 1.5875706214689265) internal successors, (281), 231 states have internal predecessors, (281), 0 states have call successors, (0), 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-20 06:07:01,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 281 transitions. [2022-07-20 06:07:01,191 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 281 transitions. Word has length 12 [2022-07-20 06:07:01,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:01,191 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 281 transitions. [2022-07-20 06:07:01,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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-20 06:07:01,192 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 281 transitions. [2022-07-20 06:07:01,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 06:07:01,192 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:01,192 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:01,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 06:07:01,193 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-20 06:07:01,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:01,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2022-07-20 06:07:01,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:01,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353846264] [2022-07-20 06:07:01,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:01,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:01,236 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-20 06:07:01,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:01,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353846264] [2022-07-20 06:07:01,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353846264] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:01,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:01,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:07:01,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362742039] [2022-07-20 06:07:01,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:01,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:07:01,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:01,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:07:01,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:07:01,239 INFO L87 Difference]: Start difference. First operand 232 states and 281 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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-20 06:07:01,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:01,390 INFO L93 Difference]: Finished difference Result 231 states and 278 transitions. [2022-07-20 06:07:01,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:07:01,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-07-20 06:07:01,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:01,392 INFO L225 Difference]: With dead ends: 231 [2022-07-20 06:07:01,392 INFO L226 Difference]: Without dead ends: 231 [2022-07-20 06:07:01,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:07:01,393 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 7 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:01,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 426 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:01,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-07-20 06:07:01,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2022-07-20 06:07:01,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 177 states have (on average 1.5706214689265536) internal successors, (278), 230 states have internal predecessors, (278), 0 states have call successors, (0), 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-20 06:07:01,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 278 transitions. [2022-07-20 06:07:01,398 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 278 transitions. Word has length 12 [2022-07-20 06:07:01,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:01,399 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 278 transitions. [2022-07-20 06:07:01,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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-20 06:07:01,399 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 278 transitions. [2022-07-20 06:07:01,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 06:07:01,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:01,400 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:01,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 06:07:01,401 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-20 06:07:01,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:01,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2022-07-20 06:07:01,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:01,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847759575] [2022-07-20 06:07:01,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:01,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:01,514 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-20 06:07:01,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:01,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847759575] [2022-07-20 06:07:01,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847759575] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:01,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:01,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:07:01,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425927533] [2022-07-20 06:07:01,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:01,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:07:01,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:01,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:07:01,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:07:01,517 INFO L87 Difference]: Start difference. First operand 231 states and 278 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 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-20 06:07:01,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:01,812 INFO L93 Difference]: Finished difference Result 237 states and 279 transitions. [2022-07-20 06:07:01,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:07:01,816 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-07-20 06:07:01,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:01,817 INFO L225 Difference]: With dead ends: 237 [2022-07-20 06:07:01,817 INFO L226 Difference]: Without dead ends: 237 [2022-07-20 06:07:01,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-07-20 06:07:01,818 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 291 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:01,818 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 289 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:07:01,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-07-20 06:07:01,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 230. [2022-07-20 06:07:01,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 177 states have (on average 1.5593220338983051) internal successors, (276), 229 states have internal predecessors, (276), 0 states have call successors, (0), 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-20 06:07:01,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 276 transitions. [2022-07-20 06:07:01,823 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 276 transitions. Word has length 16 [2022-07-20 06:07:01,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:01,823 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 276 transitions. [2022-07-20 06:07:01,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 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-20 06:07:01,823 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 276 transitions. [2022-07-20 06:07:01,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 06:07:01,823 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:01,824 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:01,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 06:07:01,824 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-20 06:07:01,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:01,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2022-07-20 06:07:01,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:01,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058664885] [2022-07-20 06:07:01,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:01,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:01,988 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-20 06:07:01,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:01,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058664885] [2022-07-20 06:07:01,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058664885] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:01,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:01,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 06:07:01,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957839699] [2022-07-20 06:07:01,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:01,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:07:01,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:01,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:07:01,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:07:01,991 INFO L87 Difference]: Start difference. First operand 230 states and 276 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 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-20 06:07:02,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:02,530 INFO L93 Difference]: Finished difference Result 232 states and 270 transitions. [2022-07-20 06:07:02,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 06:07:02,531 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-07-20 06:07:02,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:02,532 INFO L225 Difference]: With dead ends: 232 [2022-07-20 06:07:02,532 INFO L226 Difference]: Without dead ends: 232 [2022-07-20 06:07:02,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-07-20 06:07:02,533 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 288 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:02,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 388 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:07:02,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-07-20 06:07:02,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 216. [2022-07-20 06:07:02,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 169 states have (on average 1.5266272189349113) internal successors, (258), 215 states have internal predecessors, (258), 0 states have call successors, (0), 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-20 06:07:02,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 258 transitions. [2022-07-20 06:07:02,537 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 258 transitions. Word has length 16 [2022-07-20 06:07:02,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:02,538 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 258 transitions. [2022-07-20 06:07:02,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 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-20 06:07:02,538 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 258 transitions. [2022-07-20 06:07:02,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 06:07:02,538 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:02,538 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:02,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 06:07:02,539 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-20 06:07:02,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:02,539 INFO L85 PathProgramCache]: Analyzing trace with hash -961820477, now seen corresponding path program 1 times [2022-07-20 06:07:02,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:02,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254852594] [2022-07-20 06:07:02,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:02,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:02,582 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 06:07:02,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:02,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254852594] [2022-07-20 06:07:02,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254852594] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:02,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:02,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:07:02,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197618855] [2022-07-20 06:07:02,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:02,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:07:02,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:02,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:07:02,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:07:02,585 INFO L87 Difference]: Start difference. First operand 216 states and 258 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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-20 06:07:02,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:02,690 INFO L93 Difference]: Finished difference Result 253 states and 276 transitions. [2022-07-20 06:07:02,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:07:02,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-20 06:07:02,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:02,692 INFO L225 Difference]: With dead ends: 253 [2022-07-20 06:07:02,692 INFO L226 Difference]: Without dead ends: 253 [2022-07-20 06:07:02,692 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-20 06:07:02,692 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 295 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:02,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 202 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:07:02,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-07-20 06:07:02,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 214. [2022-07-20 06:07:02,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 168 states have (on average 1.5119047619047619) internal successors, (254), 213 states have internal predecessors, (254), 0 states have call successors, (0), 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-20 06:07:02,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 254 transitions. [2022-07-20 06:07:02,698 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 254 transitions. Word has length 25 [2022-07-20 06:07:02,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:02,698 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 254 transitions. [2022-07-20 06:07:02,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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-20 06:07:02,698 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 254 transitions. [2022-07-20 06:07:02,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 06:07:02,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:02,699 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:02,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 06:07:02,700 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-20 06:07:02,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:02,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1496912174, now seen corresponding path program 1 times [2022-07-20 06:07:02,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:02,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47680623] [2022-07-20 06:07:02,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:02,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:02,905 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-20 06:07:02,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:02,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47680623] [2022-07-20 06:07:02,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47680623] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:07:02,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1172267197] [2022-07-20 06:07:02,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:02,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:02,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:02,911 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-20 06:07:02,915 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-20 06:07:03,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:03,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-20 06:07:03,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:07:03,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:07:03,149 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:07:03,150 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 11 treesize of output 11 [2022-07-20 06:07:03,212 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-20 06:07:03,312 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:03,313 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-20 06:07:03,410 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:03,411 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 22 treesize of output 22 [2022-07-20 06:07:03,475 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:03,475 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-20 06:07:03,623 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:03,625 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:03,625 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 25 treesize of output 16 [2022-07-20 06:07:03,633 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-20 06:07:03,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:07:03,849 INFO L356 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-07-20 06:07:03,849 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 19 treesize of output 18 [2022-07-20 06:07:03,858 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0))) is different from false [2022-07-20 06:07:03,869 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0) (= |c_ULTIMATE.start_main_#t~mem5#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)))) is different from false [2022-07-20 06:07:03,881 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0))) is different from false [2022-07-20 06:07:03,902 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_334 (Array Int Int))) (or (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_334))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) .cse1))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0))) is different from false [2022-07-20 06:07:03,914 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_334 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_334))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)))))) is different from false [2022-07-20 06:07:03,945 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:03,945 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 51 treesize of output 36 [2022-07-20 06:07:03,955 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:03,955 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 170 treesize of output 137 [2022-07-20 06:07:03,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 114 [2022-07-20 06:07:03,974 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:03,974 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 114 treesize of output 102 [2022-07-20 06:07:04,366 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-20 06:07:04,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1172267197] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:07:04,366 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:07:04,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 34 [2022-07-20 06:07:04,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100546944] [2022-07-20 06:07:04,366 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:07:04,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-20 06:07:04,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:07:04,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-20 06:07:04,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=782, Unknown=6, NotChecked=300, Total=1190 [2022-07-20 06:07:04,368 INFO L87 Difference]: Start difference. First operand 214 states and 254 transitions. Second operand has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:05,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:07:05,984 INFO L93 Difference]: Finished difference Result 505 states and 581 transitions. [2022-07-20 06:07:05,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-20 06:07:05,984 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-20 06:07:05,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:07:05,986 INFO L225 Difference]: With dead ends: 505 [2022-07-20 06:07:05,986 INFO L226 Difference]: Without dead ends: 505 [2022-07-20 06:07:05,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 44 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=354, Invalid=1730, Unknown=6, NotChecked=460, Total=2550 [2022-07-20 06:07:05,988 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 773 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 1611 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 3581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1883 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-20 06:07:05,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 1654 Invalid, 3581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1611 Invalid, 0 Unknown, 1883 Unchecked, 0.9s Time] [2022-07-20 06:07:05,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-07-20 06:07:05,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 239. [2022-07-20 06:07:05,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 193 states have (on average 1.471502590673575) internal successors, (284), 238 states have internal predecessors, (284), 0 states have call successors, (0), 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-20 06:07:05,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 284 transitions. [2022-07-20 06:07:05,995 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 284 transitions. Word has length 31 [2022-07-20 06:07:05,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:07:05,995 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 284 transitions. [2022-07-20 06:07:05,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:07:05,996 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 284 transitions. [2022-07-20 06:07:05,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 06:07:05,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:05,997 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:07:06,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 06:07:06,212 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,SelfDestructingSolverStorable10 [2022-07-20 06:07:06,212 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-20 06:07:06,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:06,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1496912173, now seen corresponding path program 1 times [2022-07-20 06:07:06,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:06,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915629245] [2022-07-20 06:07:06,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:06,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:06,481 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-20 06:07:06,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:06,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915629245] [2022-07-20 06:07:06,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915629245] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:07:06,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056676883] [2022-07-20 06:07:06,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:06,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:07:06,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:06,483 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-20 06:07:06,492 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-20 06:07:06,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:06,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-20 06:07:06,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:07:06,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:07:06,663 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:07:06,664 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 11 treesize of output 11 [2022-07-20 06:07:06,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:07:06,703 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-20 06:07:06,712 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-20 06:07:06,823 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:06,824 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-20 06:07:06,829 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 18 treesize of output 20 [2022-07-20 06:07:06,920 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:06,921 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 31 treesize of output 29 [2022-07-20 06:07:06,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:07:06,933 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-20 06:07:06,988 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:07:06,988 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-20 06:07:06,992 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 18 treesize of output 20 [2022-07-20 06:07:07,145 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:07,146 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:07:07,150 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:07:07,153 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:07,153 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 25 treesize of output 16 [2022-07-20 06:07:07,181 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-20 06:07:07,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:07:07,446 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_439 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int) (v_ArrVal_440 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_75| 0) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|))) (and (<= 0 (+ .cse0 8)) (<= (+ .cse0 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_440) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-20 06:07:07,873 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (v_ArrVal_435 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (or (and (forall ((v_ArrVal_439 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_436) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|) 8))) (forall ((v_ArrVal_439 (Array Int Int)) (v_ArrVal_440 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_435))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_436) .cse0 v_ArrVal_439) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_440) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|))))))) (< |v_ULTIMATE.start_main_~x~0#1.offset_75| 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-20 06:07:08,048 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:08,049 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 73 treesize of output 74 [2022-07-20 06:07:08,054 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:08,054 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 65 treesize of output 50 [2022-07-20 06:07:08,067 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:08,067 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 632 treesize of output 567 [2022-07-20 06:07:08,090 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:08,090 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 1872 treesize of output 1783 [2022-07-20 06:07:08,118 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 1768 treesize of output 1688 [2022-07-20 06:07:08,143 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 1688 treesize of output 1656 [2022-07-20 06:07:08,157 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 1656 treesize of output 1576 [2022-07-20 06:07:08,181 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:07:08,181 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 1576 treesize of output 1436 [2022-07-20 06:08:44,394 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:44,395 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 38 treesize of output 39 [2022-07-20 06:08:44,405 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:44,405 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 30 treesize of output 31 [2022-07-20 06:08:44,407 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:44,410 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 28 treesize of output 20 [2022-07-20 06:08:44,413 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:44,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2022-07-20 06:08:44,631 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-20 06:08:44,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056676883] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:44,632 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:08:44,632 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 14] total 36 [2022-07-20 06:08:44,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109571596] [2022-07-20 06:08:44,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:44,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-20 06:08:44,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:44,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-20 06:08:44,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1058, Unknown=13, NotChecked=134, Total=1332 [2022-07-20 06:08:44,634 INFO L87 Difference]: Start difference. First operand 239 states and 284 transitions. Second operand has 37 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 37 states have internal predecessors, (91), 0 states have call successors, (0), 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-20 06:08:46,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:46,519 INFO L93 Difference]: Finished difference Result 418 states and 475 transitions. [2022-07-20 06:08:46,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-20 06:08:46,520 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 37 states have internal predecessors, (91), 0 states have call successors, (0), 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-20 06:08:46,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:46,521 INFO L225 Difference]: With dead ends: 418 [2022-07-20 06:08:46,521 INFO L226 Difference]: Without dead ends: 418 [2022-07-20 06:08:46,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 42 SyntacticMatches, 8 SemanticMatches, 58 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 775 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=542, Invalid=2759, Unknown=13, NotChecked=226, Total=3540 [2022-07-20 06:08:46,523 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 1325 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 2718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1342 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:46,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1325 Valid, 1261 Invalid, 2718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 1270 Invalid, 0 Unknown, 1342 Unchecked, 0.7s Time] [2022-07-20 06:08:46,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-07-20 06:08:46,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 239. [2022-07-20 06:08:46,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 193 states have (on average 1.4663212435233162) internal successors, (283), 238 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:46,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 283 transitions. [2022-07-20 06:08:46,530 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 283 transitions. Word has length 31 [2022-07-20 06:08:46,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:46,530 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 283 transitions. [2022-07-20 06:08:46,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.5277777777777777) internal successors, (91), 37 states have internal predecessors, (91), 0 states have call successors, (0), 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-20 06:08:46,531 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 283 transitions. [2022-07-20 06:08:46,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 06:08:46,531 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:46,532 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:46,558 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-20 06:08:46,747 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-20 06:08:46,748 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-20 06:08:46,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:46,749 INFO L85 PathProgramCache]: Analyzing trace with hash 290187840, now seen corresponding path program 1 times [2022-07-20 06:08:46,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:46,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798803724] [2022-07-20 06:08:46,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:46,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:46,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 06:08:46,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:46,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798803724] [2022-07-20 06:08:46,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798803724] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:46,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:46,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:08:46,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093117938] [2022-07-20 06:08:46,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:46,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:08:46,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:46,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:08:46,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:08:46,804 INFO L87 Difference]: Start difference. First operand 239 states and 283 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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-20 06:08:46,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:46,813 INFO L93 Difference]: Finished difference Result 241 states and 285 transitions. [2022-07-20 06:08:46,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:08:46,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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 33 [2022-07-20 06:08:46,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:46,815 INFO L225 Difference]: With dead ends: 241 [2022-07-20 06:08:46,815 INFO L226 Difference]: Without dead ends: 241 [2022-07-20 06:08:46,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:08:46,816 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:46,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 298 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:08:46,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-07-20 06:08:46,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-07-20 06:08:46,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 195 states have (on average 1.4615384615384615) internal successors, (285), 240 states have internal predecessors, (285), 0 states have call successors, (0), 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-20 06:08:46,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 285 transitions. [2022-07-20 06:08:46,822 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 285 transitions. Word has length 33 [2022-07-20 06:08:46,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:46,823 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 285 transitions. [2022-07-20 06:08:46,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 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-20 06:08:46,823 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 285 transitions. [2022-07-20 06:08:46,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 06:08:46,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:46,825 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:46,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 06:08:46,826 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-20 06:08:46,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:46,826 INFO L85 PathProgramCache]: Analyzing trace with hash 2033494590, now seen corresponding path program 1 times [2022-07-20 06:08:46,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:46,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280902915] [2022-07-20 06:08:46,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:46,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:46,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:46,914 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 06:08:46,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:46,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280902915] [2022-07-20 06:08:46,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [280902915] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:46,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:46,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:08:46,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807876253] [2022-07-20 06:08:46,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:46,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:08:46,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:46,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:08:46,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:08:46,918 INFO L87 Difference]: Start difference. First operand 241 states and 285 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:47,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:47,128 INFO L93 Difference]: Finished difference Result 258 states and 304 transitions. [2022-07-20 06:08:47,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:08:47,128 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-20 06:08:47,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:47,129 INFO L225 Difference]: With dead ends: 258 [2022-07-20 06:08:47,130 INFO L226 Difference]: Without dead ends: 258 [2022-07-20 06:08:47,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:08:47,130 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 34 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:47,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 619 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:08:47,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-07-20 06:08:47,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 249. [2022-07-20 06:08:47,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 203 states have (on average 1.4482758620689655) internal successors, (294), 248 states have internal predecessors, (294), 0 states have call successors, (0), 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-20 06:08:47,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 294 transitions. [2022-07-20 06:08:47,135 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 294 transitions. Word has length 36 [2022-07-20 06:08:47,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:47,136 INFO L495 AbstractCegarLoop]: Abstraction has 249 states and 294 transitions. [2022-07-20 06:08:47,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:47,136 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 294 transitions. [2022-07-20 06:08:47,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 06:08:47,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:47,136 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:47,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 06:08:47,137 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-20 06:08:47,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:47,137 INFO L85 PathProgramCache]: Analyzing trace with hash 2033554172, now seen corresponding path program 1 times [2022-07-20 06:08:47,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:47,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898493909] [2022-07-20 06:08:47,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:47,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:47,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:47,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 06:08:47,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:47,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898493909] [2022-07-20 06:08:47,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898493909] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:47,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:47,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:08:47,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005647108] [2022-07-20 06:08:47,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:47,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:08:47,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:47,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:08:47,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:08:47,188 INFO L87 Difference]: Start difference. First operand 249 states and 294 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:47,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:47,241 INFO L93 Difference]: Finished difference Result 246 states and 286 transitions. [2022-07-20 06:08:47,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:08:47,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-20 06:08:47,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:47,243 INFO L225 Difference]: With dead ends: 246 [2022-07-20 06:08:47,243 INFO L226 Difference]: Without dead ends: 246 [2022-07-20 06:08:47,243 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-20 06:08:47,244 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 78 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:47,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 170 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:08:47,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-07-20 06:08:47,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2022-07-20 06:08:47,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 203 states have (on average 1.4088669950738917) internal successors, (286), 244 states have internal predecessors, (286), 0 states have call successors, (0), 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-20 06:08:47,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 286 transitions. [2022-07-20 06:08:47,249 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 286 transitions. Word has length 36 [2022-07-20 06:08:47,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:47,250 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 286 transitions. [2022-07-20 06:08:47,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:47,250 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 286 transitions. [2022-07-20 06:08:47,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 06:08:47,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:47,251 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:47,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 06:08:47,251 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-20 06:08:47,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:47,252 INFO L85 PathProgramCache]: Analyzing trace with hash 2033554173, now seen corresponding path program 1 times [2022-07-20 06:08:47,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:47,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910857193] [2022-07-20 06:08:47,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:47,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:47,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:47,305 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 06:08:47,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:47,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910857193] [2022-07-20 06:08:47,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910857193] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:47,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:47,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:08:47,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671409367] [2022-07-20 06:08:47,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:47,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:08:47,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:47,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:08:47,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:08:47,308 INFO L87 Difference]: Start difference. First operand 245 states and 286 transitions. Second operand has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:47,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:47,369 INFO L93 Difference]: Finished difference Result 241 states and 278 transitions. [2022-07-20 06:08:47,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:08:47,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-20 06:08:47,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:47,371 INFO L225 Difference]: With dead ends: 241 [2022-07-20 06:08:47,371 INFO L226 Difference]: Without dead ends: 241 [2022-07-20 06:08:47,371 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-20 06:08:47,372 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 82 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:47,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 148 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:08:47,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-07-20 06:08:47,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-07-20 06:08:47,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 203 states have (on average 1.3694581280788178) internal successors, (278), 240 states have internal predecessors, (278), 0 states have call successors, (0), 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-20 06:08:47,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 278 transitions. [2022-07-20 06:08:47,377 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 278 transitions. Word has length 36 [2022-07-20 06:08:47,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:47,377 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 278 transitions. [2022-07-20 06:08:47,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.5) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:47,378 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 278 transitions. [2022-07-20 06:08:47,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 06:08:47,378 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:47,378 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:47,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 06:08:47,379 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-20 06:08:47,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:47,379 INFO L85 PathProgramCache]: Analyzing trace with hash 817273180, now seen corresponding path program 1 times [2022-07-20 06:08:47,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:47,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871099974] [2022-07-20 06:08:47,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:47,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:47,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:47,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 06:08:47,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:47,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871099974] [2022-07-20 06:08:47,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871099974] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:47,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:47,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:08:47,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880486990] [2022-07-20 06:08:47,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:47,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:08:47,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:47,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:08:47,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:08:47,427 INFO L87 Difference]: Start difference. First operand 241 states and 278 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:47,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:47,639 INFO L93 Difference]: Finished difference Result 261 states and 299 transitions. [2022-07-20 06:08:47,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:08:47,639 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-20 06:08:47,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:47,640 INFO L225 Difference]: With dead ends: 261 [2022-07-20 06:08:47,640 INFO L226 Difference]: Without dead ends: 261 [2022-07-20 06:08:47,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:08:47,641 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 114 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:47,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 335 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:08:47,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-07-20 06:08:47,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 240. [2022-07-20 06:08:47,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 203 states have (on average 1.3645320197044335) internal successors, (277), 239 states have internal predecessors, (277), 0 states have call successors, (0), 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-20 06:08:47,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 277 transitions. [2022-07-20 06:08:47,649 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 277 transitions. Word has length 36 [2022-07-20 06:08:47,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:47,649 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 277 transitions. [2022-07-20 06:08:47,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:47,649 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 277 transitions. [2022-07-20 06:08:47,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 06:08:47,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:47,650 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:47,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 06:08:47,651 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-20 06:08:47,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:47,651 INFO L85 PathProgramCache]: Analyzing trace with hash 817273181, now seen corresponding path program 1 times [2022-07-20 06:08:47,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:47,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732503506] [2022-07-20 06:08:47,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:47,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:47,879 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:47,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:47,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732503506] [2022-07-20 06:08:47,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732503506] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:08:47,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [880739946] [2022-07-20 06:08:47,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:47,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:08:47,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:08:47,884 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-20 06:08:47,888 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-20 06:08:47,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:47,994 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-20 06:08:47,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:48,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:48,068 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:48,070 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 11 treesize of output 11 [2022-07-20 06:08:48,106 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-20 06:08:48,115 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-20 06:08:48,193 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:48,193 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-20 06:08:48,197 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 18 treesize of output 20 [2022-07-20 06:08:48,214 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 16 treesize of output 8 [2022-07-20 06:08:48,260 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-20 06:08:48,280 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-20 06:08:48,420 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 23 treesize of output 15 [2022-07-20 06:08:48,423 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:48,425 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:48,425 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 26 treesize of output 17 [2022-07-20 06:08:48,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:48,465 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:48,544 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:48,545 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 32 treesize of output 36 [2022-07-20 06:08:48,689 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_80| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_80| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_777) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_80|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_80| 0))) is different from false [2022-07-20 06:08:48,732 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_80| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_80| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_777) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_80|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_80| 0))) is different from false [2022-07-20 06:08:48,741 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_80| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_80| |c_ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_777) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_80|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_80| 0))) is different from false [2022-07-20 06:08:48,759 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_80| Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_774 (Array Int Int))) (or (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_775) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_774) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_777) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_80|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_80| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_80| 0))) is different from false [2022-07-20 06:08:48,770 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_80| Int) (v_ArrVal_775 (Array Int Int)) (v_ArrVal_774 (Array Int Int))) (or (<= 0 (select (select (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_775) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_774) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_777)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_80|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_80| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_80| 0))) is different from false [2022-07-20 06:08:48,785 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:48,786 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 36 treesize of output 37 [2022-07-20 06:08:48,791 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:48,792 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 28 treesize of output 29 [2022-07-20 06:08:48,795 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 50 treesize of output 42 [2022-07-20 06:08:48,803 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:48,804 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 166 treesize of output 161 [2022-07-20 06:08:48,810 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 122 treesize of output 118 [2022-07-20 06:08:48,814 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 142 treesize of output 132 [2022-07-20 06:08:48,819 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 110 treesize of output 98 [2022-07-20 06:08:49,116 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:49,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [880739946] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:49,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:08:49,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 16] total 44 [2022-07-20 06:08:49,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066156159] [2022-07-20 06:08:49,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:49,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-20 06:08:49,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:49,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-20 06:08:49,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1396, Unknown=5, NotChecked=400, Total=1980 [2022-07-20 06:08:49,119 INFO L87 Difference]: Start difference. First operand 240 states and 277 transitions. Second operand has 45 states, 44 states have (on average 2.409090909090909) internal successors, (106), 45 states have internal predecessors, (106), 0 states have call successors, (0), 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-20 06:08:50,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:50,705 INFO L93 Difference]: Finished difference Result 346 states and 392 transitions. [2022-07-20 06:08:50,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-20 06:08:50,705 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.409090909090909) internal successors, (106), 45 states have internal predecessors, (106), 0 states have call successors, (0), 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 36 [2022-07-20 06:08:50,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:50,707 INFO L225 Difference]: With dead ends: 346 [2022-07-20 06:08:50,707 INFO L226 Difference]: Without dead ends: 346 [2022-07-20 06:08:50,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1220 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=653, Invalid=3784, Unknown=5, NotChecked=670, Total=5112 [2022-07-20 06:08:50,711 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 434 mSDsluCounter, 1742 mSDsCounter, 0 mSdLazyCounter, 1492 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 1863 SdHoareTripleChecker+Invalid, 2932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1312 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:50,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 1863 Invalid, 2932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1492 Invalid, 0 Unknown, 1312 Unchecked, 0.7s Time] [2022-07-20 06:08:50,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-07-20 06:08:50,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 227. [2022-07-20 06:08:50,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 197 states have (on average 1.3248730964467006) internal successors, (261), 226 states have internal predecessors, (261), 0 states have call successors, (0), 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-20 06:08:50,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 261 transitions. [2022-07-20 06:08:50,717 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 261 transitions. Word has length 36 [2022-07-20 06:08:50,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:50,718 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 261 transitions. [2022-07-20 06:08:50,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.409090909090909) internal successors, (106), 45 states have internal predecessors, (106), 0 states have call successors, (0), 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-20 06:08:50,718 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 261 transitions. [2022-07-20 06:08:50,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 06:08:50,719 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:50,719 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:50,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:50,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-20 06:08:50,924 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-20 06:08:50,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:50,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1419322487, now seen corresponding path program 1 times [2022-07-20 06:08:50,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:50,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774110345] [2022-07-20 06:08:50,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:50,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:50,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 06:08:50,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:50,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774110345] [2022-07-20 06:08:50,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774110345] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:50,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:50,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:08:50,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68789695] [2022-07-20 06:08:50,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:50,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:08:50,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:50,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:08:50,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:08:50,988 INFO L87 Difference]: Start difference. First operand 227 states and 261 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 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-20 06:08:51,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:51,191 INFO L93 Difference]: Finished difference Result 247 states and 282 transitions. [2022-07-20 06:08:51,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:08:51,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 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 40 [2022-07-20 06:08:51,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:51,193 INFO L225 Difference]: With dead ends: 247 [2022-07-20 06:08:51,193 INFO L226 Difference]: Without dead ends: 247 [2022-07-20 06:08:51,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:08:51,194 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 101 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:51,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 334 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:08:51,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-20 06:08:51,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 233. [2022-07-20 06:08:51,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 203 states have (on average 1.3300492610837438) internal successors, (270), 232 states have internal predecessors, (270), 0 states have call successors, (0), 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-20 06:08:51,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 270 transitions. [2022-07-20 06:08:51,199 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 270 transitions. Word has length 40 [2022-07-20 06:08:51,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:51,199 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 270 transitions. [2022-07-20 06:08:51,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 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-20 06:08:51,199 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 270 transitions. [2022-07-20 06:08:51,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 06:08:51,200 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:51,200 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:51,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 06:08:51,200 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-20 06:08:51,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:51,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1419322486, now seen corresponding path program 1 times [2022-07-20 06:08:51,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:51,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347703411] [2022-07-20 06:08:51,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:51,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:51,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:51,442 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-20 06:08:51,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:51,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347703411] [2022-07-20 06:08:51,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347703411] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:08:51,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [227407384] [2022-07-20 06:08:51,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:51,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:08:51,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:08:51,447 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-20 06:08:51,448 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-20 06:08:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:51,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 06:08:51,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:51,616 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 23 treesize of output 15 [2022-07-20 06:08:51,619 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 28 treesize of output 16 [2022-07-20 06:08:51,652 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-20 06:08:51,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:08:51,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [227407384] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:51,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 06:08:51,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2022-07-20 06:08:51,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783668264] [2022-07-20 06:08:51,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:51,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:08:51,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:51,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:08:51,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2022-07-20 06:08:51,655 INFO L87 Difference]: Start difference. First operand 233 states and 270 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 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-20 06:08:51,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:51,865 INFO L93 Difference]: Finished difference Result 242 states and 277 transitions. [2022-07-20 06:08:51,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:08:51,866 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 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 40 [2022-07-20 06:08:51,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:51,866 INFO L225 Difference]: With dead ends: 242 [2022-07-20 06:08:51,866 INFO L226 Difference]: Without dead ends: 242 [2022-07-20 06:08:51,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2022-07-20 06:08:51,867 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 53 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:51,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 412 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:08:51,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-07-20 06:08:51,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 231. [2022-07-20 06:08:51,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 203 states have (on average 1.3054187192118227) internal successors, (265), 230 states have internal predecessors, (265), 0 states have call successors, (0), 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-20 06:08:51,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 265 transitions. [2022-07-20 06:08:51,872 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 265 transitions. Word has length 40 [2022-07-20 06:08:51,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:51,872 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 265 transitions. [2022-07-20 06:08:51,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 0 states have call successors, (0), 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-20 06:08:51,873 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 265 transitions. [2022-07-20 06:08:51,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-20 06:08:51,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:51,873 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:51,901 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-20 06:08:52,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:08:52,100 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 77 more)] === [2022-07-20 06:08:52,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:52,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1458488866, now seen corresponding path program 1 times [2022-07-20 06:08:52,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:52,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176396729] [2022-07-20 06:08:52,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:52,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:52,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:52,342 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:52,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:52,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176396729] [2022-07-20 06:08:52,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176396729] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:08:52,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009502892] [2022-07-20 06:08:52,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:52,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:08:52,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:08:52,345 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-20 06:08:52,345 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-20 06:08:52,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:52,449 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-20 06:08:52,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:52,456 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:52,509 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:52,510 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 11 treesize of output 11 [2022-07-20 06:08:52,529 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-20 06:08:52,599 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:52,600 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-20 06:08:52,672 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-20 06:08:52,673 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 27 treesize of output 22 [2022-07-20 06:08:52,679 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 19 treesize of output 18 [2022-07-20 06:08:52,751 INFO L356 Elim1Store]: treesize reduction 92, result has 17.1 percent of original size [2022-07-20 06:08:52,752 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 70 [2022-07-20 06:08:52,761 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-20 06:08:52,761 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 52 [2022-07-20 06:08:53,011 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:53,027 INFO L356 Elim1Store]: treesize reduction 81, result has 8.0 percent of original size [2022-07-20 06:08:53,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 45 [2022-07-20 06:08:53,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:53,040 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:08:53,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 16 [2022-07-20 06:08:53,049 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:53,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:09:07,575 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:07,576 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 810 treesize of output 629 [2022-07-20 06:09:12,163 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:12,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 6311 treesize of output 4269