./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-circular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a31fd051 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-circular-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 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:12:56,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:12:56,173 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:12:56,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:12:56,199 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:12:56,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:12:56,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:12:56,206 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:12:56,208 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:12:56,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:12:56,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:12:56,213 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:12:56,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:12:56,214 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:12:56,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:12:56,217 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:12:56,218 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:12:56,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:12:56,220 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:12:56,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:12:56,224 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:12:56,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:12:56,226 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:12:56,226 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:12:56,230 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:12:56,231 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:12:56,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:12:56,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:12:56,232 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:12:56,233 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:12:56,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:12:56,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:12:56,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:12:56,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:12:56,236 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:12:56,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:12:56,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:12:56,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:12:56,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:12:56,238 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:12:56,238 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:12:56,239 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 13:12:56,275 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:12:56,275 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:12:56,276 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:12:56,276 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:12:56,277 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:12:56,277 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:12:56,277 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:12:56,277 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:12:56,277 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:12:56,278 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:12:56,278 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:12:56,278 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:12:56,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:12:56,279 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:12:56,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:12:56,279 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:12:56,279 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:12:56,279 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:12:56,279 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:12:56,279 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:12:56,280 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:12:56,280 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:12:56,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:12:56,280 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:12:56,280 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:12:56,280 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:12:56,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:12:56,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:12:56,281 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 13:12:56,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 13:12:56,281 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:12:56,281 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:12:56,281 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:12:56,282 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:12:56,282 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c [2023-02-15 13:12:56,495 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:12:56,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:12:56,514 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:12:56,515 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:12:56,516 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:12:56,517 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-circular-2.i [2023-02-15 13:12:57,461 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:12:57,682 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:12:57,683 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i [2023-02-15 13:12:57,694 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/250f60af9/0ce0e079ca30460a81393881ac348e7e/FLAGd7b4865f5 [2023-02-15 13:12:57,706 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/250f60af9/0ce0e079ca30460a81393881ac348e7e [2023-02-15 13:12:57,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:12:57,710 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:12:57,712 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:12:57,712 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:12:57,714 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:12:57,714 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:12:57" (1/1) ... [2023-02-15 13:12:57,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19f8d18c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:57, skipping insertion in model container [2023-02-15 13:12:57,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:12:57" (1/1) ... [2023-02-15 13:12:57,720 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:12:57,762 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:12:57,985 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22391,22404] [2023-02-15 13:12:57,992 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22497,22510] [2023-02-15 13:12:57,993 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22622,22635] [2023-02-15 13:12:58,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:12:58,011 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:12:58,035 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22391,22404] [2023-02-15 13:12:58,040 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22497,22510] [2023-02-15 13:12:58,042 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22622,22635] [2023-02-15 13:12:58,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:12:58,064 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:12:58,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:58 WrapperNode [2023-02-15 13:12:58,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:12:58,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:12:58,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:12:58,065 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:12:58,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:58" (1/1) ... [2023-02-15 13:12:58,081 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:58" (1/1) ... [2023-02-15 13:12:58,098 INFO L138 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 123 [2023-02-15 13:12:58,098 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:12:58,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:12:58,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:12:58,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:12:58,105 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:58" (1/1) ... [2023-02-15 13:12:58,105 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:58" (1/1) ... [2023-02-15 13:12:58,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:58" (1/1) ... [2023-02-15 13:12:58,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:58" (1/1) ... [2023-02-15 13:12:58,115 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:58" (1/1) ... [2023-02-15 13:12:58,119 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:58" (1/1) ... [2023-02-15 13:12:58,122 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:58" (1/1) ... [2023-02-15 13:12:58,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:58" (1/1) ... [2023-02-15 13:12:58,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:12:58,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:12:58,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:12:58,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:12:58,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:58" (1/1) ... [2023-02-15 13:12:58,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:12:58,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:12:58,152 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 13:12:58,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 13:12:58,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-15 13:12:58,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-15 13:12:58,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 13:12:58,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:12:58,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 13:12:58,183 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 13:12:58,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 13:12:58,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 13:12:58,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:12:58,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:12:58,260 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:12:58,262 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:12:58,565 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:12:58,570 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:12:58,570 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2023-02-15 13:12:58,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:12:58 BoogieIcfgContainer [2023-02-15 13:12:58,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:12:58,576 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:12:58,576 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:12:58,579 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:12:58,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:12:57" (1/3) ... [2023-02-15 13:12:58,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c2d198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:12:58, skipping insertion in model container [2023-02-15 13:12:58,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:12:58" (2/3) ... [2023-02-15 13:12:58,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27c2d198 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:12:58, skipping insertion in model container [2023-02-15 13:12:58,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:12:58" (3/3) ... [2023-02-15 13:12:58,581 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2023-02-15 13:12:58,593 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:12:58,593 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2023-02-15 13:12:58,623 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:12:58,628 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4b58a4b5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:12:58,628 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2023-02-15 13:12:58,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 59 states have (on average 2.2033898305084745) internal successors, (130), 111 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:58,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 13:12:58,634 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:12:58,635 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 13:12:58,635 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:12:58,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:12:58,639 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-15 13:12:58,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:12:58,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499204726] [2023-02-15 13:12:58,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:12:58,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:12:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:12:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:12:58,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:12:58,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499204726] [2023-02-15 13:12:58,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499204726] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:12:58,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:12:58,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:12:58,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620746984] [2023-02-15 13:12:58,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:12:58,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:12:58,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:12:58,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:12:58,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:12:58,819 INFO L87 Difference]: Start difference. First operand has 112 states, 59 states have (on average 2.2033898305084745) internal successors, (130), 111 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:58,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:12:58,893 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2023-02-15 13:12:58,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:12:58,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-15 13:12:58,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:12:58,901 INFO L225 Difference]: With dead ends: 117 [2023-02-15 13:12:58,901 INFO L226 Difference]: Without dead ends: 115 [2023-02-15 13:12:58,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:12:58,904 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 95 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:12:58,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 80 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:12:58,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-02-15 13:12:58,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2023-02-15 13:12:58,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 58 states have (on average 1.9137931034482758) internal successors, (111), 104 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:58,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2023-02-15 13:12:58,940 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 3 [2023-02-15 13:12:58,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:12:58,941 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2023-02-15 13:12:58,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:58,941 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2023-02-15 13:12:58,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 13:12:58,941 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:12:58,941 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 13:12:58,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 13:12:58,942 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:12:58,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:12:58,942 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-15 13:12:58,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:12:58,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437787375] [2023-02-15 13:12:58,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:12:58,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:12:58,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:12:59,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:12:59,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:12:59,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437787375] [2023-02-15 13:12:59,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437787375] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:12:59,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:12:59,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 13:12:59,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375301279] [2023-02-15 13:12:59,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:12:59,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:12:59,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:12:59,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:12:59,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:12:59,030 INFO L87 Difference]: Start difference. First operand 105 states and 111 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:59,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:12:59,115 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2023-02-15 13:12:59,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:12:59,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-15 13:12:59,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:12:59,117 INFO L225 Difference]: With dead ends: 112 [2023-02-15 13:12:59,118 INFO L226 Difference]: Without dead ends: 112 [2023-02-15 13:12:59,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:12:59,119 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 92 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:12:59,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 80 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:12:59,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-15 13:12:59,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 100. [2023-02-15 13:12:59,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 99 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) [2023-02-15 13:12:59,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2023-02-15 13:12:59,125 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 3 [2023-02-15 13:12:59,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:12:59,126 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2023-02-15 13:12:59,126 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:59,126 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2023-02-15 13:12:59,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 13:12:59,126 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:12:59,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:12:59,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 13:12:59,127 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:12:59,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:12:59,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112040, now seen corresponding path program 1 times [2023-02-15 13:12:59,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:12:59,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128630409] [2023-02-15 13:12:59,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:12:59,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:12:59,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:12:59,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:12:59,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:12:59,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128630409] [2023-02-15 13:12:59,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128630409] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:12:59,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:12:59,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:12:59,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829548151] [2023-02-15 13:12:59,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:12:59,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:12:59,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:12:59,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:12:59,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:12:59,209 INFO L87 Difference]: Start difference. First operand 100 states and 106 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) [2023-02-15 13:12:59,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:12:59,286 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2023-02-15 13:12:59,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:12:59,286 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 [2023-02-15 13:12:59,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:12:59,287 INFO L225 Difference]: With dead ends: 97 [2023-02-15 13:12:59,287 INFO L226 Difference]: Without dead ends: 97 [2023-02-15 13:12:59,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:12:59,288 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 150 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:12:59,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 54 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:12:59,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-02-15 13:12:59,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2023-02-15 13:12:59,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 87 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:59,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2023-02-15 13:12:59,293 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 9 [2023-02-15 13:12:59,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:12:59,293 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2023-02-15 13:12:59,293 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) [2023-02-15 13:12:59,293 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2023-02-15 13:12:59,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-02-15 13:12:59,294 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:12:59,294 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:12:59,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 13:12:59,294 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:12:59,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:12:59,295 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112041, now seen corresponding path program 1 times [2023-02-15 13:12:59,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:12:59,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666440231] [2023-02-15 13:12:59,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:12:59,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:12:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:12:59,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:12:59,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:12:59,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666440231] [2023-02-15 13:12:59,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666440231] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:12:59,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:12:59,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:12:59,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88801474] [2023-02-15 13:12:59,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:12:59,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:12:59,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:12:59,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:12:59,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:12:59,393 INFO L87 Difference]: Start difference. First operand 88 states and 94 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) [2023-02-15 13:12:59,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:12:59,481 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2023-02-15 13:12:59,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:12:59,482 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 [2023-02-15 13:12:59,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:12:59,483 INFO L225 Difference]: With dead ends: 113 [2023-02-15 13:12:59,483 INFO L226 Difference]: Without dead ends: 113 [2023-02-15 13:12:59,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:12:59,484 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 103 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:12:59,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 101 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:12:59,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-02-15 13:12:59,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 97. [2023-02-15 13:12:59,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 96 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) [2023-02-15 13:12:59,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2023-02-15 13:12:59,489 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 9 [2023-02-15 13:12:59,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:12:59,489 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2023-02-15 13:12:59,489 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) [2023-02-15 13:12:59,489 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2023-02-15 13:12:59,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 13:12:59,490 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:12:59,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:12:59,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 13:12:59,490 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:12:59,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:12:59,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2023-02-15 13:12:59,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:12:59,491 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895759678] [2023-02-15 13:12:59,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:12:59,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:12:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:12:59,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:12:59,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:12:59,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895759678] [2023-02-15 13:12:59,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895759678] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:12:59,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:12:59,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:12:59,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801645910] [2023-02-15 13:12:59,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:12:59,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:12:59,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:12:59,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:12:59,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:12:59,654 INFO L87 Difference]: Start difference. First operand 97 states and 106 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) [2023-02-15 13:12:59,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:12:59,755 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2023-02-15 13:12:59,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:12:59,755 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 [2023-02-15 13:12:59,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:12:59,757 INFO L225 Difference]: With dead ends: 96 [2023-02-15 13:12:59,758 INFO L226 Difference]: Without dead ends: 96 [2023-02-15 13:12:59,760 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 [2023-02-15 13:12:59,762 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 7 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:12:59,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 224 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:12:59,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-02-15 13:12:59,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-02-15 13:12:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 95 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:59,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2023-02-15 13:12:59,773 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 12 [2023-02-15 13:12:59,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:12:59,776 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2023-02-15 13:12:59,776 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) [2023-02-15 13:12:59,777 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2023-02-15 13:12:59,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 13:12:59,777 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:12:59,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:12:59,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 13:12:59,778 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:12:59,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:12:59,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2023-02-15 13:12:59,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:12:59,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307755976] [2023-02-15 13:12:59,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:12:59,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:12:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:12:59,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:12:59,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:12:59,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307755976] [2023-02-15 13:12:59,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307755976] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:12:59,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:12:59,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:12:59,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289753877] [2023-02-15 13:12:59,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:12:59,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:12:59,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:12:59,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:12:59,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:12:59,883 INFO L87 Difference]: Start difference. First operand 96 states and 104 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) [2023-02-15 13:12:59,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:12:59,960 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2023-02-15 13:12:59,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:12:59,961 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 [2023-02-15 13:12:59,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:12:59,962 INFO L225 Difference]: With dead ends: 95 [2023-02-15 13:12:59,962 INFO L226 Difference]: Without dead ends: 95 [2023-02-15 13:12:59,962 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 [2023-02-15 13:12:59,965 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 8 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:12:59,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 229 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:12:59,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-02-15 13:12:59,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-02-15 13:12:59,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 94 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:12:59,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2023-02-15 13:12:59,978 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 12 [2023-02-15 13:12:59,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:12:59,978 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2023-02-15 13:12:59,978 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) [2023-02-15 13:12:59,979 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2023-02-15 13:12:59,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 13:12:59,979 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:12:59,979 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:12:59,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 13:12:59,980 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:12:59,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:12:59,980 INFO L85 PathProgramCache]: Analyzing trace with hash 683852107, now seen corresponding path program 1 times [2023-02-15 13:12:59,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:12:59,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412723117] [2023-02-15 13:12:59,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:12:59,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:12:59,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:00,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:00,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:00,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412723117] [2023-02-15 13:13:00,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412723117] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:00,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:00,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:13:00,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343050650] [2023-02-15 13:13:00,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:00,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:13:00,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:00,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:13:00,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:13:00,178 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:00,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:00,342 INFO L93 Difference]: Finished difference Result 178 states and 189 transitions. [2023-02-15 13:13:00,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:13:00,342 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2023-02-15 13:13:00,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:00,343 INFO L225 Difference]: With dead ends: 178 [2023-02-15 13:13:00,343 INFO L226 Difference]: Without dead ends: 178 [2023-02-15 13:13:00,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:13:00,345 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 362 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:00,346 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 286 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:13:00,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-02-15 13:13:00,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 98. [2023-02-15 13:13:00,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5) internal successors, (105), 97 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:00,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2023-02-15 13:13:00,354 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 13 [2023-02-15 13:13:00,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:00,354 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2023-02-15 13:13:00,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:00,354 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2023-02-15 13:13:00,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 13:13:00,355 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:00,355 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:00,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 13:13:00,355 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:13:00,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:00,356 INFO L85 PathProgramCache]: Analyzing trace with hash -275416990, now seen corresponding path program 1 times [2023-02-15 13:13:00,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:00,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864137663] [2023-02-15 13:13:00,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:00,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:00,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:00,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:00,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864137663] [2023-02-15 13:13:00,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864137663] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:00,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:00,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:13:00,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175640144] [2023-02-15 13:13:00,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:00,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:13:00,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:00,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:13:00,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:13:00,504 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:00,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:00,695 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2023-02-15 13:13:00,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:13:00,696 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2023-02-15 13:13:00,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:00,697 INFO L225 Difference]: With dead ends: 140 [2023-02-15 13:13:00,697 INFO L226 Difference]: Without dead ends: 140 [2023-02-15 13:13:00,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:13:00,697 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 329 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:00,698 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 210 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:13:00,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-02-15 13:13:00,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 100. [2023-02-15 13:13:00,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.5) internal successors, (108), 99 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:00,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2023-02-15 13:13:00,700 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 14 [2023-02-15 13:13:00,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:00,700 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2023-02-15 13:13:00,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:00,700 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2023-02-15 13:13:00,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 13:13:00,700 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:00,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:00,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 13:13:00,701 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:13:00,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:00,701 INFO L85 PathProgramCache]: Analyzing trace with hash -275416989, now seen corresponding path program 1 times [2023-02-15 13:13:00,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:00,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977833657] [2023-02-15 13:13:00,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:00,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:00,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:00,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:00,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:00,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977833657] [2023-02-15 13:13:00,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977833657] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:00,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:00,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:13:00,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894301384] [2023-02-15 13:13:00,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:00,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:13:00,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:00,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:13:00,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:13:00,929 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:01,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:01,121 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2023-02-15 13:13:01,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:13:01,121 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2023-02-15 13:13:01,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:01,122 INFO L225 Difference]: With dead ends: 172 [2023-02-15 13:13:01,122 INFO L226 Difference]: Without dead ends: 172 [2023-02-15 13:13:01,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:13:01,122 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 187 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:01,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 270 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:13:01,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2023-02-15 13:13:01,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 112. [2023-02-15 13:13:01,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 84 states have (on average 1.5) internal successors, (126), 111 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:01,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2023-02-15 13:13:01,124 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 14 [2023-02-15 13:13:01,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:01,124 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2023-02-15 13:13:01,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:01,125 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2023-02-15 13:13:01,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 13:13:01,125 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:01,125 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:01,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 13:13:01,125 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:13:01,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:01,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2023-02-15 13:13:01,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:01,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99514156] [2023-02-15 13:13:01,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:01,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:01,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:01,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:01,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99514156] [2023-02-15 13:13:01,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99514156] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:01,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:01,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:13:01,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071765000] [2023-02-15 13:13:01,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:01,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:13:01,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:01,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:13:01,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:13:01,255 INFO L87 Difference]: Start difference. First operand 112 states and 126 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) [2023-02-15 13:13:01,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:01,470 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2023-02-15 13:13:01,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:13:01,471 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 [2023-02-15 13:13:01,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:01,471 INFO L225 Difference]: With dead ends: 120 [2023-02-15 13:13:01,472 INFO L226 Difference]: Without dead ends: 120 [2023-02-15 13:13:01,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-02-15 13:13:01,472 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 172 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:01,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 191 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:13:01,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-02-15 13:13:01,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2023-02-15 13:13:01,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 84 states have (on average 1.4880952380952381) internal successors, (125), 110 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:01,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2023-02-15 13:13:01,475 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 16 [2023-02-15 13:13:01,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:01,475 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2023-02-15 13:13:01,475 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) [2023-02-15 13:13:01,475 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2023-02-15 13:13:01,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 13:13:01,475 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:01,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:01,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 13:13:01,476 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:13:01,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:01,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2023-02-15 13:13:01,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:01,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905121887] [2023-02-15 13:13:01,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:01,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:01,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:01,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:01,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905121887] [2023-02-15 13:13:01,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905121887] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:01,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:01,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 13:13:01,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548226996] [2023-02-15 13:13:01,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:01,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 13:13:01,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:01,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 13:13:01,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:13:01,655 INFO L87 Difference]: Start difference. First operand 111 states and 125 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) [2023-02-15 13:13:01,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:01,996 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2023-02-15 13:13:01,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 13:13:01,997 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 [2023-02-15 13:13:01,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:01,997 INFO L225 Difference]: With dead ends: 115 [2023-02-15 13:13:01,997 INFO L226 Difference]: Without dead ends: 115 [2023-02-15 13:13:01,998 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 [2023-02-15 13:13:01,998 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 162 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:01,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 240 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:13:01,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-02-15 13:13:01,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2023-02-15 13:13:02,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 98 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:02,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2023-02-15 13:13:02,000 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 16 [2023-02-15 13:13:02,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:02,000 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2023-02-15 13:13:02,000 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) [2023-02-15 13:13:02,000 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2023-02-15 13:13:02,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 13:13:02,000 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:02,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:02,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 13:13:02,001 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:13:02,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:02,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1559926215, now seen corresponding path program 1 times [2023-02-15 13:13:02,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:02,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853530286] [2023-02-15 13:13:02,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:02,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:02,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:02,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:02,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853530286] [2023-02-15 13:13:02,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853530286] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:02,207 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:02,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:13:02,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557996266] [2023-02-15 13:13:02,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:02,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:13:02,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:02,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:13:02,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:13:02,208 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:02,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:02,433 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2023-02-15 13:13:02,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 13:13:02,434 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-15 13:13:02,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:02,435 INFO L225 Difference]: With dead ends: 147 [2023-02-15 13:13:02,435 INFO L226 Difference]: Without dead ends: 147 [2023-02-15 13:13:02,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2023-02-15 13:13:02,435 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 342 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:02,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 319 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:13:02,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-02-15 13:13:02,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 99. [2023-02-15 13:13:02,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.435897435897436) internal successors, (112), 98 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:02,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2023-02-15 13:13:02,437 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 17 [2023-02-15 13:13:02,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:02,437 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2023-02-15 13:13:02,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:02,438 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2023-02-15 13:13:02,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 13:13:02,438 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:02,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:02,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 13:13:02,438 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:13:02,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:02,438 INFO L85 PathProgramCache]: Analyzing trace with hash -1559926214, now seen corresponding path program 1 times [2023-02-15 13:13:02,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:02,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47055887] [2023-02-15 13:13:02,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:02,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:02,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:02,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:02,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47055887] [2023-02-15 13:13:02,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47055887] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:02,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:02,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:13:02,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859533331] [2023-02-15 13:13:02,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:02,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:13:02,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:02,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:13:02,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:13:02,693 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:02,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:02,894 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2023-02-15 13:13:02,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:13:02,895 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-15 13:13:02,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:02,895 INFO L225 Difference]: With dead ends: 157 [2023-02-15 13:13:02,895 INFO L226 Difference]: Without dead ends: 157 [2023-02-15 13:13:02,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:13:02,896 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 182 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:02,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 240 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:13:02,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-15 13:13:02,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 99. [2023-02-15 13:13:02,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 98 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:02,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2023-02-15 13:13:02,898 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 17 [2023-02-15 13:13:02,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:02,898 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2023-02-15 13:13:02,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:02,898 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2023-02-15 13:13:02,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 13:13:02,898 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:02,898 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:02,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 13:13:02,899 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:13:02,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:02,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1113087206, now seen corresponding path program 1 times [2023-02-15 13:13:02,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:02,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785034316] [2023-02-15 13:13:02,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:02,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:03,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:03,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:03,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785034316] [2023-02-15 13:13:03,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785034316] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:03,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:03,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:13:03,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743804394] [2023-02-15 13:13:03,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:03,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:13:03,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:03,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:13:03,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:13:03,019 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:03,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:03,174 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2023-02-15 13:13:03,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:13:03,174 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-15 13:13:03,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:03,175 INFO L225 Difference]: With dead ends: 138 [2023-02-15 13:13:03,175 INFO L226 Difference]: Without dead ends: 138 [2023-02-15 13:13:03,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:13:03,175 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 302 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:03,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 207 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:13:03,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-02-15 13:13:03,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 116. [2023-02-15 13:13:03,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 95 states have (on average 1.4947368421052631) internal successors, (142), 115 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:03,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2023-02-15 13:13:03,177 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 18 [2023-02-15 13:13:03,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:03,178 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2023-02-15 13:13:03,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:03,178 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2023-02-15 13:13:03,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 13:13:03,178 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:03,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:03,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 13:13:03,178 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:13:03,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:03,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1113087205, now seen corresponding path program 1 times [2023-02-15 13:13:03,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:03,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991975527] [2023-02-15 13:13:03,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:03,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:03,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:03,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:03,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991975527] [2023-02-15 13:13:03,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991975527] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:03,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:03,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:13:03,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15592416] [2023-02-15 13:13:03,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:03,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:13:03,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:03,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:13:03,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:13:03,385 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:03,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:03,563 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2023-02-15 13:13:03,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:13:03,564 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-15 13:13:03,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:03,564 INFO L225 Difference]: With dead ends: 159 [2023-02-15 13:13:03,564 INFO L226 Difference]: Without dead ends: 159 [2023-02-15 13:13:03,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:13:03,565 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 146 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:03,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 229 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:13:03,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-02-15 13:13:03,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 121. [2023-02-15 13:13:03,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 100 states have (on average 1.47) internal successors, (147), 120 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:03,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2023-02-15 13:13:03,567 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 18 [2023-02-15 13:13:03,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:03,567 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2023-02-15 13:13:03,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:03,567 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2023-02-15 13:13:03,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 13:13:03,567 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:03,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:03,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 13:13:03,568 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:13:03,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:03,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1461687964, now seen corresponding path program 1 times [2023-02-15 13:13:03,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:03,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481633190] [2023-02-15 13:13:03,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:03,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:03,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:03,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481633190] [2023-02-15 13:13:03,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481633190] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:03,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:03,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:13:03,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101675099] [2023-02-15 13:13:03,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:03,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:13:03,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:03,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:13:03,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:13:03,710 INFO L87 Difference]: Start difference. First operand 121 states and 147 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:03,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:03,871 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2023-02-15 13:13:03,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:13:03,871 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-15 13:13:03,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:03,872 INFO L225 Difference]: With dead ends: 155 [2023-02-15 13:13:03,872 INFO L226 Difference]: Without dead ends: 155 [2023-02-15 13:13:03,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:13:03,873 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 136 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:03,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 335 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:13:03,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2023-02-15 13:13:03,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 122. [2023-02-15 13:13:03,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 121 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:03,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 148 transitions. [2023-02-15 13:13:03,875 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 148 transitions. Word has length 21 [2023-02-15 13:13:03,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:03,875 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 148 transitions. [2023-02-15 13:13:03,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:03,875 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 148 transitions. [2023-02-15 13:13:03,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 13:13:03,875 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:03,875 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:03,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 13:13:03,876 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:13:03,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:03,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1905376220, now seen corresponding path program 1 times [2023-02-15 13:13:03,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:03,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116010134] [2023-02-15 13:13:03,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:03,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:03,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:03,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:03,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:03,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116010134] [2023-02-15 13:13:03,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116010134] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:03,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:03,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:13:03,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310866798] [2023-02-15 13:13:03,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:03,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:13:03,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:03,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:13:03,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:13:03,900 INFO L87 Difference]: Start difference. First operand 122 states and 148 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:03,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:03,904 INFO L93 Difference]: Finished difference Result 125 states and 151 transitions. [2023-02-15 13:13:03,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:13:03,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-15 13:13:03,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:03,905 INFO L225 Difference]: With dead ends: 125 [2023-02-15 13:13:03,905 INFO L226 Difference]: Without dead ends: 125 [2023-02-15 13:13:03,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:13:03,906 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 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 [2023-02-15 13:13:03,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:13:03,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-02-15 13:13:03,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2023-02-15 13:13:03,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 124 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:03,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 151 transitions. [2023-02-15 13:13:03,908 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 151 transitions. Word has length 21 [2023-02-15 13:13:03,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:03,908 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 151 transitions. [2023-02-15 13:13:03,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:03,909 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 151 transitions. [2023-02-15 13:13:03,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 13:13:03,910 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:03,910 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:03,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 13:13:03,910 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:13:03,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:03,911 INFO L85 PathProgramCache]: Analyzing trace with hash 2137291894, now seen corresponding path program 1 times [2023-02-15 13:13:03,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:03,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552101129] [2023-02-15 13:13:03,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:03,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:03,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:03,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:03,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552101129] [2023-02-15 13:13:03,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552101129] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:03,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:03,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:13:03,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584437164] [2023-02-15 13:13:03,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:03,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:13:03,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:03,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:13:03,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:13:03,977 INFO L87 Difference]: Start difference. First operand 125 states and 151 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:04,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:04,045 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2023-02-15 13:13:04,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:13:04,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-15 13:13:04,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:04,047 INFO L225 Difference]: With dead ends: 124 [2023-02-15 13:13:04,047 INFO L226 Difference]: Without dead ends: 124 [2023-02-15 13:13:04,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:13:04,048 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 177 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:04,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 99 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:13:04,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-15 13:13:04,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2023-02-15 13:13:04,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 103 states have (on average 1.4466019417475728) internal successors, (149), 122 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:04,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2023-02-15 13:13:04,050 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 21 [2023-02-15 13:13:04,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:04,050 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2023-02-15 13:13:04,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:04,050 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2023-02-15 13:13:04,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 13:13:04,053 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:04,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:04,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 13:13:04,053 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:13:04,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:04,054 INFO L85 PathProgramCache]: Analyzing trace with hash -1062832435, now seen corresponding path program 1 times [2023-02-15 13:13:04,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:04,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147362399] [2023-02-15 13:13:04,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:04,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:04,095 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:04,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:04,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147362399] [2023-02-15 13:13:04,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147362399] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:04,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:04,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:13:04,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156212563] [2023-02-15 13:13:04,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:04,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:13:04,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:04,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:13:04,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:13:04,097 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:04,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:04,175 INFO L93 Difference]: Finished difference Result 122 states and 146 transitions. [2023-02-15 13:13:04,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:13:04,176 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-15 13:13:04,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:04,176 INFO L225 Difference]: With dead ends: 122 [2023-02-15 13:13:04,176 INFO L226 Difference]: Without dead ends: 122 [2023-02-15 13:13:04,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:13:04,177 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 29 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:04,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 164 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:13:04,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-15 13:13:04,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2023-02-15 13:13:04,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 121 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:04,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 146 transitions. [2023-02-15 13:13:04,179 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 146 transitions. Word has length 22 [2023-02-15 13:13:04,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:04,179 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 146 transitions. [2023-02-15 13:13:04,179 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:04,179 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 146 transitions. [2023-02-15 13:13:04,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 13:13:04,180 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:04,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:04,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-15 13:13:04,180 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:13:04,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:04,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1062832434, now seen corresponding path program 1 times [2023-02-15 13:13:04,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:04,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837968763] [2023-02-15 13:13:04,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:04,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:04,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:04,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:04,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:04,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837968763] [2023-02-15 13:13:04,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837968763] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:04,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:04,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:13:04,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378776027] [2023-02-15 13:13:04,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:04,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:13:04,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:04,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:13:04,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:13:04,457 INFO L87 Difference]: Start difference. First operand 122 states and 146 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:04,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:04,692 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2023-02-15 13:13:04,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:13:04,692 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-15 13:13:04,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:04,693 INFO L225 Difference]: With dead ends: 153 [2023-02-15 13:13:04,693 INFO L226 Difference]: Without dead ends: 153 [2023-02-15 13:13:04,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2023-02-15 13:13:04,693 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 158 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:04,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 287 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:13:04,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-15 13:13:04,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 122. [2023-02-15 13:13:04,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.4077669902912622) internal successors, (145), 121 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:04,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2023-02-15 13:13:04,695 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 22 [2023-02-15 13:13:04,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:04,696 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2023-02-15 13:13:04,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:04,696 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2023-02-15 13:13:04,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 13:13:04,696 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:04,696 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:04,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-15 13:13:04,696 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:13:04,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:04,696 INFO L85 PathProgramCache]: Analyzing trace with hash 227835007, now seen corresponding path program 1 times [2023-02-15 13:13:04,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:04,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706953811] [2023-02-15 13:13:04,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:04,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:04,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:04,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:04,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706953811] [2023-02-15 13:13:04,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706953811] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:04,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:04,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:13:04,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257193828] [2023-02-15 13:13:04,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:04,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:13:04,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:04,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:13:04,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:13:04,856 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:05,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:05,000 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2023-02-15 13:13:05,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:13:05,001 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-15 13:13:05,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:05,001 INFO L225 Difference]: With dead ends: 135 [2023-02-15 13:13:05,001 INFO L226 Difference]: Without dead ends: 131 [2023-02-15 13:13:05,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2023-02-15 13:13:05,002 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 45 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:05,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 327 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:13:05,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-15 13:13:05,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120. [2023-02-15 13:13:05,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 119 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:05,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 142 transitions. [2023-02-15 13:13:05,004 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 142 transitions. Word has length 23 [2023-02-15 13:13:05,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:05,004 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 142 transitions. [2023-02-15 13:13:05,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:05,004 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 142 transitions. [2023-02-15 13:13:05,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 13:13:05,004 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:05,004 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:05,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-15 13:13:05,005 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:13:05,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:05,005 INFO L85 PathProgramCache]: Analyzing trace with hash 229252065, now seen corresponding path program 1 times [2023-02-15 13:13:05,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:05,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813737755] [2023-02-15 13:13:05,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:05,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:05,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:05,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:05,173 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813737755] [2023-02-15 13:13:05,173 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813737755] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:05,173 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:05,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 13:13:05,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271914010] [2023-02-15 13:13:05,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:05,174 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:13:05,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:05,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:13:05,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:13:05,174 INFO L87 Difference]: Start difference. First operand 120 states and 142 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:05,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:05,298 INFO L93 Difference]: Finished difference Result 151 states and 163 transitions. [2023-02-15 13:13:05,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:13:05,300 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-15 13:13:05,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:05,300 INFO L225 Difference]: With dead ends: 151 [2023-02-15 13:13:05,300 INFO L226 Difference]: Without dead ends: 151 [2023-02-15 13:13:05,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:13:05,301 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 247 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:05,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 265 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:13:05,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-15 13:13:05,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 121. [2023-02-15 13:13:05,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 120 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:05,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 143 transitions. [2023-02-15 13:13:05,303 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 143 transitions. Word has length 23 [2023-02-15 13:13:05,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:05,303 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 143 transitions. [2023-02-15 13:13:05,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:05,303 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 143 transitions. [2023-02-15 13:13:05,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 13:13:05,303 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:05,303 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:05,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-15 13:13:05,303 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:13:05,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:05,303 INFO L85 PathProgramCache]: Analyzing trace with hash 779247630, now seen corresponding path program 1 times [2023-02-15 13:13:05,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:05,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730223658] [2023-02-15 13:13:05,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:05,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:05,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:05,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:05,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:05,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730223658] [2023-02-15 13:13:05,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730223658] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:05,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:05,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:13:05,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063985130] [2023-02-15 13:13:05,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:05,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:13:05,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:05,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:13:05,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:13:05,342 INFO L87 Difference]: Start difference. First operand 121 states and 143 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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) [2023-02-15 13:13:05,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:05,438 INFO L93 Difference]: Finished difference Result 124 states and 145 transitions. [2023-02-15 13:13:05,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:13:05,439 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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 24 [2023-02-15 13:13:05,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:05,439 INFO L225 Difference]: With dead ends: 124 [2023-02-15 13:13:05,440 INFO L226 Difference]: Without dead ends: 124 [2023-02-15 13:13:05,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:13:05,440 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 76 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:05,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 159 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:13:05,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-15 13:13:05,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2023-02-15 13:13:05,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 121 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:05,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 144 transitions. [2023-02-15 13:13:05,442 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 144 transitions. Word has length 24 [2023-02-15 13:13:05,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:05,442 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 144 transitions. [2023-02-15 13:13:05,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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) [2023-02-15 13:13:05,443 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 144 transitions. [2023-02-15 13:13:05,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-15 13:13:05,443 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:05,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:05,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-15 13:13:05,443 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:13:05,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:05,444 INFO L85 PathProgramCache]: Analyzing trace with hash 779247631, now seen corresponding path program 1 times [2023-02-15 13:13:05,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:05,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578565107] [2023-02-15 13:13:05,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:05,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:05,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:05,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:05,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:05,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578565107] [2023-02-15 13:13:05,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578565107] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:13:05,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115044944] [2023-02-15 13:13:05,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:05,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:13:05,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:13:05,730 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:13:05,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 13:13:05,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:05,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 13:13:05,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:13:05,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-02-15 13:13:05,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-02-15 13:13:06,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:06,032 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:13:06,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [115044944] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:06,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:13:06,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 13 [2023-02-15 13:13:06,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209974878] [2023-02-15 13:13:06,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:06,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:13:06,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:06,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:13:06,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-02-15 13:13:06,033 INFO L87 Difference]: Start difference. First operand 122 states and 144 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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) [2023-02-15 13:13:06,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:06,167 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2023-02-15 13:13:06,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:13:06,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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 24 [2023-02-15 13:13:06,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:06,168 INFO L225 Difference]: With dead ends: 122 [2023-02-15 13:13:06,168 INFO L226 Difference]: Without dead ends: 122 [2023-02-15 13:13:06,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2023-02-15 13:13:06,168 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 61 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:06,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 173 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:13:06,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-02-15 13:13:06,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2023-02-15 13:13:06,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 103 states have (on average 1.3592233009708738) internal successors, (140), 120 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:06,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 140 transitions. [2023-02-15 13:13:06,170 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 140 transitions. Word has length 24 [2023-02-15 13:13:06,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:06,170 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 140 transitions. [2023-02-15 13:13:06,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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) [2023-02-15 13:13:06,171 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 140 transitions. [2023-02-15 13:13:06,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 13:13:06,171 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:06,171 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:06,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-15 13:13:06,371 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,SelfDestructingSolverStorable23 [2023-02-15 13:13:06,371 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:13:06,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:06,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1267909458, now seen corresponding path program 1 times [2023-02-15 13:13:06,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:06,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429331780] [2023-02-15 13:13:06,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:06,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:06,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:06,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:06,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429331780] [2023-02-15 13:13:06,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429331780] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:06,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:06,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-15 13:13:06,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415849846] [2023-02-15 13:13:06,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:06,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 13:13:06,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:06,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 13:13:06,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-15 13:13:06,643 INFO L87 Difference]: Start difference. First operand 121 states and 140 transitions. Second operand has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:06,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:06,870 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2023-02-15 13:13:06,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 13:13:06,870 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-15 13:13:06,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:06,871 INFO L225 Difference]: With dead ends: 137 [2023-02-15 13:13:06,871 INFO L226 Difference]: Without dead ends: 133 [2023-02-15 13:13:06,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2023-02-15 13:13:06,871 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 153 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:06,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 456 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:13:06,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-15 13:13:06,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 121. [2023-02-15 13:13:06,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 120 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:06,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 139 transitions. [2023-02-15 13:13:06,873 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 139 transitions. Word has length 25 [2023-02-15 13:13:06,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:06,873 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 139 transitions. [2023-02-15 13:13:06,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 12 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:06,873 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2023-02-15 13:13:06,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 13:13:06,874 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:06,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:06,874 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-02-15 13:13:06,874 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:13:06,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:06,874 INFO L85 PathProgramCache]: Analyzing trace with hash -342052636, now seen corresponding path program 1 times [2023-02-15 13:13:06,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:06,874 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235171310] [2023-02-15 13:13:06,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:06,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:06,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:07,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:07,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:07,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235171310] [2023-02-15 13:13:07,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235171310] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:07,177 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:07,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 13:13:07,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519178806] [2023-02-15 13:13:07,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:07,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 13:13:07,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:07,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 13:13:07,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-02-15 13:13:07,179 INFO L87 Difference]: Start difference. First operand 121 states and 139 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:07,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:07,439 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2023-02-15 13:13:07,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 13:13:07,439 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-15 13:13:07,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:07,440 INFO L225 Difference]: With dead ends: 131 [2023-02-15 13:13:07,440 INFO L226 Difference]: Without dead ends: 131 [2023-02-15 13:13:07,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2023-02-15 13:13:07,440 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 136 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:07,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 425 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:13:07,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-15 13:13:07,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 120. [2023-02-15 13:13:07,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 102 states have (on average 1.3431372549019607) internal successors, (137), 119 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:07,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 137 transitions. [2023-02-15 13:13:07,442 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 137 transitions. Word has length 25 [2023-02-15 13:13:07,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:07,442 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 137 transitions. [2023-02-15 13:13:07,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:07,443 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 137 transitions. [2023-02-15 13:13:07,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 13:13:07,443 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:07,443 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:07,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-02-15 13:13:07,443 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:13:07,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:07,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1700492295, now seen corresponding path program 1 times [2023-02-15 13:13:07,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:07,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943725347] [2023-02-15 13:13:07,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:07,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:07,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:07,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:07,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943725347] [2023-02-15 13:13:07,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943725347] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:07,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:13:07,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:13:07,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433996479] [2023-02-15 13:13:07,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:07,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 13:13:07,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:07,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 13:13:07,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:13:07,467 INFO L87 Difference]: Start difference. First operand 120 states and 137 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:07,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:07,475 INFO L93 Difference]: Finished difference Result 190 states and 211 transitions. [2023-02-15 13:13:07,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 13:13:07,476 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-15 13:13:07,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:07,477 INFO L225 Difference]: With dead ends: 190 [2023-02-15 13:13:07,478 INFO L226 Difference]: Without dead ends: 190 [2023-02-15 13:13:07,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 13:13:07,478 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 59 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:07,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 151 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:13:07,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-02-15 13:13:07,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 136. [2023-02-15 13:13:07,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 118 states have (on average 1.3135593220338984) internal successors, (155), 135 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:07,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 155 transitions. [2023-02-15 13:13:07,481 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 155 transitions. Word has length 25 [2023-02-15 13:13:07,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:07,481 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 155 transitions. [2023-02-15 13:13:07,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:07,482 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 155 transitions. [2023-02-15 13:13:07,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 13:13:07,482 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:07,482 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:13:07,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-02-15 13:13:07,482 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:13:07,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:07,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1532665747, now seen corresponding path program 1 times [2023-02-15 13:13:07,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:07,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326305414] [2023-02-15 13:13:07,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:07,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:07,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:07,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:07,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326305414] [2023-02-15 13:13:07,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326305414] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:13:07,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211923874] [2023-02-15 13:13:07,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:07,726 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:13:07,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:13:07,727 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:13:07,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 13:13:07,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:07,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-15 13:13:07,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:13:07,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2023-02-15 13:13:07,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-02-15 13:13:07,945 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-15 13:13:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:07,960 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:13:07,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211923874] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:13:07,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 13:13:07,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2023-02-15 13:13:07,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377611161] [2023-02-15 13:13:07,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:13:07,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 13:13:07,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:07,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 13:13:07,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2023-02-15 13:13:07,962 INFO L87 Difference]: Start difference. First operand 136 states and 155 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:08,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:08,171 INFO L93 Difference]: Finished difference Result 154 states and 174 transitions. [2023-02-15 13:13:08,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 13:13:08,171 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-15 13:13:08,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:08,172 INFO L225 Difference]: With dead ends: 154 [2023-02-15 13:13:08,172 INFO L226 Difference]: Without dead ends: 154 [2023-02-15 13:13:08,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2023-02-15 13:13:08,172 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 33 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:08,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 319 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:13:08,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-02-15 13:13:08,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 149. [2023-02-15 13:13:08,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 131 states have (on average 1.297709923664122) internal successors, (170), 148 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:08,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 170 transitions. [2023-02-15 13:13:08,174 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 170 transitions. Word has length 26 [2023-02-15 13:13:08,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:08,175 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 170 transitions. [2023-02-15 13:13:08,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:08,175 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 170 transitions. [2023-02-15 13:13:08,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 13:13:08,175 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:08,175 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] [2023-02-15 13:13:08,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 13:13:08,375 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,SelfDestructingSolverStorable27 [2023-02-15 13:13:08,375 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:13:08,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:08,376 INFO L85 PathProgramCache]: Analyzing trace with hash -301886117, now seen corresponding path program 1 times [2023-02-15 13:13:08,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:08,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260456232] [2023-02-15 13:13:08,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:08,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:08,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:08,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:08,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260456232] [2023-02-15 13:13:08,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260456232] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:13:08,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471335427] [2023-02-15 13:13:08,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:08,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:13:08,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:13:08,640 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:13:08,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 13:13:08,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:08,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-15 13:13:08,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:13:08,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:13:08,797 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:13:08,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 13:13:08,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:13:08,893 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:13:08,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2023-02-15 13:13:08,952 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:13:08,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2023-02-15 13:13:08,975 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:13:08,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2023-02-15 13:13:09,004 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:13:09,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2023-02-15 13:13:09,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-02-15 13:13:09,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:09,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:13:09,160 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_890 (Array Int Int)) (v_ArrVal_893 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_890))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_893)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2023-02-15 13:13:09,215 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:13:09,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2023-02-15 13:13:09,222 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:13:09,223 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 128 [2023-02-15 13:13:09,230 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:13:09,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 111 [2023-02-15 13:13:09,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 98 [2023-02-15 13:13:09,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:09,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471335427] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:13:09,407 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:13:09,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 29 [2023-02-15 13:13:09,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826604395] [2023-02-15 13:13:09,407 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:13:09,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-15 13:13:09,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:09,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-15 13:13:09,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=650, Unknown=22, NotChecked=52, Total=812 [2023-02-15 13:13:09,408 INFO L87 Difference]: Start difference. First operand 149 states and 170 transitions. Second operand has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:10,124 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= .cse0 0)) (forall ((v_ArrVal_893 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_893) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1))) is different from false [2023-02-15 13:13:10,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:10,270 INFO L93 Difference]: Finished difference Result 271 states and 302 transitions. [2023-02-15 13:13:10,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 13:13:10,270 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 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 28 [2023-02-15 13:13:10,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:10,271 INFO L225 Difference]: With dead ends: 271 [2023-02-15 13:13:10,271 INFO L226 Difference]: Without dead ends: 271 [2023-02-15 13:13:10,272 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=251, Invalid=1215, Unknown=24, NotChecked=150, Total=1640 [2023-02-15 13:13:10,272 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 244 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 19 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:10,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 976 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1275 Invalid, 3 Unknown, 103 Unchecked, 0.6s Time] [2023-02-15 13:13:10,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2023-02-15 13:13:10,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 174. [2023-02-15 13:13:10,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 156 states have (on average 1.2692307692307692) internal successors, (198), 173 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:10,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 198 transitions. [2023-02-15 13:13:10,275 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 198 transitions. Word has length 28 [2023-02-15 13:13:10,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:10,275 INFO L495 AbstractCegarLoop]: Abstraction has 174 states and 198 transitions. [2023-02-15 13:13:10,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:10,275 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 198 transitions. [2023-02-15 13:13:10,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 13:13:10,275 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:10,275 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] [2023-02-15 13:13:10,295 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 13:13:10,476 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,SelfDestructingSolverStorable28 [2023-02-15 13:13:10,476 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:13:10,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:10,476 INFO L85 PathProgramCache]: Analyzing trace with hash -768530862, now seen corresponding path program 1 times [2023-02-15 13:13:10,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:10,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323142030] [2023-02-15 13:13:10,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:10,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:10,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:10,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:10,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323142030] [2023-02-15 13:13:10,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323142030] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:13:10,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221486350] [2023-02-15 13:13:10,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:10,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:13:10,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:13:10,696 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:13:10,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 13:13:10,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:10,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-15 13:13:10,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:13:10,918 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 13:13:10,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-02-15 13:13:10,968 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:13:10,971 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 13:13:10,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2023-02-15 13:13:11,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:13:11,016 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 13:13:11,016 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2023-02-15 13:13:11,048 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-02-15 13:13:11,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 15 [2023-02-15 13:13:11,062 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:11,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:13:13,195 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:13:13,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 99 [2023-02-15 13:13:13,530 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:13:13,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 54 treesize of output 208 [2023-02-15 13:13:13,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:13,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221486350] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:13:13,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:13:13,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2023-02-15 13:13:13,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563968326] [2023-02-15 13:13:13,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:13:13,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-02-15 13:13:13,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:13,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-02-15 13:13:13,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=503, Unknown=1, NotChecked=0, Total=600 [2023-02-15 13:13:13,981 INFO L87 Difference]: Start difference. First operand 174 states and 198 transitions. Second operand has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:20,727 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 13:13:22,733 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-02-15 13:13:25,334 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:13:27,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:13:31,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:13:31,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:13:31,293 INFO L93 Difference]: Finished difference Result 308 states and 347 transitions. [2023-02-15 13:13:31,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-15 13:13:31,293 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-15 13:13:31,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:13:31,294 INFO L225 Difference]: With dead ends: 308 [2023-02-15 13:13:31,294 INFO L226 Difference]: Without dead ends: 308 [2023-02-15 13:13:31,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 632 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=635, Invalid=1914, Unknown=1, NotChecked=0, Total=2550 [2023-02-15 13:13:31,296 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 923 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 105 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:13:31,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 537 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 800 Invalid, 7 Unknown, 0 Unchecked, 14.4s Time] [2023-02-15 13:13:31,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2023-02-15 13:13:31,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 213. [2023-02-15 13:13:31,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 195 states have (on average 1.2564102564102564) internal successors, (245), 212 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:31,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 245 transitions. [2023-02-15 13:13:31,299 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 245 transitions. Word has length 29 [2023-02-15 13:13:31,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:13:31,299 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 245 transitions. [2023-02-15 13:13:31,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:31,299 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 245 transitions. [2023-02-15 13:13:31,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 13:13:31,299 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:13:31,299 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] [2023-02-15 13:13:31,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 13:13:31,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:13:31,504 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:13:31,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:13:31,505 INFO L85 PathProgramCache]: Analyzing trace with hash -768530861, now seen corresponding path program 1 times [2023-02-15 13:13:31,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:13:31,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966303832] [2023-02-15 13:13:31,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:31,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:13:31,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:31,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:31,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:13:31,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966303832] [2023-02-15 13:13:31,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966303832] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:13:31,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269953015] [2023-02-15 13:13:31,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:13:31,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:13:31,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:13:31,825 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:13:31,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 13:13:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:13:31,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-15 13:13:31,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:13:31,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:13:31,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:13:32,008 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:13:32,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 13:13:32,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:13:32,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:13:32,131 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:13:32,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-02-15 13:13:32,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 13:13:32,215 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:13:32,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:13:32,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:13:32,229 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:13:32,229 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-15 13:13:32,281 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:13:32,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:13:32,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:13:32,295 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:13:32,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-15 13:13:32,353 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:13:32,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-02-15 13:13:32,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 13:13:32,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:13:32,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 13:13:32,395 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:13:32,396 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:13:32,458 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1121 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1122) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1121) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1122 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1122) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-02-15 13:13:32,499 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1122 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1122) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8))) (forall ((v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1121 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1122) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1121) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-02-15 13:13:32,506 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1121 (Array Int Int))) (<= (+ 12 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1122) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1121) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1122 (Array Int Int))) (<= 0 (+ 8 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1122) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2023-02-15 13:13:32,520 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1121 (Array Int Int))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1116))) (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_1115) .cse0 v_ArrVal_1122) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 12) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_1121) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1122 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1115) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1116) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1122) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8)))) is different from false [2023-02-15 13:13:32,530 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1122 (Array Int Int)) (v_ArrVal_1121 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1116))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ 12 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1115) .cse1 v_ArrVal_1122) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1121) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_1116 (Array Int Int)) (v_ArrVal_1115 (Array Int Int)) (v_ArrVal_1122 (Array Int Int))) (<= 0 (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1115) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1116) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1122) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2023-02-15 13:13:32,543 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:13:32,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 39 [2023-02-15 13:13:32,547 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:13:32,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-02-15 13:13:32,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2023-02-15 13:13:32,559 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:13:32,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 186 treesize of output 181 [2023-02-15 13:13:32,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 156 [2023-02-15 13:13:32,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 126 [2023-02-15 13:13:32,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 114 [2023-02-15 13:13:32,666 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:13:32,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 74 [2023-02-15 13:13:32,672 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:13:32,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 50 [2023-02-15 13:13:32,675 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:13:32,675 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:13:32,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 50 [2023-02-15 13:13:32,679 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:13:32,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2023-02-15 13:13:32,687 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-02-15 13:13:32,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-15 13:13:32,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269953015] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:13:32,790 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:13:32,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 30 [2023-02-15 13:13:32,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850813357] [2023-02-15 13:13:32,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:13:32,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-15 13:13:32,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:13:32,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 13:13:32,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=559, Unknown=5, NotChecked=260, Total=930 [2023-02-15 13:13:32,791 INFO L87 Difference]: Start difference. First operand 213 states and 245 transitions. Second operand has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:13:39,819 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:13:41,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 13:14:04,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:04,266 INFO L93 Difference]: Finished difference Result 299 states and 330 transitions. [2023-02-15 13:14:04,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 13:14:04,266 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-02-15 13:14:04,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:04,267 INFO L225 Difference]: With dead ends: 299 [2023-02-15 13:14:04,267 INFO L226 Difference]: Without dead ends: 299 [2023-02-15 13:14:04,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 26.4s TimeCoverageRelationStatistics Valid=326, Invalid=1661, Unknown=13, NotChecked=450, Total=2450 [2023-02-15 13:14:04,268 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 437 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 20 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 663 SdHoareTripleChecker+Invalid, 1691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 687 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:04,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 663 Invalid, 1691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 966 Invalid, 18 Unknown, 687 Unchecked, 5.4s Time] [2023-02-15 13:14:04,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-02-15 13:14:04,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 230. [2023-02-15 13:14:04,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 212 states have (on average 1.2641509433962264) internal successors, (268), 229 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:04,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 268 transitions. [2023-02-15 13:14:04,272 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 268 transitions. Word has length 29 [2023-02-15 13:14:04,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:04,272 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 268 transitions. [2023-02-15 13:14:04,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.7) internal successors, (81), 31 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:04,272 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 268 transitions. [2023-02-15 13:14:04,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 13:14:04,272 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:04,272 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 13:14:04,277 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 13:14:04,482 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:14:04,482 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:14:04,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:04,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1199075445, now seen corresponding path program 1 times [2023-02-15 13:14:04,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:04,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654945502] [2023-02-15 13:14:04,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:04,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:04,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:04,822 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:04,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:04,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654945502] [2023-02-15 13:14:04,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654945502] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:14:04,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048540116] [2023-02-15 13:14:04,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:04,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:14:04,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:14:04,824 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:14:04,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 13:14:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:04,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-15 13:14:04,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:14:04,936 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:14:04,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:14:04,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:04,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:14:04,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:04,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:14:04,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:04,982 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:14:04,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:04,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:14:05,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:05,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:14:05,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:05,065 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:14:05,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:14:05,180 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 13:14:05,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 13 [2023-02-15 13:14:05,191 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:05,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:14:05,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-02-15 13:14:05,746 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-02-15 13:14:05,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1479 treesize of output 1 [2023-02-15 13:14:05,746 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:05,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048540116] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:14:05,747 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:14:05,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 11] total 21 [2023-02-15 13:14:05,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376887619] [2023-02-15 13:14:05,747 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:14:05,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-15 13:14:05,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:05,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-15 13:14:05,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2023-02-15 13:14:05,748 INFO L87 Difference]: Start difference. First operand 230 states and 268 transitions. Second operand has 22 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:06,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:06,648 INFO L93 Difference]: Finished difference Result 255 states and 286 transitions. [2023-02-15 13:14:06,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 13:14:06,648 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 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 30 [2023-02-15 13:14:06,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:06,649 INFO L225 Difference]: With dead ends: 255 [2023-02-15 13:14:06,649 INFO L226 Difference]: Without dead ends: 255 [2023-02-15 13:14:06,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 47 SyntacticMatches, 5 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=347, Invalid=1059, Unknown=0, NotChecked=0, Total=1406 [2023-02-15 13:14:06,650 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 323 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:06,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 396 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:14:06,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2023-02-15 13:14:06,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 216. [2023-02-15 13:14:06,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 200 states have (on average 1.23) internal successors, (246), 215 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:06,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 246 transitions. [2023-02-15 13:14:06,653 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 246 transitions. Word has length 30 [2023-02-15 13:14:06,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:06,653 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 246 transitions. [2023-02-15 13:14:06,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.3333333333333335) internal successors, (70), 22 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:06,653 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 246 transitions. [2023-02-15 13:14:06,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 13:14:06,653 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:06,653 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 13:14:06,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 13:14:06,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:14:06,858 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:14:06,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:06,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1483366933, now seen corresponding path program 1 times [2023-02-15 13:14:06,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:06,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504401056] [2023-02-15 13:14:06,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:06,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:06,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:07,202 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:07,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:07,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504401056] [2023-02-15 13:14:07,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504401056] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:14:07,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052939705] [2023-02-15 13:14:07,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:07,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:14:07,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:14:07,203 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:14:07,205 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 13:14:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:07,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 50 conjunts are in the unsatisfiable core [2023-02-15 13:14:07,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:14:07,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:14:07,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:14:07,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:07,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:14:07,374 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:07,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:14:07,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:07,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:14:07,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:07,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:14:07,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:07,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:14:07,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:07,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:14:07,814 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 13:14:07,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 24 [2023-02-15 13:14:07,965 INFO L321 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2023-02-15 13:14:07,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 24 [2023-02-15 13:14:07,969 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:07,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:14:08,011 INFO L321 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2023-02-15 13:14:08,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2023-02-15 13:14:26,644 INFO L321 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2023-02-15 13:14:26,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 1943069 treesize of output 1 [2023-02-15 13:14:26,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:26,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052939705] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 13:14:26,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 13:14:26,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 23 [2023-02-15 13:14:26,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496100274] [2023-02-15 13:14:26,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 13:14:26,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-15 13:14:26,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 13:14:26,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-15 13:14:26,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=467, Unknown=9, NotChecked=0, Total=552 [2023-02-15 13:14:26,647 INFO L87 Difference]: Start difference. First operand 216 states and 246 transitions. Second operand has 24 states, 23 states have (on average 3.0) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:27,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:14:27,667 INFO L93 Difference]: Finished difference Result 249 states and 275 transitions. [2023-02-15 13:14:27,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 13:14:27,668 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.0) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-15 13:14:27,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:14:27,669 INFO L225 Difference]: With dead ends: 249 [2023-02-15 13:14:27,669 INFO L226 Difference]: Without dead ends: 249 [2023-02-15 13:14:27,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 19.3s TimeCoverageRelationStatistics Valid=259, Invalid=922, Unknown=9, NotChecked=0, Total=1190 [2023-02-15 13:14:27,670 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 425 mSDsluCounter, 641 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 13:14:27,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 698 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 13:14:27,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2023-02-15 13:14:27,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 217. [2023-02-15 13:14:27,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 201 states have (on average 1.2338308457711442) internal successors, (248), 216 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:27,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 248 transitions. [2023-02-15 13:14:27,672 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 248 transitions. Word has length 31 [2023-02-15 13:14:27,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:14:27,673 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 248 transitions. [2023-02-15 13:14:27,673 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.0) internal successors, (69), 24 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 13:14:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 248 transitions. [2023-02-15 13:14:27,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 13:14:27,673 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:14:27,673 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 13:14:27,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-02-15 13:14:27,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:14:27,879 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-02-15 13:14:27,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:14:27,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1483366934, now seen corresponding path program 1 times [2023-02-15 13:14:27,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 13:14:27,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656025358] [2023-02-15 13:14:27,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:27,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 13:14:27,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:28,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:14:28,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 13:14:28,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656025358] [2023-02-15 13:14:28,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656025358] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 13:14:28,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974409214] [2023-02-15 13:14:28,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:14:28,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 13:14:28,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:14:28,263 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 13:14:28,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-15 13:14:28,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:14:28,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 51 conjunts are in the unsatisfiable core [2023-02-15 13:14:28,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:14:28,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:14:28,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:14:28,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:28,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:14:28,429 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:28,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:14:28,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:28,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:14:28,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:28,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:14:28,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:28,510 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:14:28,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:14:28,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:14:28,903 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 13:14:28,903 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 35 [2023-02-15 13:14:28,912 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 13:14:28,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 20 [2023-02-15 13:14:28,916 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 13:14:28,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 13:14:29,120 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:14:29,120 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 62 [2023-02-15 13:15:05,506 INFO L321 Elim1Store]: treesize reduction 120, result has 0.8 percent of original size [2023-02-15 13:15:05,507 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 8 new quantified variables, introduced 15 case distinctions, treesize of input 492145 treesize of output 1 [2023-02-15 13:15:05,525 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 13:15:05,525 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 6788 treesize of output 6580 [2023-02-15 13:15:05,530 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 13:15:05,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4264 treesize of output 4216 [2023-02-15 13:15:05,656 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:15:05,657 INFO L350 Elim1Store]: Elim1 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 5 new quantified variables, introduced 10 case distinctions, treesize of input 216924 treesize of output 201564