./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/tree_stack.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e8d55036 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/memsafety-ext/tree_stack.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 882715956aab9fc92fb711e54ed51d64e792658e5015ed6151f84b857454f04c --- Real Ultimate output --- This is Ultimate 0.2.2-?-e8d5503-m [2023-02-15 21:59:51,403 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 21:59:51,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 21:59:51,435 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 21:59:51,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 21:59:51,438 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 21:59:51,439 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 21:59:51,441 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 21:59:51,443 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 21:59:51,446 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 21:59:51,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 21:59:51,449 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 21:59:51,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 21:59:51,450 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 21:59:51,451 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 21:59:51,452 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 21:59:51,453 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 21:59:51,454 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 21:59:51,455 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 21:59:51,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 21:59:51,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 21:59:51,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 21:59:51,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 21:59:51,461 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 21:59:51,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 21:59:51,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 21:59:51,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 21:59:51,478 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 21:59:51,479 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 21:59:51,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 21:59:51,480 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 21:59:51,481 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 21:59:51,482 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 21:59:51,482 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 21:59:51,483 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 21:59:51,483 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 21:59:51,484 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 21:59:51,484 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 21:59:51,484 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 21:59:51,485 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 21:59:51,486 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 21:59:51,486 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 21:59:51,510 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 21:59:51,510 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 21:59:51,510 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 21:59:51,511 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 21:59:51,511 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 21:59:51,511 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 21:59:51,512 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 21:59:51,512 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 21:59:51,512 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 21:59:51,512 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 21:59:51,513 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 21:59:51,513 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 21:59:51,513 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 21:59:51,513 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 21:59:51,514 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 21:59:51,514 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 21:59:51,514 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 21:59:51,514 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 21:59:51,514 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 21:59:51,514 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 21:59:51,514 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 21:59:51,515 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 21:59:51,515 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 21:59:51,515 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 21:59:51,515 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 21:59:51,515 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:59:51,515 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 21:59:51,515 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 21:59:51,516 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 21:59:51,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 21:59:51,516 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 21:59:51,516 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 21:59:51,516 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 21:59:51,517 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 21:59:51,517 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 -> 882715956aab9fc92fb711e54ed51d64e792658e5015ed6151f84b857454f04c [2023-02-15 21:59:51,700 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 21:59:51,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 21:59:51,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 21:59:51,717 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 21:59:51,717 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 21:59:51,718 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_stack.i [2023-02-15 21:59:52,662 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 21:59:52,856 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 21:59:52,861 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_stack.i [2023-02-15 21:59:52,878 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe1c569d1/5d08f18375ad4e5895daf5c7defcb665/FLAG3bcd96fa0 [2023-02-15 21:59:52,889 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe1c569d1/5d08f18375ad4e5895daf5c7defcb665 [2023-02-15 21:59:52,891 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 21:59:52,892 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 21:59:52,893 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 21:59:52,893 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 21:59:52,895 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 21:59:52,896 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:59:52" (1/1) ... [2023-02-15 21:59:52,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52fab757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:52, skipping insertion in model container [2023-02-15 21:59:52,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:59:52" (1/1) ... [2023-02-15 21:59:52,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 21:59:52,938 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 21:59:53,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:59:53,167 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 21:59:53,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:59:53,217 INFO L208 MainTranslator]: Completed translation [2023-02-15 21:59:53,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:53 WrapperNode [2023-02-15 21:59:53,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 21:59:53,218 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 21:59:53,218 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 21:59:53,219 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 21:59:53,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:53" (1/1) ... [2023-02-15 21:59:53,232 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:53" (1/1) ... [2023-02-15 21:59:53,245 INFO L138 Inliner]: procedures = 123, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 142 [2023-02-15 21:59:53,245 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 21:59:53,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 21:59:53,246 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 21:59:53,246 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 21:59:53,251 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:53" (1/1) ... [2023-02-15 21:59:53,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:53" (1/1) ... [2023-02-15 21:59:53,254 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:53" (1/1) ... [2023-02-15 21:59:53,259 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:53" (1/1) ... [2023-02-15 21:59:53,264 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:53" (1/1) ... [2023-02-15 21:59:53,274 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:53" (1/1) ... [2023-02-15 21:59:53,283 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:53" (1/1) ... [2023-02-15 21:59:53,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:53" (1/1) ... [2023-02-15 21:59:53,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 21:59:53,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 21:59:53,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 21:59:53,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 21:59:53,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:53" (1/1) ... [2023-02-15 21:59:53,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:59:53,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 21:59:53,316 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 21:59:53,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 21:59:53,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 21:59:53,342 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 21:59:53,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 21:59:53,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 21:59:53,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 21:59:53,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-15 21:59:53,343 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 21:59:53,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 21:59:53,432 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 21:59:53,434 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 21:59:53,830 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 21:59:53,835 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 21:59:53,836 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-15 21:59:53,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:59:53 BoogieIcfgContainer [2023-02-15 21:59:53,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 21:59:53,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 21:59:53,839 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 21:59:53,841 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 21:59:53,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 09:59:52" (1/3) ... [2023-02-15 21:59:53,845 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74caf724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:59:53, skipping insertion in model container [2023-02-15 21:59:53,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:53" (2/3) ... [2023-02-15 21:59:53,846 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74caf724 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 09:59:53, skipping insertion in model container [2023-02-15 21:59:53,846 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 09:59:53" (3/3) ... [2023-02-15 21:59:53,847 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_stack.i [2023-02-15 21:59:53,858 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 21:59:53,858 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2023-02-15 21:59:53,890 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 21:59:53,894 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;@228b39d2, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 21:59:53,894 INFO L358 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2023-02-15 21:59:53,897 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 70 states have (on average 2.157142857142857) internal successors, (151), 137 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:53,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 21:59:53,900 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:53,901 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 21:59:53,901 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 21:59:53,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:53,904 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2023-02-15 21:59:53,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:53,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664800879] [2023-02-15 21:59:53,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:53,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:53,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:54,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:54,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:54,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664800879] [2023-02-15 21:59:54,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664800879] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:54,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:54,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:59:54,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556103813] [2023-02-15 21:59:54,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:54,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:59:54,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:54,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:59:54,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:59:54,047 INFO L87 Difference]: Start difference. First operand has 138 states, 70 states have (on average 2.157142857142857) internal successors, (151), 137 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:54,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:54,173 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2023-02-15 21:59:54,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:59:54,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-15 21:59:54,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:54,183 INFO L225 Difference]: With dead ends: 156 [2023-02-15 21:59:54,184 INFO L226 Difference]: Without dead ends: 152 [2023-02-15 21:59:54,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:59:54,190 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 104 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:54,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 122 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:59:54,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-02-15 21:59:54,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 134. [2023-02-15 21:59:54,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 133 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:54,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2023-02-15 21:59:54,224 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 3 [2023-02-15 21:59:54,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:54,224 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2023-02-15 21:59:54,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:54,224 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2023-02-15 21:59:54,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-02-15 21:59:54,225 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:54,225 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-02-15 21:59:54,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-15 21:59:54,225 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 21:59:54,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:54,226 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2023-02-15 21:59:54,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:54,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526861861] [2023-02-15 21:59:54,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:54,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:54,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:54,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:54,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:54,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526861861] [2023-02-15 21:59:54,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526861861] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:54,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:54,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:59:54,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212543534] [2023-02-15 21:59:54,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:54,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:59:54,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:54,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:59:54,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:59:54,323 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:54,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:54,412 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2023-02-15 21:59:54,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:59:54,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-02-15 21:59:54,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:54,413 INFO L225 Difference]: With dead ends: 132 [2023-02-15 21:59:54,413 INFO L226 Difference]: Without dead ends: 132 [2023-02-15 21:59:54,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:59:54,415 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 135 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:54,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 78 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:59:54,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-02-15 21:59:54,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2023-02-15 21:59:54,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 131 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:54,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2023-02-15 21:59:54,420 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 3 [2023-02-15 21:59:54,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:54,421 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2023-02-15 21:59:54,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:54,421 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2023-02-15 21:59:54,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 21:59:54,421 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:54,421 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:54,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-15 21:59:54,422 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 21:59:54,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:54,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1803031021, now seen corresponding path program 1 times [2023-02-15 21:59:54,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:54,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416864097] [2023-02-15 21:59:54,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:54,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:54,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:54,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:54,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416864097] [2023-02-15 21:59:54,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416864097] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:54,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:54,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:59:54,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629614496] [2023-02-15 21:59:54,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:54,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 21:59:54,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:54,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 21:59:54,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:59:54,473 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:54,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:54,579 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2023-02-15 21:59:54,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 21:59:54,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2023-02-15 21:59:54,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:54,580 INFO L225 Difference]: With dead ends: 140 [2023-02-15 21:59:54,580 INFO L226 Difference]: Without dead ends: 140 [2023-02-15 21:59:54,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:59:54,582 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 174 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:54,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 96 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:59:54,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-02-15 21:59:54,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 118. [2023-02-15 21:59:54,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 70 states have (on average 1.8428571428571427) internal successors, (129), 117 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:54,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2023-02-15 21:59:54,588 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 7 [2023-02-15 21:59:54,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:54,588 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2023-02-15 21:59:54,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:54,588 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2023-02-15 21:59:54,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 21:59:54,589 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:54,589 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:54,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-15 21:59:54,589 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 21:59:54,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:54,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1803031022, now seen corresponding path program 1 times [2023-02-15 21:59:54,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:54,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987367194] [2023-02-15 21:59:54,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:54,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:54,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:54,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:54,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:54,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987367194] [2023-02-15 21:59:54,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987367194] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:54,697 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:54,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:59:54,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854609633] [2023-02-15 21:59:54,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:54,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 21:59:54,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:54,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 21:59:54,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 21:59:54,698 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:54,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:54,855 INFO L93 Difference]: Finished difference Result 163 states and 181 transitions. [2023-02-15 21:59:54,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 21:59:54,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2023-02-15 21:59:54,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:54,858 INFO L225 Difference]: With dead ends: 163 [2023-02-15 21:59:54,858 INFO L226 Difference]: Without dead ends: 163 [2023-02-15 21:59:54,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:59:54,867 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 213 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:54,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 116 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:59:54,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-02-15 21:59:54,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 148. [2023-02-15 21:59:54,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 100 states have (on average 1.71) internal successors, (171), 147 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:54,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 171 transitions. [2023-02-15 21:59:54,880 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 171 transitions. Word has length 7 [2023-02-15 21:59:54,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:54,881 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 171 transitions. [2023-02-15 21:59:54,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:54,882 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 171 transitions. [2023-02-15 21:59:54,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 21:59:54,882 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:54,882 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:54,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-15 21:59:54,883 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 21:59:54,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:54,883 INFO L85 PathProgramCache]: Analyzing trace with hash 59388299, now seen corresponding path program 1 times [2023-02-15 21:59:54,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:54,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585231399] [2023-02-15 21:59:54,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:54,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:54,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:54,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:54,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:54,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585231399] [2023-02-15 21:59:54,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585231399] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:54,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:54,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:59:54,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98958955] [2023-02-15 21:59:54,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:54,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:59:54,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:54,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:59:54,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:59:54,923 INFO L87 Difference]: Start difference. First operand 148 states and 171 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-15 21:59:54,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:54,975 INFO L93 Difference]: Finished difference Result 152 states and 175 transitions. [2023-02-15 21:59:54,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:59:54,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-15 21:59:54,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:54,976 INFO L225 Difference]: With dead ends: 152 [2023-02-15 21:59:54,976 INFO L226 Difference]: Without dead ends: 152 [2023-02-15 21:59:54,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:59:54,980 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 10 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:54,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 180 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:59:54,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-02-15 21:59:54,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2023-02-15 21:59:54,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 102 states have (on average 1.696078431372549) internal successors, (173), 147 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-15 21:59:54,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions. [2023-02-15 21:59:54,993 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 8 [2023-02-15 21:59:54,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:54,995 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 173 transitions. [2023-02-15 21:59:54,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-15 21:59:54,996 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2023-02-15 21:59:54,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 21:59:54,996 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:54,997 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:54,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-15 21:59:54,997 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 21:59:55,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:55,001 INFO L85 PathProgramCache]: Analyzing trace with hash 59388300, now seen corresponding path program 1 times [2023-02-15 21:59:55,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:55,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106599405] [2023-02-15 21:59:55,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:55,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:55,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:55,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:55,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:55,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106599405] [2023-02-15 21:59:55,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106599405] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:55,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:55,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 21:59:55,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817141178] [2023-02-15 21:59:55,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:55,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:59:55,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:55,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:59:55,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:59:55,067 INFO L87 Difference]: Start difference. First operand 148 states and 173 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-15 21:59:55,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:55,123 INFO L93 Difference]: Finished difference Result 150 states and 173 transitions. [2023-02-15 21:59:55,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:59:55,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-15 21:59:55,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:55,124 INFO L225 Difference]: With dead ends: 150 [2023-02-15 21:59:55,132 INFO L226 Difference]: Without dead ends: 150 [2023-02-15 21:59:55,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:59:55,133 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 7 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:55,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 172 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:59:55,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-15 21:59:55,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2023-02-15 21:59:55,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 102 states have (on average 1.6666666666666667) internal successors, (170), 145 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:55,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 170 transitions. [2023-02-15 21:59:55,137 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 170 transitions. Word has length 8 [2023-02-15 21:59:55,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:55,137 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 170 transitions. [2023-02-15 21:59:55,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 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-15 21:59:55,138 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 170 transitions. [2023-02-15 21:59:55,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 21:59:55,138 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:55,138 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:55,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-02-15 21:59:55,139 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 21:59:55,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:55,139 INFO L85 PathProgramCache]: Analyzing trace with hash -387876619, now seen corresponding path program 1 times [2023-02-15 21:59:55,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:55,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408028396] [2023-02-15 21:59:55,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:55,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:55,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:55,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:55,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:55,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408028396] [2023-02-15 21:59:55,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408028396] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:55,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:55,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:59:55,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428349891] [2023-02-15 21:59:55,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:55,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:59:55,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:55,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:59:55,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:59:55,180 INFO L87 Difference]: Start difference. First operand 146 states and 170 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:55,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:55,193 INFO L93 Difference]: Finished difference Result 147 states and 170 transitions. [2023-02-15 21:59:55,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:59:55,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-15 21:59:55,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:55,194 INFO L225 Difference]: With dead ends: 147 [2023-02-15 21:59:55,194 INFO L226 Difference]: Without dead ends: 147 [2023-02-15 21:59:55,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:59:55,195 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 2 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:55,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 228 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:59:55,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-02-15 21:59:55,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2023-02-15 21:59:55,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 102 states have (on average 1.6568627450980393) internal successors, (169), 145 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:55,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 169 transitions. [2023-02-15 21:59:55,203 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 169 transitions. Word has length 12 [2023-02-15 21:59:55,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:55,203 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 169 transitions. [2023-02-15 21:59:55,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:55,204 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 169 transitions. [2023-02-15 21:59:55,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 21:59:55,204 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:55,204 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:55,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-02-15 21:59:55,205 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 21:59:55,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:55,205 INFO L85 PathProgramCache]: Analyzing trace with hash 860725951, now seen corresponding path program 1 times [2023-02-15 21:59:55,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:55,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72649482] [2023-02-15 21:59:55,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:55,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:55,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:55,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:55,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72649482] [2023-02-15 21:59:55,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72649482] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:55,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:55,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:59:55,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946278099] [2023-02-15 21:59:55,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:55,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:59:55,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:55,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:59:55,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:59:55,288 INFO L87 Difference]: Start difference. First operand 146 states and 169 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:55,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:55,383 INFO L93 Difference]: Finished difference Result 159 states and 183 transitions. [2023-02-15 21:59:55,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 21:59:55,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-15 21:59:55,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:55,384 INFO L225 Difference]: With dead ends: 159 [2023-02-15 21:59:55,384 INFO L226 Difference]: Without dead ends: 159 [2023-02-15 21:59:55,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:59:55,385 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 56 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:55,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 216 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:59:55,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2023-02-15 21:59:55,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 143. [2023-02-15 21:59:55,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 104 states have (on average 1.6057692307692308) internal successors, (167), 142 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:55,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 167 transitions. [2023-02-15 21:59:55,390 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 167 transitions. Word has length 13 [2023-02-15 21:59:55,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:55,391 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 167 transitions. [2023-02-15 21:59:55,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:55,391 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 167 transitions. [2023-02-15 21:59:55,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 21:59:55,392 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:55,392 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:55,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-02-15 21:59:55,393 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 21:59:55,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:55,393 INFO L85 PathProgramCache]: Analyzing trace with hash 860725952, now seen corresponding path program 1 times [2023-02-15 21:59:55,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:55,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022307211] [2023-02-15 21:59:55,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:55,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:55,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:55,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:55,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:55,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022307211] [2023-02-15 21:59:55,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022307211] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:55,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:55,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 21:59:55,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503982779] [2023-02-15 21:59:55,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:55,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 21:59:55,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:55,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 21:59:55,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-02-15 21:59:55,506 INFO L87 Difference]: Start difference. First operand 143 states and 167 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:55,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:55,661 INFO L93 Difference]: Finished difference Result 182 states and 208 transitions. [2023-02-15 21:59:55,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 21:59:55,661 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-15 21:59:55,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:55,662 INFO L225 Difference]: With dead ends: 182 [2023-02-15 21:59:55,662 INFO L226 Difference]: Without dead ends: 182 [2023-02-15 21:59:55,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:59:55,663 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 52 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:55,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 314 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:59:55,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-15 21:59:55,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 150. [2023-02-15 21:59:55,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 115 states have (on average 1.565217391304348) internal successors, (180), 149 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:55,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 180 transitions. [2023-02-15 21:59:55,666 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 180 transitions. Word has length 13 [2023-02-15 21:59:55,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:55,666 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 180 transitions. [2023-02-15 21:59:55,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:55,666 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 180 transitions. [2023-02-15 21:59:55,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 21:59:55,667 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:55,667 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:55,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-15 21:59:55,667 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 21:59:55,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:55,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1836248265, now seen corresponding path program 1 times [2023-02-15 21:59:55,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:55,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686458111] [2023-02-15 21:59:55,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:55,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:55,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:55,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:55,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686458111] [2023-02-15 21:59:55,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686458111] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:55,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:55,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 21:59:55,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489189808] [2023-02-15 21:59:55,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:55,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 21:59:55,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:55,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 21:59:55,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:59:55,686 INFO L87 Difference]: Start difference. First operand 150 states and 180 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:55,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:55,691 INFO L93 Difference]: Finished difference Result 152 states and 182 transitions. [2023-02-15 21:59:55,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 21:59:55,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-15 21:59:55,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:55,692 INFO L225 Difference]: With dead ends: 152 [2023-02-15 21:59:55,692 INFO L226 Difference]: Without dead ends: 152 [2023-02-15 21:59:55,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 21:59:55,693 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:55,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:59:55,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-02-15 21:59:55,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2023-02-15 21:59:55,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 151 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:55,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 182 transitions. [2023-02-15 21:59:55,696 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 182 transitions. Word has length 14 [2023-02-15 21:59:55,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:55,696 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 182 transitions. [2023-02-15 21:59:55,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:55,696 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 182 transitions. [2023-02-15 21:59:55,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 21:59:55,697 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:55,697 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:55,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-02-15 21:59:55,697 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 21:59:55,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:55,698 INFO L85 PathProgramCache]: Analyzing trace with hash 932171324, now seen corresponding path program 1 times [2023-02-15 21:59:55,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:55,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037657701] [2023-02-15 21:59:55,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:55,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:55,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:55,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:55,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037657701] [2023-02-15 21:59:55,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037657701] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:55,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:55,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:59:55,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258583241] [2023-02-15 21:59:55,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:55,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:59:55,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:55,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:59:55,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:59:55,741 INFO L87 Difference]: Start difference. First operand 152 states and 182 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:55,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:55,785 INFO L93 Difference]: Finished difference Result 166 states and 190 transitions. [2023-02-15 21:59:55,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 21:59:55,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 21:59:55,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:55,786 INFO L225 Difference]: With dead ends: 166 [2023-02-15 21:59:55,786 INFO L226 Difference]: Without dead ends: 166 [2023-02-15 21:59:55,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-02-15 21:59:55,787 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 60 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:55,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 270 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 21:59:55,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-02-15 21:59:55,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 153. [2023-02-15 21:59:55,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 118 states have (on average 1.5508474576271187) internal successors, (183), 152 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 183 transitions. [2023-02-15 21:59:55,789 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 183 transitions. Word has length 16 [2023-02-15 21:59:55,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:55,790 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 183 transitions. [2023-02-15 21:59:55,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:55,790 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 183 transitions. [2023-02-15 21:59:55,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 21:59:55,790 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:55,791 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:55,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-02-15 21:59:55,791 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 21:59:55,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:55,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1356387674, now seen corresponding path program 1 times [2023-02-15 21:59:55,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:55,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892041574] [2023-02-15 21:59:55,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:55,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:55,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:55,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:55,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892041574] [2023-02-15 21:59:55,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892041574] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:55,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:55,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 21:59:55,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890377554] [2023-02-15 21:59:55,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:55,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 21:59:55,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:55,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 21:59:55,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 21:59:55,915 INFO L87 Difference]: Start difference. First operand 153 states and 183 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:56,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:56,029 INFO L93 Difference]: Finished difference Result 189 states and 226 transitions. [2023-02-15 21:59:56,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 21:59:56,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 21:59:56,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:56,030 INFO L225 Difference]: With dead ends: 189 [2023-02-15 21:59:56,031 INFO L226 Difference]: Without dead ends: 189 [2023-02-15 21:59:56,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 21:59:56,031 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 51 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:56,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 436 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:59:56,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-02-15 21:59:56,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 167. [2023-02-15 21:59:56,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 166 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:56,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 202 transitions. [2023-02-15 21:59:56,034 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 202 transitions. Word has length 16 [2023-02-15 21:59:56,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:56,035 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 202 transitions. [2023-02-15 21:59:56,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:56,035 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 202 transitions. [2023-02-15 21:59:56,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 21:59:56,035 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:56,035 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:56,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-15 21:59:56,036 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 21:59:56,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:56,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1831516449, now seen corresponding path program 1 times [2023-02-15 21:59:56,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:56,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431014567] [2023-02-15 21:59:56,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:56,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:56,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:56,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:56,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431014567] [2023-02-15 21:59:56,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431014567] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:56,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:56,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 21:59:56,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678338257] [2023-02-15 21:59:56,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:56,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 21:59:56,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:56,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 21:59:56,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2023-02-15 21:59:56,281 INFO L87 Difference]: Start difference. First operand 167 states and 202 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:56,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:56,598 INFO L93 Difference]: Finished difference Result 188 states and 223 transitions. [2023-02-15 21:59:56,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 21:59:56,599 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-15 21:59:56,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:56,599 INFO L225 Difference]: With dead ends: 188 [2023-02-15 21:59:56,599 INFO L226 Difference]: Without dead ends: 188 [2023-02-15 21:59:56,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2023-02-15 21:59:56,600 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 345 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:56,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 287 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:59:56,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-02-15 21:59:56,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 172. [2023-02-15 21:59:56,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 171 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 208 transitions. [2023-02-15 21:59:56,603 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 208 transitions. Word has length 18 [2023-02-15 21:59:56,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:56,603 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 208 transitions. [2023-02-15 21:59:56,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 12 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:56,603 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 208 transitions. [2023-02-15 21:59:56,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 21:59:56,603 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:56,603 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:56,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-15 21:59:56,604 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 21:59:56,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:56,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1831516448, now seen corresponding path program 1 times [2023-02-15 21:59:56,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:56,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773319295] [2023-02-15 21:59:56,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:56,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:56,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:56,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:56,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773319295] [2023-02-15 21:59:56,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773319295] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:56,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:56,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 21:59:56,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095340413] [2023-02-15 21:59:56,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:56,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 21:59:56,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:56,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 21:59:56,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-02-15 21:59:56,931 INFO L87 Difference]: Start difference. First operand 172 states and 208 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:57,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:57,371 INFO L93 Difference]: Finished difference Result 230 states and 266 transitions. [2023-02-15 21:59:57,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 21:59:57,372 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-15 21:59:57,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:57,373 INFO L225 Difference]: With dead ends: 230 [2023-02-15 21:59:57,373 INFO L226 Difference]: Without dead ends: 230 [2023-02-15 21:59:57,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2023-02-15 21:59:57,373 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 306 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:57,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 324 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 21:59:57,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-02-15 21:59:57,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 187. [2023-02-15 21:59:57,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 152 states have (on average 1.480263157894737) internal successors, (225), 186 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:57,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 225 transitions. [2023-02-15 21:59:57,386 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 225 transitions. Word has length 18 [2023-02-15 21:59:57,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:57,386 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 225 transitions. [2023-02-15 21:59:57,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:57,386 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 225 transitions. [2023-02-15 21:59:57,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 21:59:57,387 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:57,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:57,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-02-15 21:59:57,387 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 21:59:57,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:57,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1821793954, now seen corresponding path program 1 times [2023-02-15 21:59:57,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:57,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682683106] [2023-02-15 21:59:57,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:57,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:57,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:57,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:57,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682683106] [2023-02-15 21:59:57,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682683106] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:57,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:57,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:59:57,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628779930] [2023-02-15 21:59:57,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:57,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:59:57,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:57,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:59:57,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:59:57,468 INFO L87 Difference]: Start difference. First operand 187 states and 225 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:57,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:57,568 INFO L93 Difference]: Finished difference Result 186 states and 223 transitions. [2023-02-15 21:59:57,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 21:59:57,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-15 21:59:57,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:57,569 INFO L225 Difference]: With dead ends: 186 [2023-02-15 21:59:57,569 INFO L226 Difference]: Without dead ends: 186 [2023-02-15 21:59:57,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 21:59:57,570 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 7 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:57,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 273 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:59:57,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-15 21:59:57,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2023-02-15 21:59:57,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 185 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:57,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 223 transitions. [2023-02-15 21:59:57,573 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 223 transitions. Word has length 18 [2023-02-15 21:59:57,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:57,573 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 223 transitions. [2023-02-15 21:59:57,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:57,574 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 223 transitions. [2023-02-15 21:59:57,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 21:59:57,574 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:57,574 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:57,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-02-15 21:59:57,574 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 21:59:57,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:57,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1821793955, now seen corresponding path program 1 times [2023-02-15 21:59:57,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:57,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527095252] [2023-02-15 21:59:57,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:57,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:57,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:57,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:57,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:57,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527095252] [2023-02-15 21:59:57,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527095252] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:57,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:57,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:59:57,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091980603] [2023-02-15 21:59:57,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:57,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:59:57,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:57,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:59:57,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:59:57,674 INFO L87 Difference]: Start difference. First operand 186 states and 223 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:57,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:57,780 INFO L93 Difference]: Finished difference Result 185 states and 221 transitions. [2023-02-15 21:59:57,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 21:59:57,781 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-15 21:59:57,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:57,782 INFO L225 Difference]: With dead ends: 185 [2023-02-15 21:59:57,782 INFO L226 Difference]: Without dead ends: 185 [2023-02-15 21:59:57,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 21:59:57,782 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 5 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:57,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 255 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:59:57,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-02-15 21:59:57,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2023-02-15 21:59:57,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 152 states have (on average 1.4539473684210527) internal successors, (221), 184 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:57,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 221 transitions. [2023-02-15 21:59:57,785 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 221 transitions. Word has length 18 [2023-02-15 21:59:57,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:57,785 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 221 transitions. [2023-02-15 21:59:57,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:57,785 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 221 transitions. [2023-02-15 21:59:57,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 21:59:57,785 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:57,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:57,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-15 21:59:57,786 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 21:59:57,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:57,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1856983029, now seen corresponding path program 1 times [2023-02-15 21:59:57,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:57,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913262855] [2023-02-15 21:59:57,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:57,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:57,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:57,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:57,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:57,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913262855] [2023-02-15 21:59:57,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913262855] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:57,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:57,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 21:59:57,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191841896] [2023-02-15 21:59:57,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:57,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 21:59:57,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:57,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 21:59:57,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:59:57,910 INFO L87 Difference]: Start difference. First operand 185 states and 221 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:58,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:58,090 INFO L93 Difference]: Finished difference Result 187 states and 223 transitions. [2023-02-15 21:59:58,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 21:59:58,090 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-15 21:59:58,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:58,091 INFO L225 Difference]: With dead ends: 187 [2023-02-15 21:59:58,091 INFO L226 Difference]: Without dead ends: 187 [2023-02-15 21:59:58,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-15 21:59:58,091 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 81 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:58,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 254 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:59:58,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-02-15 21:59:58,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2023-02-15 21:59:58,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 183 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:58,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 219 transitions. [2023-02-15 21:59:58,094 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 219 transitions. Word has length 21 [2023-02-15 21:59:58,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:58,094 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 219 transitions. [2023-02-15 21:59:58,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:58,094 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 219 transitions. [2023-02-15 21:59:58,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-02-15 21:59:58,094 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:58,094 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:58,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-15 21:59:58,094 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 21:59:58,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:58,095 INFO L85 PathProgramCache]: Analyzing trace with hash 1856983030, now seen corresponding path program 1 times [2023-02-15 21:59:58,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:58,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193791154] [2023-02-15 21:59:58,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:58,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:58,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:58,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:58,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193791154] [2023-02-15 21:59:58,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193791154] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:58,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:58,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 21:59:58,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356663621] [2023-02-15 21:59:58,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:58,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 21:59:58,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:58,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 21:59:58,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:59:58,243 INFO L87 Difference]: Start difference. First operand 184 states and 219 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:58,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:58,415 INFO L93 Difference]: Finished difference Result 186 states and 221 transitions. [2023-02-15 21:59:58,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 21:59:58,416 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-02-15 21:59:58,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:58,416 INFO L225 Difference]: With dead ends: 186 [2023-02-15 21:59:58,416 INFO L226 Difference]: Without dead ends: 186 [2023-02-15 21:59:58,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-15 21:59:58,417 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 77 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:58,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 214 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:59:58,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-15 21:59:58,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2023-02-15 21:59:58,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 152 states have (on average 1.4276315789473684) internal successors, (217), 182 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:58,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 217 transitions. [2023-02-15 21:59:58,419 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 217 transitions. Word has length 21 [2023-02-15 21:59:58,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:58,419 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 217 transitions. [2023-02-15 21:59:58,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:58,420 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 217 transitions. [2023-02-15 21:59:58,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 21:59:58,420 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:58,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:58,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-15 21:59:58,420 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 21:59:58,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:58,421 INFO L85 PathProgramCache]: Analyzing trace with hash 27790463, now seen corresponding path program 1 times [2023-02-15 21:59:58,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:58,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553011039] [2023-02-15 21:59:58,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:58,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:58,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:58,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:58,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:58,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553011039] [2023-02-15 21:59:58,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553011039] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:58,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:58,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:59:58,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436890498] [2023-02-15 21:59:58,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:58,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:59:58,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:58,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:59:58,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:59:58,479 INFO L87 Difference]: Start difference. First operand 183 states and 217 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:58,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:58,568 INFO L93 Difference]: Finished difference Result 182 states and 215 transitions. [2023-02-15 21:59:58,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 21:59:58,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-15 21:59:58,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:58,569 INFO L225 Difference]: With dead ends: 182 [2023-02-15 21:59:58,569 INFO L226 Difference]: Without dead ends: 182 [2023-02-15 21:59:58,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 21:59:58,570 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 7 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:58,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 263 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:59:58,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-15 21:59:58,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2023-02-15 21:59:58,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 152 states have (on average 1.4144736842105263) internal successors, (215), 181 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:58,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 215 transitions. [2023-02-15 21:59:58,572 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 215 transitions. Word has length 22 [2023-02-15 21:59:58,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:58,573 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 215 transitions. [2023-02-15 21:59:58,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:58,573 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 215 transitions. [2023-02-15 21:59:58,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 21:59:58,573 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:58,573 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:58,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-02-15 21:59:58,574 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 21:59:58,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:58,574 INFO L85 PathProgramCache]: Analyzing trace with hash 27790464, now seen corresponding path program 1 times [2023-02-15 21:59:58,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:58,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355910189] [2023-02-15 21:59:58,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:58,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:58,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:58,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:58,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:58,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355910189] [2023-02-15 21:59:58,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355910189] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:58,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:58,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 21:59:58,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705301825] [2023-02-15 21:59:58,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:58,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 21:59:58,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:58,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 21:59:58,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 21:59:58,659 INFO L87 Difference]: Start difference. First operand 182 states and 215 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:58,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:58,761 INFO L93 Difference]: Finished difference Result 181 states and 213 transitions. [2023-02-15 21:59:58,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 21:59:58,762 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-15 21:59:58,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:58,762 INFO L225 Difference]: With dead ends: 181 [2023-02-15 21:59:58,762 INFO L226 Difference]: Without dead ends: 181 [2023-02-15 21:59:58,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 21:59:58,763 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 5 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:58,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 245 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:59:58,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-02-15 21:59:58,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2023-02-15 21:59:58,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 152 states have (on average 1.4013157894736843) internal successors, (213), 180 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:58,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 213 transitions. [2023-02-15 21:59:58,765 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 213 transitions. Word has length 22 [2023-02-15 21:59:58,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:58,765 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 213 transitions. [2023-02-15 21:59:58,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:58,765 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 213 transitions. [2023-02-15 21:59:58,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-02-15 21:59:58,766 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:58,766 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:58,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-02-15 21:59:58,766 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 21:59:58,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:58,766 INFO L85 PathProgramCache]: Analyzing trace with hash -496178395, now seen corresponding path program 1 times [2023-02-15 21:59:58,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:58,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474212855] [2023-02-15 21:59:58,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:58,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:58,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:58,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:58,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474212855] [2023-02-15 21:59:58,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474212855] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:58,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:58,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 21:59:58,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859016854] [2023-02-15 21:59:58,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:58,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 21:59:58,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:58,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 21:59:58,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-02-15 21:59:58,945 INFO L87 Difference]: Start difference. First operand 181 states and 213 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:59,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:59,238 INFO L93 Difference]: Finished difference Result 214 states and 248 transitions. [2023-02-15 21:59:59,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 21:59:59,238 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2023-02-15 21:59:59,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:59,239 INFO L225 Difference]: With dead ends: 214 [2023-02-15 21:59:59,239 INFO L226 Difference]: Without dead ends: 214 [2023-02-15 21:59:59,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2023-02-15 21:59:59,240 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 313 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:59,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 485 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:59:59,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2023-02-15 21:59:59,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 183. [2023-02-15 21:59:59,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 154 states have (on average 1.396103896103896) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:59,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 215 transitions. [2023-02-15 21:59:59,243 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 215 transitions. Word has length 23 [2023-02-15 21:59:59,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:59,243 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 215 transitions. [2023-02-15 21:59:59,243 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:59,243 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 215 transitions. [2023-02-15 21:59:59,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 21:59:59,243 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:59,243 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:59,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-02-15 21:59:59,243 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 21:59:59,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:59,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1022919462, now seen corresponding path program 1 times [2023-02-15 21:59:59,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:59,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640080328] [2023-02-15 21:59:59,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:59,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:59,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:59,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:59,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640080328] [2023-02-15 21:59:59,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640080328] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:59,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:59,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 21:59:59,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069147847] [2023-02-15 21:59:59,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:59,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 21:59:59,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:59,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 21:59:59,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:59:59,371 INFO L87 Difference]: Start difference. First operand 183 states and 215 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:59,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:59,588 INFO L93 Difference]: Finished difference Result 185 states and 218 transitions. [2023-02-15 21:59:59,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 21:59:59,589 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-15 21:59:59,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:59,590 INFO L225 Difference]: With dead ends: 185 [2023-02-15 21:59:59,590 INFO L226 Difference]: Without dead ends: 185 [2023-02-15 21:59:59,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-15 21:59:59,590 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 69 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:59,591 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 282 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 21:59:59,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-02-15 21:59:59,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2023-02-15 21:59:59,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 154 states have (on average 1.3896103896103895) internal successors, (214), 181 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:59,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 214 transitions. [2023-02-15 21:59:59,593 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 214 transitions. Word has length 25 [2023-02-15 21:59:59,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:59,593 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 214 transitions. [2023-02-15 21:59:59,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:59,593 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 214 transitions. [2023-02-15 21:59:59,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 21:59:59,593 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:59,594 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 21:59:59,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-02-15 21:59:59,594 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 21:59:59,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:59,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1022919461, now seen corresponding path program 1 times [2023-02-15 21:59:59,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:59,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096655139] [2023-02-15 21:59:59,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:59,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 21:59:59,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 21:59:59,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 21:59:59,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096655139] [2023-02-15 21:59:59,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096655139] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 21:59:59,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 21:59:59,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 21:59:59,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873264296] [2023-02-15 21:59:59,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 21:59:59,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 21:59:59,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 21:59:59,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 21:59:59,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 21:59:59,761 INFO L87 Difference]: Start difference. First operand 182 states and 214 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:59,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 21:59:59,965 INFO L93 Difference]: Finished difference Result 184 states and 217 transitions. [2023-02-15 21:59:59,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 21:59:59,965 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-02-15 21:59:59,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 21:59:59,966 INFO L225 Difference]: With dead ends: 184 [2023-02-15 21:59:59,966 INFO L226 Difference]: Without dead ends: 184 [2023-02-15 21:59:59,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2023-02-15 21:59:59,967 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 69 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 21:59:59,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 252 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 21:59:59,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-02-15 21:59:59,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2023-02-15 21:59:59,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 154 states have (on average 1.3831168831168832) internal successors, (213), 180 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:59,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 213 transitions. [2023-02-15 21:59:59,969 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 213 transitions. Word has length 25 [2023-02-15 21:59:59,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 21:59:59,969 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 213 transitions. [2023-02-15 21:59:59,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 21:59:59,969 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 213 transitions. [2023-02-15 21:59:59,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-02-15 21:59:59,970 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 21:59:59,970 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] [2023-02-15 21:59:59,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-02-15 21:59:59,970 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 21:59:59,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 21:59:59,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1627096903, now seen corresponding path program 1 times [2023-02-15 21:59:59,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 21:59:59,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67124555] [2023-02-15 21:59:59,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 21:59:59,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 21:59:59,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:00,073 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:00,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:00:00,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67124555] [2023-02-15 22:00:00,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67124555] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:00:00,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403016131] [2023-02-15 22:00:00,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:00,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:00:00,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:00:00,077 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:00:00,091 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-15 22:00:00,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:00,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-15 22:00:00,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:00,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:00:00,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:00:00,271 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 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 22:00:00,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 22:00:00,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:00:00,307 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:00:00,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:00,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:00:00,392 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:00,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403016131] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:00:00,393 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:00:00,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2023-02-15 22:00:00,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991160641] [2023-02-15 22:00:00,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:00:00,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:00:00,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:00:00,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:00:00,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:00:00,394 INFO L87 Difference]: Start difference. First operand 181 states and 213 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:00:00,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:00,444 INFO L93 Difference]: Finished difference Result 187 states and 219 transitions. [2023-02-15 22:00:00,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:00:00,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-02-15 22:00:00,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:00,445 INFO L225 Difference]: With dead ends: 187 [2023-02-15 22:00:00,445 INFO L226 Difference]: Without dead ends: 187 [2023-02-15 22:00:00,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:00:00,446 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 12 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:00:00,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 354 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:00:00,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-02-15 22:00:00,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2023-02-15 22:00:00,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:00:00,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 215 transitions. [2023-02-15 22:00:00,449 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 215 transitions. Word has length 26 [2023-02-15 22:00:00,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:00,449 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 215 transitions. [2023-02-15 22:00:00,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:00:00,450 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 215 transitions. [2023-02-15 22:00:00,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 22:00:00,450 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:00,450 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:00:00,463 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-02-15 22:00:00,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-02-15 22:00:00,658 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 22:00:00,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:00,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1099603412, now seen corresponding path program 1 times [2023-02-15 22:00:00,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:00:00,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741439358] [2023-02-15 22:00:00,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:00,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:00:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:00,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:00,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:00:00,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741439358] [2023-02-15 22:00:00,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741439358] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:00:00,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781189451] [2023-02-15 22:00:00,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:00,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:00:00,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:00:00,939 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:00:00,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-15 22:00:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:01,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-15 22:00:01,023 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:01,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:00:01,233 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:01,233 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 44 treesize of output 34 [2023-02-15 22:00:01,380 INFO L321 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-02-15 22:00:01,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 29 [2023-02-15 22:00:01,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:01,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:00:01,805 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 33 treesize of output 29 [2023-02-15 22:00:01,808 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 52 treesize of output 48 [2023-02-15 22:00:01,831 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 52 treesize of output 46 [2023-02-15 22:00:01,841 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 74 treesize of output 68 [2023-02-15 22:00:14,136 WARN L233 SmtUtils]: Spent 12.19s on a formula simplification. DAG size of input: 57 DAG size of output: 49 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:00:18,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:18,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781189451] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:00:18,371 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:00:18,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2023-02-15 22:00:18,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914816651] [2023-02-15 22:00:18,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:00:18,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-02-15 22:00:18,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:00:18,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-02-15 22:00:18,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=723, Unknown=0, NotChecked=0, Total=812 [2023-02-15 22:00:18,373 INFO L87 Difference]: Start difference. First operand 183 states and 215 transitions. Second operand has 29 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:00:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:19,559 INFO L93 Difference]: Finished difference Result 224 states and 259 transitions. [2023-02-15 22:00:19,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 22:00:19,559 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-15 22:00:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:19,560 INFO L225 Difference]: With dead ends: 224 [2023-02-15 22:00:19,560 INFO L226 Difference]: Without dead ends: 218 [2023-02-15 22:00:19,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=227, Invalid=1413, Unknown=0, NotChecked=0, Total=1640 [2023-02-15 22:00:19,561 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 159 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:00:19,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 764 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 22:00:19,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-02-15 22:00:19,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 198. [2023-02-15 22:00:19,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 171 states have (on average 1.3508771929824561) internal successors, (231), 197 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:00:19,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 231 transitions. [2023-02-15 22:00:19,564 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 231 transitions. Word has length 27 [2023-02-15 22:00:19,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:19,565 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 231 transitions. [2023-02-15 22:00:19,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.4642857142857144) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:00:19,565 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 231 transitions. [2023-02-15 22:00:19,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 22:00:19,565 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:19,565 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:00:19,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-02-15 22:00:19,769 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,SelfDestructingSolverStorable24 [2023-02-15 22:00:19,769 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 22:00:19,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:19,769 INFO L85 PathProgramCache]: Analyzing trace with hash -466107059, now seen corresponding path program 1 times [2023-02-15 22:00:19,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:00:19,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598147743] [2023-02-15 22:00:19,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:19,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:00:19,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:19,853 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:19,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:00:19,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598147743] [2023-02-15 22:00:19,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598147743] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:00:19,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:00:19,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:00:19,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351277378] [2023-02-15 22:00:19,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:00:19,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:00:19,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:00:19,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:00:19,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:00:19,855 INFO L87 Difference]: Start difference. First operand 198 states and 231 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:00:20,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:20,031 INFO L93 Difference]: Finished difference Result 216 states and 244 transitions. [2023-02-15 22:00:20,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:00:20,032 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-02-15 22:00:20,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:20,033 INFO L225 Difference]: With dead ends: 216 [2023-02-15 22:00:20,033 INFO L226 Difference]: Without dead ends: 216 [2023-02-15 22:00:20,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:00:20,033 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 126 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:00:20,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 189 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 22:00:20,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-02-15 22:00:20,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 198. [2023-02-15 22:00:20,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 171 states have (on average 1.3391812865497077) internal successors, (229), 197 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:00:20,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 229 transitions. [2023-02-15 22:00:20,036 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 229 transitions. Word has length 30 [2023-02-15 22:00:20,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:20,036 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 229 transitions. [2023-02-15 22:00:20,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 7 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:00:20,037 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 229 transitions. [2023-02-15 22:00:20,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-02-15 22:00:20,037 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:20,037 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:00:20,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-02-15 22:00:20,037 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 22:00:20,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:20,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1564416794, now seen corresponding path program 1 times [2023-02-15 22:00:20,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:00:20,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279092840] [2023-02-15 22:00:20,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:20,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:00:20,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:20,074 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:20,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:00:20,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279092840] [2023-02-15 22:00:20,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279092840] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:00:20,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:00:20,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:00:20,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356800243] [2023-02-15 22:00:20,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:00:20,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:00:20,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:00:20,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:00:20,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:00:20,076 INFO L87 Difference]: Start difference. First operand 198 states and 229 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:00:20,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:20,117 INFO L93 Difference]: Finished difference Result 227 states and 256 transitions. [2023-02-15 22:00:20,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:00:20,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-02-15 22:00:20,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:20,118 INFO L225 Difference]: With dead ends: 227 [2023-02-15 22:00:20,118 INFO L226 Difference]: Without dead ends: 227 [2023-02-15 22:00:20,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:00:20,119 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 47 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:00:20,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 270 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:00:20,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-15 22:00:20,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 198. [2023-02-15 22:00:20,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 171 states have (on average 1.3333333333333333) internal successors, (228), 197 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:00:20,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 228 transitions. [2023-02-15 22:00:20,122 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 228 transitions. Word has length 31 [2023-02-15 22:00:20,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:20,122 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 228 transitions. [2023-02-15 22:00:20,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:00:20,122 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 228 transitions. [2023-02-15 22:00:20,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 22:00:20,123 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:20,123 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:00:20,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-02-15 22:00:20,123 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 22:00:20,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:20,123 INFO L85 PathProgramCache]: Analyzing trace with hash 821443088, now seen corresponding path program 1 times [2023-02-15 22:00:20,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:00:20,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221550111] [2023-02-15 22:00:20,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:20,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:00:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:20,657 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:20,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:00:20,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221550111] [2023-02-15 22:00:20,658 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221550111] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:00:20,658 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:00:20,658 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-02-15 22:00:20,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173492145] [2023-02-15 22:00:20,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:00:20,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 22:00:20,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:00:20,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 22:00:20,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-02-15 22:00:20,659 INFO L87 Difference]: Start difference. First operand 198 states and 228 transitions. Second operand has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:00:21,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:21,420 INFO L93 Difference]: Finished difference Result 233 states and 267 transitions. [2023-02-15 22:00:21,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 22:00:21,421 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-15 22:00:21,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:21,422 INFO L225 Difference]: With dead ends: 233 [2023-02-15 22:00:21,422 INFO L226 Difference]: Without dead ends: 226 [2023-02-15 22:00:21,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=179, Invalid=751, Unknown=0, NotChecked=0, Total=930 [2023-02-15 22:00:21,423 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 281 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 553 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:00:21,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 513 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 553 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:00:21,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-02-15 22:00:21,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 196. [2023-02-15 22:00:21,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 169 states have (on average 1.331360946745562) internal successors, (225), 195 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:00:21,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 225 transitions. [2023-02-15 22:00:21,425 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 225 transitions. Word has length 37 [2023-02-15 22:00:21,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:21,425 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 225 transitions. [2023-02-15 22:00:21,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:00:21,425 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 225 transitions. [2023-02-15 22:00:21,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 22:00:21,426 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:21,426 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:00:21,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-02-15 22:00:21,426 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 22:00:21,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:21,426 INFO L85 PathProgramCache]: Analyzing trace with hash 431036240, now seen corresponding path program 1 times [2023-02-15 22:00:21,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:00:21,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258932464] [2023-02-15 22:00:21,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:21,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:00:21,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:21,937 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:21,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:00:21,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258932464] [2023-02-15 22:00:21,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258932464] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:00:21,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:00:21,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-02-15 22:00:21,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569012482] [2023-02-15 22:00:21,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:00:21,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 22:00:21,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:00:21,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 22:00:21,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-02-15 22:00:21,938 INFO L87 Difference]: Start difference. First operand 196 states and 225 transitions. Second operand has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:00:22,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:22,576 INFO L93 Difference]: Finished difference Result 222 states and 253 transitions. [2023-02-15 22:00:22,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 22:00:22,577 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2023-02-15 22:00:22,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:22,578 INFO L225 Difference]: With dead ends: 222 [2023-02-15 22:00:22,578 INFO L226 Difference]: Without dead ends: 197 [2023-02-15 22:00:22,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=647, Unknown=0, NotChecked=0, Total=812 [2023-02-15 22:00:22,578 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 271 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:00:22,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 524 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:00:22,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-15 22:00:22,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 183. [2023-02-15 22:00:22,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 156 states have (on average 1.3525641025641026) internal successors, (211), 182 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-15 22:00:22,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 211 transitions. [2023-02-15 22:00:22,582 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 211 transitions. Word has length 37 [2023-02-15 22:00:22,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:22,582 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 211 transitions. [2023-02-15 22:00:22,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.642857142857143) internal successors, (37), 14 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:00:22,582 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 211 transitions. [2023-02-15 22:00:22,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 22:00:22,582 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:22,582 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:00:22,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-02-15 22:00:22,583 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 22:00:22,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:22,583 INFO L85 PathProgramCache]: Analyzing trace with hash -756843594, now seen corresponding path program 1 times [2023-02-15 22:00:22,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:00:22,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990396079] [2023-02-15 22:00:22,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:22,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:00:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:23,216 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 22:00:23,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:00:23,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990396079] [2023-02-15 22:00:23,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990396079] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:00:23,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655936874] [2023-02-15 22:00:23,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:23,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:00:23,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:00:23,218 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:00:23,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-15 22:00:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:23,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-15 22:00:23,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:23,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:00:23,633 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 22:00:23,656 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:23,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:00:23,883 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:23,883 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 48 treesize of output 47 [2023-02-15 22:00:23,895 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:23,895 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 42 treesize of output 41 [2023-02-15 22:00:24,165 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:24,165 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1655936874] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:00:24,166 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:00:24,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 31 [2023-02-15 22:00:24,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295996892] [2023-02-15 22:00:24,166 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:00:24,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-15 22:00:24,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:00:24,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 22:00:24,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2023-02-15 22:00:24,167 INFO L87 Difference]: Start difference. First operand 183 states and 211 transitions. Second operand has 31 states, 31 states have (on average 3.0) internal successors, (93), 31 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:00:25,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:25,773 INFO L93 Difference]: Finished difference Result 272 states and 316 transitions. [2023-02-15 22:00:25,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2023-02-15 22:00:25,773 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.0) internal successors, (93), 31 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-02-15 22:00:25,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:25,777 INFO L225 Difference]: With dead ends: 272 [2023-02-15 22:00:25,777 INFO L226 Difference]: Without dead ends: 272 [2023-02-15 22:00:25,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=823, Invalid=2483, Unknown=0, NotChecked=0, Total=3306 [2023-02-15 22:00:25,779 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 426 mSDsluCounter, 860 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 947 SdHoareTripleChecker+Invalid, 1075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:00:25,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 947 Invalid, 1075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 22:00:25,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2023-02-15 22:00:25,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 207. [2023-02-15 22:00:25,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 180 states have (on average 1.3277777777777777) internal successors, (239), 206 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:00:25,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 239 transitions. [2023-02-15 22:00:25,782 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 239 transitions. Word has length 38 [2023-02-15 22:00:25,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:25,782 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 239 transitions. [2023-02-15 22:00:25,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.0) internal successors, (93), 31 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:00:25,783 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 239 transitions. [2023-02-15 22:00:25,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-15 22:00:25,783 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:25,783 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:00:25,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-15 22:00:25,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:00:25,988 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 22:00:25,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:25,989 INFO L85 PathProgramCache]: Analyzing trace with hash 734177974, now seen corresponding path program 1 times [2023-02-15 22:00:25,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:00:25,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191665814] [2023-02-15 22:00:25,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:25,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:00:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:26,311 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:26,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:00:26,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191665814] [2023-02-15 22:00:26,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191665814] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:00:26,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734349474] [2023-02-15 22:00:26,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:26,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:00:26,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:00:26,317 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:00:26,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-15 22:00:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:26,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-15 22:00:26,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:26,654 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:00:26,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 22:00:26,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:00:26,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 22:00:26,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:00:26,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 22:00:26,790 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:00:26,791 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 42 treesize of output 41 [2023-02-15 22:00:26,795 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 29 treesize of output 29 [2023-02-15 22:00:26,855 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:00:26,855 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 42 treesize of output 41 [2023-02-15 22:00:26,859 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 29 treesize of output 29 [2023-02-15 22:00:26,926 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2023-02-15 22:00:26,930 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:26,930 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 11 [2023-02-15 22:00:26,934 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:26,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:00:26,969 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_946 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_946) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_947 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_947) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))) is different from false [2023-02-15 22:00:27,025 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_945 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_945) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_944) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_947) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_946 (Array Int Int))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_944))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_946)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)))) is different from false [2023-02-15 22:00:27,034 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (and (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_945 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_945) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_944) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_947) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_946 (Array Int Int))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_944))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_946)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))))) is different from false [2023-02-15 22:00:27,050 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 |c_ULTIMATE.start_main_#t~malloc20#1.base|)))) (and (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_945 (Array Int Int)) (v_ArrVal_947 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 |c_ULTIMATE.start_main_#t~malloc20#1.offset|)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_945) (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_944) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_947) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0)) (forall ((v_ArrVal_944 (Array Int Int)) (v_ArrVal_946 (Array Int Int))) (= (select (select (let ((.cse2 (store .cse1 |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_944))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_946)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) 0))))) is different from false [2023-02-15 22:00:27,395 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:27,396 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 112 [2023-02-15 22:00:27,407 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:27,408 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 109 [2023-02-15 22:00:27,412 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 0 case distinctions, treesize of input 143 treesize of output 122 [2023-02-15 22:00:27,416 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 0 case distinctions, treesize of input 122 treesize of output 100 [2023-02-15 22:00:27,439 INFO L321 Elim1Store]: treesize reduction 4, result has 84.0 percent of original size [2023-02-15 22:00:27,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 243 treesize of output 241 [2023-02-15 22:00:27,446 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 212 treesize of output 202 [2023-02-15 22:00:27,450 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 202 treesize of output 198 [2023-02-15 22:00:27,454 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 198 treesize of output 174 [2023-02-15 22:00:27,474 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:27,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 181 treesize of output 205 [2023-02-15 22:00:27,492 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-15 22:00:27,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 370 treesize of output 279 [2023-02-15 22:00:27,504 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:27,505 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 245 treesize of output 238 [2023-02-15 22:00:27,510 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 227 treesize of output 223 [2023-02-15 22:00:27,646 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:27,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734349474] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:00:27,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:00:27,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 15] total 34 [2023-02-15 22:00:27,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137889239] [2023-02-15 22:00:27,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:00:27,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-02-15 22:00:27,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:00:27,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-02-15 22:00:27,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=716, Unknown=12, NotChecked=236, Total=1122 [2023-02-15 22:00:27,650 INFO L87 Difference]: Start difference. First operand 207 states and 239 transitions. Second operand has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:00:33,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:33,332 INFO L93 Difference]: Finished difference Result 290 states and 341 transitions. [2023-02-15 22:00:33,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 22:00:33,332 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-02-15 22:00:33,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:33,333 INFO L225 Difference]: With dead ends: 290 [2023-02-15 22:00:33,333 INFO L226 Difference]: Without dead ends: 290 [2023-02-15 22:00:33,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 4 IntricatePredicates, 1 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=482, Invalid=1591, Unknown=13, NotChecked=364, Total=2450 [2023-02-15 22:00:33,334 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 337 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 27 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 969 SdHoareTripleChecker+Invalid, 1501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 577 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:00:33,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 969 Invalid, 1501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 894 Invalid, 3 Unknown, 577 Unchecked, 0.7s Time] [2023-02-15 22:00:33,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2023-02-15 22:00:33,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 242. [2023-02-15 22:00:33,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 215 states have (on average 1.3162790697674418) internal successors, (283), 241 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:00:33,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 283 transitions. [2023-02-15 22:00:33,337 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 283 transitions. Word has length 38 [2023-02-15 22:00:33,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:33,337 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 283 transitions. [2023-02-15 22:00:33,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 34 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:00:33,338 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 283 transitions. [2023-02-15 22:00:33,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:00:33,338 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:33,338 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:00:33,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-15 22:00:33,538 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:00:33,539 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 22:00:33,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:33,539 INFO L85 PathProgramCache]: Analyzing trace with hash -659312340, now seen corresponding path program 1 times [2023-02-15 22:00:33,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:00:33,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372915230] [2023-02-15 22:00:33,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:33,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:00:33,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:33,899 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:33,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:00:33,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372915230] [2023-02-15 22:00:33,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372915230] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:00:33,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009545371] [2023-02-15 22:00:33,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:33,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:00:33,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:00:33,900 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:00:33,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-15 22:00:34,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:34,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 36 conjunts are in the unsatisfiable core [2023-02-15 22:00:34,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:34,092 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:00:34,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 12 treesize of output 14 [2023-02-15 22:00:34,177 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:00:34,178 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-15 22:00:34,208 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 13 treesize of output 9 [2023-02-15 22:00:34,294 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:00:34,295 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 34 treesize of output 35 [2023-02-15 22:00:34,355 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:00:34,355 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 34 treesize of output 35 [2023-02-15 22:00:34,473 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:00:34,474 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 13 [2023-02-15 22:00:34,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:34,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:00:38,477 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:38,478 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 46 treesize of output 37 [2023-02-15 22:00:38,487 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:38,487 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 170 treesize of output 145 [2023-02-15 22:00:38,497 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:38,497 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 130 treesize of output 118 [2023-02-15 22:00:38,502 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 110 treesize of output 102 [2023-02-15 22:00:43,074 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:43,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 130 treesize of output 284 [2023-02-15 22:00:44,152 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:44,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009545371] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:00:44,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:00:44,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 15] total 34 [2023-02-15 22:00:44,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007665447] [2023-02-15 22:00:44,156 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:00:44,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 22:00:44,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:00:44,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 22:00:44,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=965, Unknown=20, NotChecked=0, Total=1190 [2023-02-15 22:00:44,158 INFO L87 Difference]: Start difference. First operand 242 states and 283 transitions. Second operand has 35 states, 34 states have (on average 3.5294117647058822) internal successors, (120), 35 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-15 22:00:45,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:45,077 INFO L93 Difference]: Finished difference Result 443 states and 537 transitions. [2023-02-15 22:00:45,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 22:00:45,084 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.5294117647058822) internal successors, (120), 35 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) Word has length 46 [2023-02-15 22:00:45,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:45,085 INFO L225 Difference]: With dead ends: 443 [2023-02-15 22:00:45,085 INFO L226 Difference]: Without dead ends: 443 [2023-02-15 22:00:45,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 64 SyntacticMatches, 6 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=346, Invalid=1356, Unknown=20, NotChecked=0, Total=1722 [2023-02-15 22:00:45,086 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 562 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 1261 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:00:45,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 935 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1261 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 22:00:45,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2023-02-15 22:00:45,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 285. [2023-02-15 22:00:45,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 258 states have (on average 1.3527131782945736) internal successors, (349), 284 states have internal predecessors, (349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:00:45,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 349 transitions. [2023-02-15 22:00:45,091 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 349 transitions. Word has length 46 [2023-02-15 22:00:45,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:45,092 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 349 transitions. [2023-02-15 22:00:45,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.5294117647058822) internal successors, (120), 35 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-15 22:00:45,092 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 349 transitions. [2023-02-15 22:00:45,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:00:45,092 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:45,092 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:00:45,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-02-15 22:00:45,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:00:45,300 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 22:00:45,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:45,301 INFO L85 PathProgramCache]: Analyzing trace with hash -659312339, now seen corresponding path program 1 times [2023-02-15 22:00:45,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:00:45,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013904410] [2023-02-15 22:00:45,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:45,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:00:45,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:46,468 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:46,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:00:46,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013904410] [2023-02-15 22:00:46,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013904410] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:00:46,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167214076] [2023-02-15 22:00:46,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:46,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:00:46,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:00:46,470 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:00:46,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-15 22:00:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:46,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-15 22:00:46,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:46,802 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-02-15 22:00:46,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-02-15 22:00:46,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 22:00:46,848 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 13 treesize of output 9 [2023-02-15 22:00:46,857 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 13 treesize of output 9 [2023-02-15 22:00:46,977 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:00:46,977 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 46 treesize of output 45 [2023-02-15 22:00:46,981 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 22 treesize of output 24 [2023-02-15 22:00:47,054 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:00:47,054 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 46 treesize of output 45 [2023-02-15 22:00:47,064 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 22 treesize of output 24 [2023-02-15 22:00:47,375 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:00:47,375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-02-15 22:00:47,379 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:00:47,380 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 19 treesize of output 7 [2023-02-15 22:00:47,422 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:47,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:00:47,901 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (and (forall ((v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1176 (Array Int Int)) (v_ArrVal_1175 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.offset_60| Int)) (or (not (<= |v_ULTIMATE.start_main_~n~0#1.offset_60| |c_ULTIMATE.start_main_~root~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~n~0#1.offset_60|)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1176))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse3)) (.cse1 (+ |v_ULTIMATE.start_main_~n~0#1.offset_60| 4))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1175) .cse0 v_ArrVal_1177) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1) 4) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1178) |c_ULTIMATE.start_main_~root~0#1.base|) .cse1))))))) (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1176 (Array Int Int)) (v_ArrVal_1175 (Array Int Int)) (|v_ULTIMATE.start_main_~n~0#1.offset_60| Int)) (or (not (<= |v_ULTIMATE.start_main_~n~0#1.offset_60| |c_ULTIMATE.start_main_~root~0#1.offset|)) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1175) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1176) |c_ULTIMATE.start_main_~n~0#1.base|) .cse3) v_ArrVal_1177) |c_ULTIMATE.start_main_~root~0#1.base|) (+ |v_ULTIMATE.start_main_~n~0#1.offset_60| 4))) (not (<= 0 |v_ULTIMATE.start_main_~n~0#1.offset_60|)))))) is different from false [2023-02-15 22:00:48,113 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:48,113 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 44 treesize of output 45 [2023-02-15 22:00:48,120 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:48,121 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 34 treesize of output 35 [2023-02-15 22:00:48,125 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 60 treesize of output 48 [2023-02-15 22:00:48,137 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:48,137 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 200 treesize of output 187 [2023-02-15 22:00:48,144 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 146 treesize of output 138 [2023-02-15 22:00:48,148 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 164 treesize of output 144 [2023-02-15 22:00:48,153 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 122 treesize of output 98 [2023-02-15 22:00:48,268 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:48,268 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 89 treesize of output 90 [2023-02-15 22:00:48,277 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:48,277 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 79 treesize of output 60 [2023-02-15 22:00:48,280 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:00:48,280 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:00:48,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:00:48,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:00:48,284 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 56 [2023-02-15 22:00:48,287 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:00:48,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:00:48,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:00:48,292 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 32 [2023-02-15 22:00:48,301 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 15 treesize of output 11 [2023-02-15 22:00:48,719 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:48,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 129 [2023-02-15 22:00:49,049 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:49,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167214076] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:00:49,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-15 22:00:49,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 14, 15] total 51 [2023-02-15 22:00:49,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737332907] [2023-02-15 22:00:49,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-15 22:00:49,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-02-15 22:00:49,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-15 22:00:49,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-02-15 22:00:49,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=2191, Unknown=22, NotChecked=98, Total=2652 [2023-02-15 22:00:49,051 INFO L87 Difference]: Start difference. First operand 285 states and 349 transitions. Second operand has 52 states, 51 states have (on average 2.588235294117647) internal successors, (132), 52 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:01:09,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:01:09,233 INFO L93 Difference]: Finished difference Result 1828 states and 2282 transitions. [2023-02-15 22:01:09,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2023-02-15 22:01:09,237 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.588235294117647) internal successors, (132), 52 states have internal predecessors, (132), 0 states have call successors, (0), 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 46 [2023-02-15 22:01:09,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:01:09,241 INFO L225 Difference]: With dead ends: 1828 [2023-02-15 22:01:09,241 INFO L226 Difference]: Without dead ends: 1828 [2023-02-15 22:01:09,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 66 SyntacticMatches, 6 SemanticMatches, 277 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 28589 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=10661, Invalid=66327, Unknown=22, NotChecked=552, Total=77562 [2023-02-15 22:01:09,251 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 2893 mSDsluCounter, 2453 mSDsCounter, 0 mSdLazyCounter, 3614 mSolverCounterSat, 627 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2893 SdHoareTripleChecker+Valid, 2582 SdHoareTripleChecker+Invalid, 4610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 627 IncrementalHoareTripleChecker+Valid, 3614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 369 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:01:09,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2893 Valid, 2582 Invalid, 4610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [627 Valid, 3614 Invalid, 0 Unknown, 369 Unchecked, 3.2s Time] [2023-02-15 22:01:09,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1828 states. [2023-02-15 22:01:09,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1828 to 641. [2023-02-15 22:01:09,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 618 states have (on average 1.3462783171521036) internal successors, (832), 640 states have internal predecessors, (832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:01:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 832 transitions. [2023-02-15 22:01:09,272 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 832 transitions. Word has length 46 [2023-02-15 22:01:09,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:01:09,272 INFO L495 AbstractCegarLoop]: Abstraction has 641 states and 832 transitions. [2023-02-15 22:01:09,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.588235294117647) internal successors, (132), 52 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:01:09,272 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 832 transitions. [2023-02-15 22:01:09,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:01:09,273 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:01:09,273 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:01:09,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-15 22:01:09,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:01:09,485 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2023-02-15 22:01:09,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:01:09,485 INFO L85 PathProgramCache]: Analyzing trace with hash -659497038, now seen corresponding path program 1 times [2023-02-15 22:01:09,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-15 22:01:09,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578269277] [2023-02-15 22:01:09,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:01:09,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-15 22:01:09,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:01:10,004 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:01:10,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-15 22:01:10,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578269277] [2023-02-15 22:01:10,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578269277] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:01:10,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031308023] [2023-02-15 22:01:10,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:01:10,004 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 22:01:10,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:01:10,006 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 22:01:10,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-15 22:01:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:01:10,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 52 conjunts are in the unsatisfiable core [2023-02-15 22:01:10,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:01:10,232 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-02-15 22:01:10,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-02-15 22:01:10,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 22:01:10,357 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:01:10,358 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 36 treesize of output 35 [2023-02-15 22:01:10,451 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:01:10,452 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 36 treesize of output 35 [2023-02-15 22:01:10,666 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-02-15 22:01:10,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2023-02-15 22:01:10,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:01:10,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 37 [2023-02-15 22:01:10,846 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:01:10,846 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 62 treesize of output 55 [2023-02-15 22:01:10,938 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:01:10,938 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 62 treesize of output 55 [2023-02-15 22:01:11,116 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 25 [2023-02-15 22:01:11,174 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:01:11,174 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:01:11,234 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1296 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4)) v_ArrVal_1296) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1)) is different from false [2023-02-15 22:01:11,468 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1292 Int) (v_ArrVal_1296 (Array Int Int)) (v_ArrVal_1295 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_16| Int)) (or (not (= 0 (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc20#1.base_16|))) (= (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc20#1.base_16| v_ArrVal_1292) (select (select (let ((.cse1 (+ |c_ULTIMATE.start_main_~n~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc20#1.base_16|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_16| v_ArrVal_1295))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1296))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) 1))) is different from false [2023-02-15 22:01:11,885 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:01:11,886 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 203 treesize of output 131 [2023-02-15 22:01:11,961 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:01:11,962 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 634948 treesize of output 611838 [2023-02-15 22:01:13,618 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:01:13,619 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 636400 treesize of output 629770 [2023-02-15 22:01:15,360 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 629540 treesize of output 609316 [2023-02-15 22:01:16,984 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:01:16,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 613376 treesize of output 610218 [2023-02-15 22:01:18,693 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:01:18,694 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 610000 treesize of output 559514