./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-circular-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5317dae Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-circular-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c54160550402a2cf6139371c972b70bfa4a53acf207c90f67eed3e784812b38 --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:35:44,403 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:35:44,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:35:44,437 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:35:44,437 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:35:44,440 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:35:44,452 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:35:44,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:35:44,456 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:35:44,457 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:35:44,458 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:35:44,460 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:35:44,460 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:35:44,464 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:35:44,465 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:35:44,467 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:35:44,467 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:35:44,469 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:35:44,470 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:35:44,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:35:44,474 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:35:44,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:35:44,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:35:44,485 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:35:44,492 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:35:44,493 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:35:44,493 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:35:44,494 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:35:44,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:35:44,495 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:35:44,495 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:35:44,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:35:44,496 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:35:44,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:35:44,498 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:35:44,498 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:35:44,498 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:35:44,498 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:35:44,499 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:35:44,500 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:35:44,500 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:35:44,501 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-16 03:35:44,525 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:35:44,526 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:35:44,526 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:35:44,526 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:35:44,527 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:35:44,527 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:35:44,527 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:35:44,528 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:35:44,528 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:35:44,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:35:44,528 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:35:44,529 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:35:44,529 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:35:44,529 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:35:44,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:35:44,529 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:35:44,529 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:35:44,529 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:35:44,530 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:35:44,530 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:35:44,530 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:35:44,530 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:35:44,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:35:44,530 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:35:44,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:35:44,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:35:44,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:35:44,531 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:35:44,531 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:35:44,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:35:44,532 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:35:44,532 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:35:44,532 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:35:44,532 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:35:44,532 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 -> 6c54160550402a2cf6139371c972b70bfa4a53acf207c90f67eed3e784812b38 [2023-02-16 03:35:44,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:35:44,796 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:35:44,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:35:44,799 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:35:44,801 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:35:44,803 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-circular-1.i [2023-02-16 03:35:45,721 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:35:45,966 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:35:45,966 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i [2023-02-16 03:35:45,977 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e23d4940/71944eebb4f3415896c92d47553ac590/FLAG630c1e89a [2023-02-16 03:35:45,990 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e23d4940/71944eebb4f3415896c92d47553ac590 [2023-02-16 03:35:45,992 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:35:45,993 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:35:45,994 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:35:45,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:35:45,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:35:45,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:35:45" (1/1) ... [2023-02-16 03:35:45,997 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@584a4e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:45, skipping insertion in model container [2023-02-16 03:35:45,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:35:45" (1/1) ... [2023-02-16 03:35:46,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:35:46,067 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:35:46,273 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22324,22337] [2023-02-16 03:35:46,278 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22430,22443] [2023-02-16 03:35:46,280 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22555,22568] [2023-02-16 03:35:46,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:35:46,292 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:35:46,331 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22324,22337] [2023-02-16 03:35:46,332 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22430,22443] [2023-02-16 03:35:46,333 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-circular-1.i[22555,22568] [2023-02-16 03:35:46,334 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:35:46,356 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:35:46,356 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:46 WrapperNode [2023-02-16 03:35:46,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:35:46,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:35:46,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:35:46,358 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:35:46,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:46" (1/1) ... [2023-02-16 03:35:46,373 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:46" (1/1) ... [2023-02-16 03:35:46,390 INFO L138 Inliner]: procedures = 119, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 119 [2023-02-16 03:35:46,390 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:35:46,391 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:35:46,391 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:35:46,391 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:35:46,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:46" (1/1) ... [2023-02-16 03:35:46,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:46" (1/1) ... [2023-02-16 03:35:46,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:46" (1/1) ... [2023-02-16 03:35:46,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:46" (1/1) ... [2023-02-16 03:35:46,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:46" (1/1) ... [2023-02-16 03:35:46,424 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:46" (1/1) ... [2023-02-16 03:35:46,431 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:46" (1/1) ... [2023-02-16 03:35:46,432 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:46" (1/1) ... [2023-02-16 03:35:46,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:35:46,434 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:35:46,434 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:35:46,434 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:35:46,435 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:46" (1/1) ... [2023-02-16 03:35:46,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:35:46,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:35:46,485 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-16 03:35:46,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-16 03:35:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-16 03:35:46,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-16 03:35:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:35:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:35:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 03:35:46,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 03:35:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 03:35:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-16 03:35:46,517 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:35:46,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:35:46,608 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:35:46,609 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:35:46,872 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:35:46,877 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:35:46,880 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2023-02-16 03:35:46,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:35:46 BoogieIcfgContainer [2023-02-16 03:35:46,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:35:46,886 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:35:46,886 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:35:46,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:35:46,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:35:45" (1/3) ... [2023-02-16 03:35:46,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11abdc39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:35:46, skipping insertion in model container [2023-02-16 03:35:46,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:35:46" (2/3) ... [2023-02-16 03:35:46,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11abdc39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:35:46, skipping insertion in model container [2023-02-16 03:35:46,893 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:35:46" (3/3) ... [2023-02-16 03:35:46,894 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2023-02-16 03:35:46,905 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:35:46,905 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2023-02-16 03:35:46,933 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:35:46,937 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;@1b928f12, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:35:46,937 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2023-02-16 03:35:46,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 102 states, 55 states have (on average 2.1818181818181817) internal successors, (120), 101 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:46,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-16 03:35:46,944 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:46,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-16 03:35:46,945 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:46,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:46,948 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-16 03:35:46,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:46,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734731670] [2023-02-16 03:35:46,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:46,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:47,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:47,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:47,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:47,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734731670] [2023-02-16 03:35:47,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734731670] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:47,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:47,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:35:47,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86628131] [2023-02-16 03:35:47,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:47,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:35:47,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:47,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:35:47,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:35:47,133 INFO L87 Difference]: Start difference. First operand has 102 states, 55 states have (on average 2.1818181818181817) internal successors, (120), 101 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:47,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:47,248 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2023-02-16 03:35:47,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:35:47,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-16 03:35:47,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:47,257 INFO L225 Difference]: With dead ends: 108 [2023-02-16 03:35:47,258 INFO L226 Difference]: Without dead ends: 106 [2023-02-16 03:35:47,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:35:47,261 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 86 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:47,262 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 77 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:47,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-02-16 03:35:47,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 96. [2023-02-16 03:35:47,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 95 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-16 03:35:47,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2023-02-16 03:35:47,294 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 3 [2023-02-16 03:35:47,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:47,294 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2023-02-16 03:35:47,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:47,295 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2023-02-16 03:35:47,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-16 03:35:47,295 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:47,295 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-16 03:35:47,295 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-16 03:35:47,296 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:47,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:47,296 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-16 03:35:47,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:47,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561772551] [2023-02-16 03:35:47,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:47,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:47,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:47,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:47,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561772551] [2023-02-16 03:35:47,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561772551] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:47,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:47,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:35:47,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624574763] [2023-02-16 03:35:47,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:47,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:35:47,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:47,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:35:47,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:35:47,415 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:47,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:47,493 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2023-02-16 03:35:47,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:35:47,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-16 03:35:47,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:47,495 INFO L225 Difference]: With dead ends: 104 [2023-02-16 03:35:47,495 INFO L226 Difference]: Without dead ends: 104 [2023-02-16 03:35:47,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:35:47,496 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 84 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:47,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 77 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:47,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-16 03:35:47,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 92. [2023-02-16 03:35:47,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 91 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:47,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2023-02-16 03:35:47,506 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 3 [2023-02-16 03:35:47,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:47,507 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2023-02-16 03:35:47,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:47,507 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2023-02-16 03:35:47,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-16 03:35:47,507 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:47,509 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:47,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-16 03:35:47,510 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:47,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:47,510 INFO L85 PathProgramCache]: Analyzing trace with hash 59263652, now seen corresponding path program 1 times [2023-02-16 03:35:47,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:47,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555718175] [2023-02-16 03:35:47,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:47,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:47,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:47,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:47,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555718175] [2023-02-16 03:35:47,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555718175] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:47,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:47,568 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:35:47,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648871956] [2023-02-16 03:35:47,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:47,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:35:47,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:47,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:35:47,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:35:47,569 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:47,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:47,692 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2023-02-16 03:35:47,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:35:47,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2023-02-16 03:35:47,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:47,694 INFO L225 Difference]: With dead ends: 90 [2023-02-16 03:35:47,696 INFO L226 Difference]: Without dead ends: 90 [2023-02-16 03:35:47,696 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-16 03:35:47,697 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 138 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:47,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 52 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:47,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-16 03:35:47,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 81. [2023-02-16 03:35:47,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.6111111111111112) internal successors, (87), 80 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:47,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2023-02-16 03:35:47,711 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 8 [2023-02-16 03:35:47,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:47,711 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2023-02-16 03:35:47,711 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:47,712 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2023-02-16 03:35:47,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-16 03:35:47,712 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:47,712 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:47,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-16 03:35:47,712 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:47,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:47,713 INFO L85 PathProgramCache]: Analyzing trace with hash 59263653, now seen corresponding path program 1 times [2023-02-16 03:35:47,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:47,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874066936] [2023-02-16 03:35:47,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:47,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:47,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:47,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:47,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874066936] [2023-02-16 03:35:47,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874066936] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:47,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:47,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:35:47,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759477785] [2023-02-16 03:35:47,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:47,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:35:47,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:47,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:35:47,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:35:47,889 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:48,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:48,010 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2023-02-16 03:35:48,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:35:48,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2023-02-16 03:35:48,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:48,012 INFO L225 Difference]: With dead ends: 101 [2023-02-16 03:35:48,013 INFO L226 Difference]: Without dead ends: 101 [2023-02-16 03:35:48,014 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-16 03:35:48,015 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 87 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:48,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 97 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:48,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-02-16 03:35:48,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2023-02-16 03:35:48,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 86 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-16 03:35:48,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2023-02-16 03:35:48,032 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 8 [2023-02-16 03:35:48,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:48,033 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2023-02-16 03:35:48,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:48,033 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2023-02-16 03:35:48,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-16 03:35:48,033 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:48,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:48,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-16 03:35:48,034 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:48,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:48,034 INFO L85 PathProgramCache]: Analyzing trace with hash 460324999, now seen corresponding path program 1 times [2023-02-16 03:35:48,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:48,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024468840] [2023-02-16 03:35:48,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:48,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:48,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:48,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:48,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:48,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024468840] [2023-02-16 03:35:48,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024468840] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:48,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:48,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-16 03:35:48,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865034811] [2023-02-16 03:35:48,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:48,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:35:48,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:48,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:35:48,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:35:48,301 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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-16 03:35:48,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:48,477 INFO L93 Difference]: Finished difference Result 170 states and 181 transitions. [2023-02-16 03:35:48,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:35:48,477 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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-16 03:35:48,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:48,478 INFO L225 Difference]: With dead ends: 170 [2023-02-16 03:35:48,478 INFO L226 Difference]: Without dead ends: 170 [2023-02-16 03:35:48,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2023-02-16 03:35:48,479 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 317 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:48,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 293 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:48,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-02-16 03:35:48,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 90. [2023-02-16 03:35:48,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 63 states have (on average 1.5396825396825398) internal successors, (97), 89 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:48,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2023-02-16 03:35:48,500 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 12 [2023-02-16 03:35:48,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:48,500 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2023-02-16 03:35:48,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 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-16 03:35:48,501 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2023-02-16 03:35:48,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-16 03:35:48,501 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:48,501 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:48,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-16 03:35:48,501 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:48,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:48,502 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2023-02-16 03:35:48,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:48,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089091156] [2023-02-16 03:35:48,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:48,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:48,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:48,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:48,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089091156] [2023-02-16 03:35:48,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089091156] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:48,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:48,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:35:48,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427484739] [2023-02-16 03:35:48,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:48,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:35:48,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:48,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:35:48,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:35:48,575 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-16 03:35:48,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:48,697 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2023-02-16 03:35:48,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:35:48,698 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-16 03:35:48,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:48,698 INFO L225 Difference]: With dead ends: 89 [2023-02-16 03:35:48,698 INFO L226 Difference]: Without dead ends: 89 [2023-02-16 03:35:48,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:35:48,699 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 60 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:48,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 183 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:48,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-02-16 03:35:48,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-02-16 03:35:48,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 63 states have (on average 1.5238095238095237) internal successors, (96), 88 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 96 transitions. [2023-02-16 03:35:48,703 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 96 transitions. Word has length 12 [2023-02-16 03:35:48,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:48,703 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 96 transitions. [2023-02-16 03:35:48,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-16 03:35:48,703 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 96 transitions. [2023-02-16 03:35:48,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-16 03:35:48,719 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:48,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:48,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-16 03:35:48,720 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:48,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:48,721 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2023-02-16 03:35:48,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:48,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597359921] [2023-02-16 03:35:48,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:48,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:48,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:48,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:48,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597359921] [2023-02-16 03:35:48,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597359921] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:48,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:48,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:35:48,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302915793] [2023-02-16 03:35:48,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:48,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:35:48,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:48,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:35:48,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:35:48,854 INFO L87 Difference]: Start difference. First operand 89 states and 96 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-16 03:35:49,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:49,004 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2023-02-16 03:35:49,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:35:49,004 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-16 03:35:49,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:49,005 INFO L225 Difference]: With dead ends: 85 [2023-02-16 03:35:49,005 INFO L226 Difference]: Without dead ends: 85 [2023-02-16 03:35:49,005 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-02-16 03:35:49,006 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 22 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 238 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-16 03:35:49,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 238 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:49,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-16 03:35:49,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2023-02-16 03:35:49,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 80 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:49,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2023-02-16 03:35:49,009 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 12 [2023-02-16 03:35:49,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:49,009 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2023-02-16 03:35:49,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 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-16 03:35:49,009 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2023-02-16 03:35:49,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 03:35:49,010 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:49,010 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:49,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-16 03:35:49,010 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:49,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:49,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1385177244, now seen corresponding path program 1 times [2023-02-16 03:35:49,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:49,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739463173] [2023-02-16 03:35:49,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:49,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:49,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:49,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:49,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:49,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739463173] [2023-02-16 03:35:49,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739463173] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:49,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:49,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:35:49,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378089399] [2023-02-16 03:35:49,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:49,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:35:49,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:49,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:35:49,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:35:49,122 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) 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-16 03:35:49,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:49,315 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2023-02-16 03:35:49,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:35:49,315 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) 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-16 03:35:49,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:49,316 INFO L225 Difference]: With dead ends: 124 [2023-02-16 03:35:49,316 INFO L226 Difference]: Without dead ends: 124 [2023-02-16 03:35:49,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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-16 03:35:49,316 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 308 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:49,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 200 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:49,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-02-16 03:35:49,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 83. [2023-02-16 03:35:49,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 62 states have (on average 1.467741935483871) internal successors, (91), 82 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:49,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2023-02-16 03:35:49,319 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 13 [2023-02-16 03:35:49,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:49,320 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2023-02-16 03:35:49,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) 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-16 03:35:49,320 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2023-02-16 03:35:49,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 03:35:49,320 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:49,320 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:49,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-16 03:35:49,321 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:49,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:49,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1385177245, now seen corresponding path program 1 times [2023-02-16 03:35:49,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:49,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130721612] [2023-02-16 03:35:49,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:49,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:49,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:49,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:49,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130721612] [2023-02-16 03:35:49,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130721612] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:49,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:49,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:35:49,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621938001] [2023-02-16 03:35:49,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:49,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:35:49,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:49,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:35:49,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:35:49,611 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) 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-16 03:35:49,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:49,839 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2023-02-16 03:35:49,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:35:49,839 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) 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-16 03:35:49,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:49,840 INFO L225 Difference]: With dead ends: 158 [2023-02-16 03:35:49,840 INFO L226 Difference]: Without dead ends: 158 [2023-02-16 03:35:49,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 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-16 03:35:49,840 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 213 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:49,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 279 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:49,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2023-02-16 03:35:49,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 95. [2023-02-16 03:35:49,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.472972972972973) internal successors, (109), 94 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:49,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 109 transitions. [2023-02-16 03:35:49,864 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 109 transitions. Word has length 13 [2023-02-16 03:35:49,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:49,864 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 109 transitions. [2023-02-16 03:35:49,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) 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-16 03:35:49,865 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2023-02-16 03:35:49,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 03:35:49,865 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:49,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:49,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-16 03:35:49,866 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:49,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:49,867 INFO L85 PathProgramCache]: Analyzing trace with hash -230426379, now seen corresponding path program 1 times [2023-02-16 03:35:49,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:49,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230982412] [2023-02-16 03:35:49,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:49,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:49,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:50,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:50,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:50,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230982412] [2023-02-16 03:35:50,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230982412] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:50,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:50,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-16 03:35:50,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187230166] [2023-02-16 03:35:50,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:50,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 03:35:50,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:50,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 03:35:50,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:35:50,108 INFO L87 Difference]: Start difference. First operand 95 states and 109 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-16 03:35:50,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:50,345 INFO L93 Difference]: Finished difference Result 143 states and 154 transitions. [2023-02-16 03:35:50,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:35:50,345 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-16 03:35:50,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:50,346 INFO L225 Difference]: With dead ends: 143 [2023-02-16 03:35:50,346 INFO L226 Difference]: Without dead ends: 143 [2023-02-16 03:35:50,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2023-02-16 03:35:50,347 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 298 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:50,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 338 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:50,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-02-16 03:35:50,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 95. [2023-02-16 03:35:50,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 94 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-16 03:35:50,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2023-02-16 03:35:50,349 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 16 [2023-02-16 03:35:50,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:50,349 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2023-02-16 03:35:50,349 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-16 03:35:50,349 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2023-02-16 03:35:50,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 03:35:50,349 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:50,349 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:50,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-16 03:35:50,350 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:50,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:50,350 INFO L85 PathProgramCache]: Analyzing trace with hash -230426378, now seen corresponding path program 1 times [2023-02-16 03:35:50,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:50,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46276522] [2023-02-16 03:35:50,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:50,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:50,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:50,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:50,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:50,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46276522] [2023-02-16 03:35:50,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46276522] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:50,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:50,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:35:50,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212917459] [2023-02-16 03:35:50,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:50,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:35:50,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:50,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:35:50,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:35:50,622 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 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-16 03:35:50,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:50,843 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2023-02-16 03:35:50,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:35:50,844 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 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-16 03:35:50,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:50,844 INFO L225 Difference]: With dead ends: 153 [2023-02-16 03:35:50,844 INFO L226 Difference]: Without dead ends: 153 [2023-02-16 03:35:50,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-02-16 03:35:50,845 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 214 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 272 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 272 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:50,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 262 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 272 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:35:50,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2023-02-16 03:35:50,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 95. [2023-02-16 03:35:50,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 74 states have (on average 1.445945945945946) internal successors, (107), 94 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:50,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2023-02-16 03:35:50,847 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 16 [2023-02-16 03:35:50,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:50,847 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2023-02-16 03:35:50,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 8 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-16 03:35:50,847 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2023-02-16 03:35:50,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:35:50,848 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:50,848 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:50,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-16 03:35:50,848 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:50,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:50,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1446702036, now seen corresponding path program 1 times [2023-02-16 03:35:50,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:50,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242105178] [2023-02-16 03:35:50,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:50,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:50,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:50,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:50,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242105178] [2023-02-16 03:35:50,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242105178] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:50,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:50,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:35:50,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145675818] [2023-02-16 03:35:50,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:50,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:35:50,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:50,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:35:50,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:35:50,975 INFO L87 Difference]: Start difference. First operand 95 states and 107 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-16 03:35:51,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:51,134 INFO L93 Difference]: Finished difference Result 134 states and 148 transitions. [2023-02-16 03:35:51,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:35:51,135 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-16 03:35:51,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:51,135 INFO L225 Difference]: With dead ends: 134 [2023-02-16 03:35:51,136 INFO L226 Difference]: Without dead ends: 134 [2023-02-16 03:35:51,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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-16 03:35:51,136 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 282 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:51,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 208 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:51,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-16 03:35:51,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 112. [2023-02-16 03:35:51,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 91 states have (on average 1.5164835164835164) internal successors, (138), 111 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 138 transitions. [2023-02-16 03:35:51,139 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 138 transitions. Word has length 17 [2023-02-16 03:35:51,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:51,139 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 138 transitions. [2023-02-16 03:35:51,139 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-16 03:35:51,140 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 138 transitions. [2023-02-16 03:35:51,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:35:51,140 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:51,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:51,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-16 03:35:51,140 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:51,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:51,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1446702037, now seen corresponding path program 1 times [2023-02-16 03:35:51,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:51,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731233727] [2023-02-16 03:35:51,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:51,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:51,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:51,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:51,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:51,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731233727] [2023-02-16 03:35:51,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731233727] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:51,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:51,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:35:51,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439876308] [2023-02-16 03:35:51,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:51,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:35:51,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:51,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:35:51,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:35:51,329 INFO L87 Difference]: Start difference. First operand 112 states and 138 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-16 03:35:51,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:51,541 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2023-02-16 03:35:51,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:35:51,542 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-16 03:35:51,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:51,542 INFO L225 Difference]: With dead ends: 152 [2023-02-16 03:35:51,542 INFO L226 Difference]: Without dead ends: 152 [2023-02-16 03:35:51,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 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-16 03:35:51,543 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 174 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:51,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 243 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:35:51,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-02-16 03:35:51,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 117. [2023-02-16 03:35:51,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 96 states have (on average 1.4895833333333333) internal successors, (143), 116 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-16 03:35:51,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 143 transitions. [2023-02-16 03:35:51,545 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 143 transitions. Word has length 17 [2023-02-16 03:35:51,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:51,545 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 143 transitions. [2023-02-16 03:35:51,545 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-16 03:35:51,545 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 143 transitions. [2023-02-16 03:35:51,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:35:51,546 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:51,546 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:51,546 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-16 03:35:51,546 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:51,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:51,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1499460812, now seen corresponding path program 1 times [2023-02-16 03:35:51,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:51,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500048583] [2023-02-16 03:35:51,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:51,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:51,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:51,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:51,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:51,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500048583] [2023-02-16 03:35:51,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500048583] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:51,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:51,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:35:51,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375013615] [2023-02-16 03:35:51,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:51,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:35:51,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:51,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:35:51,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:35:51,624 INFO L87 Difference]: Start difference. First operand 117 states and 143 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:51,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:51,700 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2023-02-16 03:35:51,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-16 03:35:51,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-16 03:35:51,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:51,701 INFO L225 Difference]: With dead ends: 119 [2023-02-16 03:35:51,701 INFO L226 Difference]: Without dead ends: 119 [2023-02-16 03:35:51,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-02-16 03:35:51,702 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 17 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:51,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 307 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:35:51,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-16 03:35:51,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2023-02-16 03:35:51,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.4842105263157894) internal successors, (141), 114 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:51,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 141 transitions. [2023-02-16 03:35:51,704 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 141 transitions. Word has length 17 [2023-02-16 03:35:51,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:51,704 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 141 transitions. [2023-02-16 03:35:51,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:51,705 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 141 transitions. [2023-02-16 03:35:51,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-16 03:35:51,705 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:51,705 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] [2023-02-16 03:35:51,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-16 03:35:51,706 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:51,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:51,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1296321320, now seen corresponding path program 1 times [2023-02-16 03:35:51,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:51,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345296978] [2023-02-16 03:35:51,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:51,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:51,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:51,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:51,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:51,823 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345296978] [2023-02-16 03:35:51,823 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345296978] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:51,823 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:51,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:35:51,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6942233] [2023-02-16 03:35:51,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:51,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:35:51,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:51,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:35:51,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:35:51,825 INFO L87 Difference]: Start difference. First operand 115 states and 141 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:51,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:51,953 INFO L93 Difference]: Finished difference Result 146 states and 160 transitions. [2023-02-16 03:35:51,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:35:51,954 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2023-02-16 03:35:51,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:51,954 INFO L225 Difference]: With dead ends: 146 [2023-02-16 03:35:51,954 INFO L226 Difference]: Without dead ends: 146 [2023-02-16 03:35:51,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 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-16 03:35:51,955 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 128 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:51,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 308 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:51,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-02-16 03:35:51,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 116. [2023-02-16 03:35:51,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 96 states have (on average 1.4791666666666667) 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-16 03:35:51,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2023-02-16 03:35:51,957 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 20 [2023-02-16 03:35:51,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:51,957 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2023-02-16 03:35:51,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:51,958 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2023-02-16 03:35:51,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-02-16 03:35:51,958 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:51,958 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] [2023-02-16 03:35:51,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-16 03:35:51,958 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:51,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:51,959 INFO L85 PathProgramCache]: Analyzing trace with hash -852633064, now seen corresponding path program 1 times [2023-02-16 03:35:51,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:51,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488989474] [2023-02-16 03:35:51,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:51,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:51,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:51,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-16 03:35:51,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:51,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488989474] [2023-02-16 03:35:51,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488989474] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:51,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:51,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:35:51,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736932899] [2023-02-16 03:35:51,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:51,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:35:51,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:51,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:35:51,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:35:51,976 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:51,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:51,981 INFO L93 Difference]: Finished difference Result 119 states and 145 transitions. [2023-02-16 03:35:51,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:35:51,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2023-02-16 03:35:51,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:51,982 INFO L225 Difference]: With dead ends: 119 [2023-02-16 03:35:51,982 INFO L226 Difference]: Without dead ends: 119 [2023-02-16 03:35:51,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:35:51,983 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 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-16 03:35:51,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:35:51,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-16 03:35:51,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-02-16 03:35:51,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.4646464646464648) internal successors, (145), 118 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:51,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 145 transitions. [2023-02-16 03:35:51,985 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 145 transitions. Word has length 20 [2023-02-16 03:35:51,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:51,985 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 145 transitions. [2023-02-16 03:35:51,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:51,985 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 145 transitions. [2023-02-16 03:35:51,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-16 03:35:51,986 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:51,986 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-16 03:35:51,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-16 03:35:51,986 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:51,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:51,987 INFO L85 PathProgramCache]: Analyzing trace with hash -661774329, now seen corresponding path program 1 times [2023-02-16 03:35:51,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:51,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627905212] [2023-02-16 03:35:51,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:51,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:52,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:52,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:52,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627905212] [2023-02-16 03:35:52,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627905212] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:52,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:52,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:35:52,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485905422] [2023-02-16 03:35:52,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:52,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:35:52,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:52,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:35:52,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:35:52,021 INFO L87 Difference]: Start difference. First operand 119 states and 145 transitions. Second operand has 5 states, 4 states have (on average 5.25) 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-16 03:35:52,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:52,090 INFO L93 Difference]: Finished difference Result 118 states and 142 transitions. [2023-02-16 03:35:52,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:35:52,091 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) 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-16 03:35:52,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:52,091 INFO L225 Difference]: With dead ends: 118 [2023-02-16 03:35:52,091 INFO L226 Difference]: Without dead ends: 118 [2023-02-16 03:35:52,091 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-16 03:35:52,092 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 29 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:52,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 157 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:52,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-16 03:35:52,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2023-02-16 03:35:52,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.4343434343434343) internal successors, (142), 117 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-16 03:35:52,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 142 transitions. [2023-02-16 03:35:52,094 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 142 transitions. Word has length 21 [2023-02-16 03:35:52,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:52,094 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 142 transitions. [2023-02-16 03:35:52,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) 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-16 03:35:52,094 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 142 transitions. [2023-02-16 03:35:52,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-16 03:35:52,095 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:52,095 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-16 03:35:52,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-16 03:35:52,095 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:52,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:52,096 INFO L85 PathProgramCache]: Analyzing trace with hash -661774328, now seen corresponding path program 1 times [2023-02-16 03:35:52,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:52,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788574111] [2023-02-16 03:35:52,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:52,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:52,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:52,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:52,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:52,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788574111] [2023-02-16 03:35:52,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788574111] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:52,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:52,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-16 03:35:52,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057182590] [2023-02-16 03:35:52,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:52,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:35:52,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:52,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:35:52,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:35:52,321 INFO L87 Difference]: Start difference. First operand 118 states and 142 transitions. Second operand has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 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-16 03:35:52,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:52,616 INFO L93 Difference]: Finished difference Result 138 states and 149 transitions. [2023-02-16 03:35:52,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 03:35:52,616 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 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-16 03:35:52,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:52,617 INFO L225 Difference]: With dead ends: 138 [2023-02-16 03:35:52,618 INFO L226 Difference]: Without dead ends: 138 [2023-02-16 03:35:52,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-02-16 03:35:52,619 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 208 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:52,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 368 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:52,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-02-16 03:35:52,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 118. [2023-02-16 03:35:52,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 99 states have (on average 1.4242424242424243) internal successors, (141), 117 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:52,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 141 transitions. [2023-02-16 03:35:52,621 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 141 transitions. Word has length 21 [2023-02-16 03:35:52,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:52,621 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 141 transitions. [2023-02-16 03:35:52,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 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-16 03:35:52,621 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 141 transitions. [2023-02-16 03:35:52,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-16 03:35:52,625 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:52,625 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-16 03:35:52,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-16 03:35:52,625 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:52,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:52,626 INFO L85 PathProgramCache]: Analyzing trace with hash -2015766217, now seen corresponding path program 1 times [2023-02-16 03:35:52,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:52,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064996711] [2023-02-16 03:35:52,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:52,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:52,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:52,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064996711] [2023-02-16 03:35:52,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064996711] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:52,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:52,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:35:52,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631944892] [2023-02-16 03:35:52,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:52,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:35:52,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:52,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:35:52,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:35:52,657 INFO L87 Difference]: Start difference. First operand 118 states and 141 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-16 03:35:52,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:52,665 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2023-02-16 03:35:52,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:35:52,665 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-16 03:35:52,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:52,667 INFO L225 Difference]: With dead ends: 185 [2023-02-16 03:35:52,667 INFO L226 Difference]: Without dead ends: 185 [2023-02-16 03:35:52,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:35:52,667 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 60 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 145 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-16 03:35:52,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 145 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:35:52,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-02-16 03:35:52,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 131. [2023-02-16 03:35:52,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 112 states have (on average 1.3928571428571428) internal successors, (156), 130 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:52,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 156 transitions. [2023-02-16 03:35:52,670 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 156 transitions. Word has length 21 [2023-02-16 03:35:52,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:52,671 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 156 transitions. [2023-02-16 03:35:52,671 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-16 03:35:52,671 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 156 transitions. [2023-02-16 03:35:52,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 03:35:52,672 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:52,672 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-16 03:35:52,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-16 03:35:52,672 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:52,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:52,672 INFO L85 PathProgramCache]: Analyzing trace with hash -224265605, now seen corresponding path program 1 times [2023-02-16 03:35:52,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:52,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127237381] [2023-02-16 03:35:52,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:52,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:52,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:52,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:52,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127237381] [2023-02-16 03:35:52,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127237381] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:52,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:52,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-16 03:35:52,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279826436] [2023-02-16 03:35:52,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:52,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 03:35:52,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:52,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 03:35:52,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:35:52,934 INFO L87 Difference]: Start difference. First operand 131 states and 156 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-16 03:35:53,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:53,131 INFO L93 Difference]: Finished difference Result 144 states and 158 transitions. [2023-02-16 03:35:53,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:35:53,132 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-16 03:35:53,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:53,132 INFO L225 Difference]: With dead ends: 144 [2023-02-16 03:35:53,132 INFO L226 Difference]: Without dead ends: 140 [2023-02-16 03:35:53,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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-16 03:35:53,133 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 117 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:53,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 273 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:53,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-02-16 03:35:53,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 129. [2023-02-16 03:35:53,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 110 states have (on average 1.3909090909090909) internal successors, (153), 128 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:53,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 153 transitions. [2023-02-16 03:35:53,135 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 153 transitions. Word has length 22 [2023-02-16 03:35:53,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:53,135 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 153 transitions. [2023-02-16 03:35:53,135 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-16 03:35:53,135 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 153 transitions. [2023-02-16 03:35:53,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 03:35:53,135 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:53,135 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-16 03:35:53,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-16 03:35:53,135 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:53,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:53,136 INFO L85 PathProgramCache]: Analyzing trace with hash -222848547, now seen corresponding path program 1 times [2023-02-16 03:35:53,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:53,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401260809] [2023-02-16 03:35:53,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:53,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:53,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:53,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:53,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:53,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401260809] [2023-02-16 03:35:53,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401260809] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:53,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:53,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-16 03:35:53,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711121991] [2023-02-16 03:35:53,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:53,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 03:35:53,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:53,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 03:35:53,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-16 03:35:53,271 INFO L87 Difference]: Start difference. First operand 129 states and 153 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-16 03:35:53,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:53,385 INFO L93 Difference]: Finished difference Result 157 states and 171 transitions. [2023-02-16 03:35:53,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:35:53,385 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-16 03:35:53,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:53,386 INFO L225 Difference]: With dead ends: 157 [2023-02-16 03:35:53,386 INFO L226 Difference]: Without dead ends: 157 [2023-02-16 03:35:53,386 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 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-16 03:35:53,387 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 161 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:53,387 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 210 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:53,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-02-16 03:35:53,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 130. [2023-02-16 03:35:53,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 111 states have (on average 1.3873873873873874) internal successors, (154), 129 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 154 transitions. [2023-02-16 03:35:53,389 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 154 transitions. Word has length 22 [2023-02-16 03:35:53,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:53,389 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 154 transitions. [2023-02-16 03:35:53,389 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-16 03:35:53,389 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 154 transitions. [2023-02-16 03:35:53,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-16 03:35:53,389 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:53,389 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:53,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-16 03:35:53,389 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:53,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:53,390 INFO L85 PathProgramCache]: Analyzing trace with hash -350969464, now seen corresponding path program 1 times [2023-02-16 03:35:53,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:53,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870229693] [2023-02-16 03:35:53,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:53,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:53,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:53,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:53,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870229693] [2023-02-16 03:35:53,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870229693] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:53,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:53,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:35:53,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931445662] [2023-02-16 03:35:53,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:53,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:35:53,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:53,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:35:53,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:35:53,429 INFO L87 Difference]: Start difference. First operand 130 states and 154 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:53,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:53,529 INFO L93 Difference]: Finished difference Result 133 states and 156 transitions. [2023-02-16 03:35:53,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:35:53,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-16 03:35:53,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:53,531 INFO L225 Difference]: With dead ends: 133 [2023-02-16 03:35:53,531 INFO L226 Difference]: Without dead ends: 133 [2023-02-16 03:35:53,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:35:53,531 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 73 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:53,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 154 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:53,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-16 03:35:53,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2023-02-16 03:35:53,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 112 states have (on average 1.3839285714285714) internal successors, (155), 130 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-16 03:35:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 155 transitions. [2023-02-16 03:35:53,533 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 155 transitions. Word has length 23 [2023-02-16 03:35:53,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:53,534 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 155 transitions. [2023-02-16 03:35:53,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:53,534 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 155 transitions. [2023-02-16 03:35:53,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-16 03:35:53,534 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:53,534 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:35:53,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-16 03:35:53,535 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:53,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:53,535 INFO L85 PathProgramCache]: Analyzing trace with hash -350969463, now seen corresponding path program 1 times [2023-02-16 03:35:53,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:53,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699760311] [2023-02-16 03:35:53,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:53,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:53,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:53,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:53,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699760311] [2023-02-16 03:35:53,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699760311] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:35:53,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039142120] [2023-02-16 03:35:53,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:53,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:35:53,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:35:53,812 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:35:53,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-16 03:35:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:53,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-16 03:35:53,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:35:54,038 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-16 03:35:54,041 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-16 03:35:54,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:54,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:35:54,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039142120] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:54,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 03:35:54,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2023-02-16 03:35:54,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853832694] [2023-02-16 03:35:54,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:54,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:35:54,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:54,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:35:54,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2023-02-16 03:35:54,082 INFO L87 Difference]: Start difference. First operand 131 states and 155 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:54,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:54,230 INFO L93 Difference]: Finished difference Result 131 states and 152 transitions. [2023-02-16 03:35:54,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:35:54,230 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-16 03:35:54,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:54,231 INFO L225 Difference]: With dead ends: 131 [2023-02-16 03:35:54,231 INFO L226 Difference]: Without dead ends: 131 [2023-02-16 03:35:54,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2023-02-16 03:35:54,231 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 61 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:54,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 165 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:54,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-16 03:35:54,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2023-02-16 03:35:54,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 112 states have (on average 1.3482142857142858) internal successors, (151), 129 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-16 03:35:54,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 151 transitions. [2023-02-16 03:35:54,233 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 151 transitions. Word has length 23 [2023-02-16 03:35:54,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:54,233 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 151 transitions. [2023-02-16 03:35:54,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:54,234 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 151 transitions. [2023-02-16 03:35:54,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 03:35:54,234 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:54,234 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-16 03:35:54,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-16 03:35:54,434 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,SelfDestructingSolverStorable22 [2023-02-16 03:35:54,434 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:54,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:54,435 INFO L85 PathProgramCache]: Analyzing trace with hash 590917902, now seen corresponding path program 1 times [2023-02-16 03:35:54,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:54,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100009626] [2023-02-16 03:35:54,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:54,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:54,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:54,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:54,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:54,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100009626] [2023-02-16 03:35:54,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100009626] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:54,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:54,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-16 03:35:54,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636882881] [2023-02-16 03:35:54,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:54,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 03:35:54,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:54,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 03:35:54,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2023-02-16 03:35:54,730 INFO L87 Difference]: Start difference. First operand 130 states and 151 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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-16 03:35:54,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:54,954 INFO L93 Difference]: Finished difference Result 146 states and 158 transitions. [2023-02-16 03:35:54,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-16 03:35:54,954 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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-16 03:35:54,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:54,955 INFO L225 Difference]: With dead ends: 146 [2023-02-16 03:35:54,955 INFO L226 Difference]: Without dead ends: 142 [2023-02-16 03:35:54,955 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2023-02-16 03:35:54,955 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 179 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:54,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 374 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:54,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-02-16 03:35:54,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 130. [2023-02-16 03:35:54,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 112 states have (on average 1.3392857142857142) internal successors, (150), 129 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:54,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 150 transitions. [2023-02-16 03:35:54,957 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 150 transitions. Word has length 24 [2023-02-16 03:35:54,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:54,957 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 150 transitions. [2023-02-16 03:35:54,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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-16 03:35:54,957 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2023-02-16 03:35:54,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 03:35:54,957 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:54,958 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-16 03:35:54,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-02-16 03:35:54,958 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:54,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:54,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1019044192, now seen corresponding path program 1 times [2023-02-16 03:35:54,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:54,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618968436] [2023-02-16 03:35:54,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:54,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:55,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:55,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:55,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618968436] [2023-02-16 03:35:55,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618968436] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:55,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:35:55,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-16 03:35:55,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406878435] [2023-02-16 03:35:55,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:55,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-16 03:35:55,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:55,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-16 03:35:55,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-02-16 03:35:55,320 INFO L87 Difference]: Start difference. First operand 130 states and 150 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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-16 03:35:55,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:55,571 INFO L93 Difference]: Finished difference Result 140 states and 152 transitions. [2023-02-16 03:35:55,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 03:35:55,572 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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-16 03:35:55,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:55,572 INFO L225 Difference]: With dead ends: 140 [2023-02-16 03:35:55,572 INFO L226 Difference]: Without dead ends: 140 [2023-02-16 03:35:55,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2023-02-16 03:35:55,573 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 133 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:55,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 410 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:55,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-02-16 03:35:55,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 129. [2023-02-16 03:35:55,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 111 states have (on average 1.3333333333333333) internal successors, (148), 128 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-16 03:35:55,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 148 transitions. [2023-02-16 03:35:55,575 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 148 transitions. Word has length 24 [2023-02-16 03:35:55,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:55,575 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 148 transitions. [2023-02-16 03:35:55,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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-16 03:35:55,575 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 148 transitions. [2023-02-16 03:35:55,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-02-16 03:35:55,575 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:55,575 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] [2023-02-16 03:35:55,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-02-16 03:35:55,575 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:55,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:55,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1710834765, now seen corresponding path program 1 times [2023-02-16 03:35:55,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:55,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649386860] [2023-02-16 03:35:55,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:55,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:55,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:55,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:55,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649386860] [2023-02-16 03:35:55,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649386860] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:35:55,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544384205] [2023-02-16 03:35:55,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:55,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:35:55,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:35:55,734 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:35:55,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-16 03:35:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:55,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-16 03:35:55,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:35:55,823 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:35:55,868 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:35:55,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-16 03:35:55,900 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:35:55,975 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:35:55,975 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-16 03:35:56,006 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:35:56,007 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-16 03:35:56,044 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:35:56,044 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-16 03:35:56,067 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-16 03:35:56,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:56,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:35:56,084 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_592 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_592) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-16 03:35:56,107 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_592 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_592) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-16 03:35:56,111 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_592 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_592) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2023-02-16 03:35:56,118 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:35:56,118 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 19 treesize of output 20 [2023-02-16 03:35:56,125 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:35:56,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2023-02-16 03:35:56,128 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 18 [2023-02-16 03:35:56,220 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-16 03:35:56,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544384205] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:35:56,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:35:56,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 23 [2023-02-16 03:35:56,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724132197] [2023-02-16 03:35:56,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:35:56,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-16 03:35:56,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:56,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-16 03:35:56,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=319, Unknown=3, NotChecked=114, Total=506 [2023-02-16 03:35:56,222 INFO L87 Difference]: Start difference. First operand 129 states and 148 transitions. Second operand has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:56,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:56,775 INFO L93 Difference]: Finished difference Result 242 states and 262 transitions. [2023-02-16 03:35:56,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-16 03:35:56,775 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 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-16 03:35:56,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:56,776 INFO L225 Difference]: With dead ends: 242 [2023-02-16 03:35:56,776 INFO L226 Difference]: Without dead ends: 242 [2023-02-16 03:35:56,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=208, Invalid=729, Unknown=5, NotChecked=180, Total=1122 [2023-02-16 03:35:56,776 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 315 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 10 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 1095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 357 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:56,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 702 Invalid, 1095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 726 Invalid, 2 Unknown, 357 Unchecked, 0.3s Time] [2023-02-16 03:35:56,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-02-16 03:35:56,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 151. [2023-02-16 03:35:56,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 133 states have (on average 1.300751879699248) internal successors, (173), 150 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:56,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 173 transitions. [2023-02-16 03:35:56,779 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 173 transitions. Word has length 24 [2023-02-16 03:35:56,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:56,779 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 173 transitions. [2023-02-16 03:35:56,779 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.739130434782609) internal successors, (63), 23 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:56,779 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 173 transitions. [2023-02-16 03:35:56,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 03:35:56,779 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:56,779 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] [2023-02-16 03:35:56,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-16 03:35:56,984 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,SelfDestructingSolverStorable25 [2023-02-16 03:35:56,985 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:56,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:56,985 INFO L85 PathProgramCache]: Analyzing trace with hash 2020763981, now seen corresponding path program 1 times [2023-02-16 03:35:56,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:56,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525762049] [2023-02-16 03:35:56,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:56,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:57,176 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-16 03:35:57,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:57,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525762049] [2023-02-16 03:35:57,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525762049] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:35:57,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [579923234] [2023-02-16 03:35:57,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:57,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:35:57,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:35:57,178 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:35:57,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-16 03:35:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:57,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-16 03:35:57,251 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:35:57,321 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-16 03:35:57,324 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-16 03:35:57,352 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-16 03:35:57,364 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-16 03:35:57,365 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:35:57,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [579923234] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:35:57,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-16 03:35:57,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2023-02-16 03:35:57,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540581539] [2023-02-16 03:35:57,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:35:57,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-16 03:35:57,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:35:57,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-16 03:35:57,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2023-02-16 03:35:57,367 INFO L87 Difference]: Start difference. First operand 151 states and 173 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:57,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:35:57,590 INFO L93 Difference]: Finished difference Result 169 states and 192 transitions. [2023-02-16 03:35:57,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:35:57,590 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-16 03:35:57,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:35:57,591 INFO L225 Difference]: With dead ends: 169 [2023-02-16 03:35:57,591 INFO L226 Difference]: Without dead ends: 169 [2023-02-16 03:35:57,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2023-02-16 03:35:57,592 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 33 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:35:57,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 304 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-16 03:35:57,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2023-02-16 03:35:57,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 164. [2023-02-16 03:35:57,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 146 states have (on average 1.2876712328767124) internal successors, (188), 163 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:57,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 188 transitions. [2023-02-16 03:35:57,594 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 188 transitions. Word has length 25 [2023-02-16 03:35:57,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:35:57,594 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 188 transitions. [2023-02-16 03:35:57,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:35:57,595 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 188 transitions. [2023-02-16 03:35:57,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 03:35:57,595 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:35:57,595 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] [2023-02-16 03:35:57,601 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-16 03:35:57,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:35:57,800 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:35:57,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:35:57,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1496266000, now seen corresponding path program 1 times [2023-02-16 03:35:57,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:35:57,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240359146] [2023-02-16 03:35:57,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:57,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:35:57,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:58,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:58,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:35:58,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240359146] [2023-02-16 03:35:58,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240359146] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:35:58,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726549814] [2023-02-16 03:35:58,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:35:58,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:35:58,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:35:58,047 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:35:58,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-16 03:35:58,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:35:58,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-16 03:35:58,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:35:58,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:35:58,183 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-16 03:35:58,184 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-16 03:35:58,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:35:58,301 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:35:58,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-16 03:35:58,333 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:35:58,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-16 03:35:58,383 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:35:58,384 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 28 treesize of output 29 [2023-02-16 03:35:58,406 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-16 03:35:58,456 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:35:58,456 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:36:00,536 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_719 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_719) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2023-02-16 03:36:00,570 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:00,571 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 20 treesize of output 21 [2023-02-16 03:36:00,576 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:00,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2023-02-16 03:36:00,580 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 7 treesize of output 5 [2023-02-16 03:36:04,740 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:04,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726549814] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:36:04,742 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:36:04,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2023-02-16 03:36:04,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455134900] [2023-02-16 03:36:04,742 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:36:04,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-16 03:36:04,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:36:04,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-16 03:36:04,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=475, Unknown=16, NotChecked=46, Total=650 [2023-02-16 03:36:04,744 INFO L87 Difference]: Start difference. First operand 164 states and 188 transitions. Second operand has 26 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:36:05,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:36:05,519 INFO L93 Difference]: Finished difference Result 257 states and 285 transitions. [2023-02-16 03:36:05,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-16 03:36:05,519 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-16 03:36:05,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:36:05,520 INFO L225 Difference]: With dead ends: 257 [2023-02-16 03:36:05,520 INFO L226 Difference]: Without dead ends: 257 [2023-02-16 03:36:05,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=329, Invalid=1134, Unknown=23, NotChecked=74, Total=1560 [2023-02-16 03:36:05,521 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 558 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 558 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:36:05,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [558 Valid, 550 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 808 Invalid, 0 Unknown, 193 Unchecked, 0.5s Time] [2023-02-16 03:36:05,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2023-02-16 03:36:05,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 166. [2023-02-16 03:36:05,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 148 states have (on average 1.2905405405405406) internal successors, (191), 165 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:36:05,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 191 transitions. [2023-02-16 03:36:05,523 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 191 transitions. Word has length 25 [2023-02-16 03:36:05,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:36:05,523 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 191 transitions. [2023-02-16 03:36:05,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.72) internal successors, (68), 26 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:36:05,523 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 191 transitions. [2023-02-16 03:36:05,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-16 03:36:05,524 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:36:05,524 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] [2023-02-16 03:36:05,529 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-16 03:36:05,724 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2023-02-16 03:36:05,724 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:36:05,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:36:05,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1496265999, now seen corresponding path program 1 times [2023-02-16 03:36:05,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:36:05,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577637288] [2023-02-16 03:36:05,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:05,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:36:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:05,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:05,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:36:05,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577637288] [2023-02-16 03:36:05,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577637288] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:36:05,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033724956] [2023-02-16 03:36:05,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:05,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:36:05,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:36:06,001 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-16 03:36:06,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-16 03:36:06,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:06,090 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 42 conjunts are in the unsatisfiable core [2023-02-16 03:36:06,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:36:06,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:36:06,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:36:06,151 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:36:06,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-16 03:36:06,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:36:06,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:36:06,280 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:06,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-16 03:36:06,288 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:36:06,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-16 03:36:06,316 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:36:06,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-16 03:36:06,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-16 03:36:06,330 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:06,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2023-02-16 03:36:06,389 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:36:06,389 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-16 03:36:06,395 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-16 03:36:06,419 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-16 03:36:06,421 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-16 03:36:06,463 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:06,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:36:06,671 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_811 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_811) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4))) (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_811 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_811) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_810) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2023-02-16 03:36:06,678 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_811 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_811) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4))) (forall ((v_ArrVal_810 (Array Int Int)) (v_ArrVal_811 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_811) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_810) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2023-02-16 03:36:06,687 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:06,688 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 20 treesize of output 21 [2023-02-16 03:36:06,693 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:06,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 37 [2023-02-16 03:36:06,695 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 7 treesize of output 5 [2023-02-16 03:36:06,709 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:06,709 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 38 [2023-02-16 03:36:06,714 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:06,714 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 29 treesize of output 30 [2023-02-16 03:36:06,715 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:36:06,717 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 27 treesize of output 19 [2023-02-16 03:36:06,719 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:36:06,720 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 20 treesize of output 12 [2023-02-16 03:36:06,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:06,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1033724956] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:36:06,822 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-16 03:36:06,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 28 [2023-02-16 03:36:06,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036624189] [2023-02-16 03:36:06,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-16 03:36:06,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-16 03:36:06,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-16 03:36:06,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-16 03:36:06,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=603, Unknown=16, NotChecked=102, Total=812 [2023-02-16 03:36:06,823 INFO L87 Difference]: Start difference. First operand 166 states and 191 transitions. Second operand has 29 states, 28 states have (on average 2.607142857142857) internal successors, (73), 29 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:36:07,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:36:07,913 INFO L93 Difference]: Finished difference Result 251 states and 281 transitions. [2023-02-16 03:36:07,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-16 03:36:07,914 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.607142857142857) internal successors, (73), 29 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-16 03:36:07,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:36:07,914 INFO L225 Difference]: With dead ends: 251 [2023-02-16 03:36:07,914 INFO L226 Difference]: Without dead ends: 251 [2023-02-16 03:36:07,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=321, Invalid=1557, Unknown=22, NotChecked=170, Total=2070 [2023-02-16 03:36:07,916 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 460 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 889 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 283 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:36:07,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 533 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 889 Invalid, 0 Unknown, 283 Unchecked, 0.5s Time] [2023-02-16 03:36:07,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2023-02-16 03:36:07,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 181. [2023-02-16 03:36:07,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 163 states have (on average 1.294478527607362) internal successors, (211), 180 states have internal predecessors, (211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:36:07,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 211 transitions. [2023-02-16 03:36:07,919 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 211 transitions. Word has length 25 [2023-02-16 03:36:07,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:36:07,919 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 211 transitions. [2023-02-16 03:36:07,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.607142857142857) internal successors, (73), 29 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-16 03:36:07,919 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 211 transitions. [2023-02-16 03:36:07,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-16 03:36:07,919 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:36:07,919 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-16 03:36:07,934 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-16 03:36:08,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-02-16 03:36:08,132 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2023-02-16 03:36:08,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:36:08,132 INFO L85 PathProgramCache]: Analyzing trace with hash -2089730527, now seen corresponding path program 1 times [2023-02-16 03:36:08,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-16 03:36:08,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154446299] [2023-02-16 03:36:08,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:08,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-16 03:36:08,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:08,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-16 03:36:08,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-16 03:36:08,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154446299] [2023-02-16 03:36:08,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154446299] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:36:08,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288036237] [2023-02-16 03:36:08,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:36:08,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-16 03:36:08,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:36:08,408 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-16 03:36:08,409 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-16 03:36:08,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:36:08,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-16 03:36:08,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:36:08,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-16 03:36:08,552 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-16 03:36:08,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-16 03:36:08,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:36:08,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:36:08,689 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:36:08,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2023-02-16 03:36:08,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:36:08,704 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:36:08,711 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:36:08,711 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 27 treesize of output 22 [2023-02-16 03:36:08,794 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:36:08,794 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2023-02-16 03:36:08,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-16 03:36:08,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:36:08,810 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:36:08,812 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:36:08,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 34 [2023-02-16 03:36:08,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:36:08,896 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:36:08,898 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:36:08,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 48 [2023-02-16 03:36:08,903 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 40 treesize of output 38 [2023-02-16 03:36:08,935 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 37 treesize of output 21 [2023-02-16 03:36:09,036 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:36:09,038 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-16 03:36:09,038 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 31 treesize of output 14 [2023-02-16 03:36:09,047 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:36:09,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:36:09,070 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_903 (Array Int Int)) (v_ArrVal_904 Int)) (= (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 4) v_ArrVal_904)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_903) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) 1)) is different from false [2023-02-16 03:36:09,257 INFO L321 Elim1Store]: treesize reduction 78, result has 48.0 percent of original size [2023-02-16 03:36:09,257 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 6 new quantified variables, introduced 10 case distinctions, treesize of input 23809 treesize of output 22140 [2023-02-16 03:36:09,408 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:09,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 22071 treesize of output 22109 [2023-02-16 03:36:09,438 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:09,439 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 21904 treesize of output 21408 [2023-02-16 03:36:09,489 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:36:09,490 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 29111 treesize of output 21998 [2023-02-16 03:36:09,503 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 21979 treesize of output 21853