./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0214_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 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/list-ext-properties/test-0214_1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8cac36e956b24d42ea840a07609fb159882a2e76b1195da25a4d4343e0b31026 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:27:42,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:27:42,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:27:42,169 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:27:42,170 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:27:42,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:27:42,172 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:27:42,175 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:27:42,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:27:42,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:27:42,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:27:42,183 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:27:42,184 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:27:42,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:27:42,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:27:42,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:27:42,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:27:42,191 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:27:42,192 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:27:42,196 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:27:42,198 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:27:42,199 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:27:42,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:27:42,200 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:27:42,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:27:42,207 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:27:42,207 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:27:42,207 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:27:42,208 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:27:42,209 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:27:42,210 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:27:42,210 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:27:42,211 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:27:42,211 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:27:42,212 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:27:42,213 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:27:42,213 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:27:42,214 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:27:42,214 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:27:42,214 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:27:42,215 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:27:42,216 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:27:42,217 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 06:27:42,240 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:27:42,240 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:27:42,240 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:27:42,240 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:27:42,241 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:27:42,242 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:27:42,242 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:27:42,242 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:27:42,242 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:27:42,243 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:27:42,243 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:27:42,243 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:27:42,243 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:27:42,244 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:27:42,244 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:27:42,244 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:27:42,244 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:27:42,244 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:27:42,245 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:27:42,245 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:27:42,245 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:27:42,245 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:27:42,246 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:27:42,246 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:27:42,246 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:27:42,246 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:27:42,246 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:27:42,247 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:27:42,247 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 06:27:42,247 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 06:27:42,247 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8cac36e956b24d42ea840a07609fb159882a2e76b1195da25a4d4343e0b31026 [2022-07-14 06:27:42,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:27:42,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:27:42,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:27:42,461 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:27:42,461 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:27:42,463 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0214_1.i [2022-07-14 06:27:42,516 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6db4844e3/4c5874f2d4014b8f9626913f68d83b70/FLAG79c9022a0 [2022-07-14 06:27:42,889 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:27:42,889 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0214_1.i [2022-07-14 06:27:42,901 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6db4844e3/4c5874f2d4014b8f9626913f68d83b70/FLAG79c9022a0 [2022-07-14 06:27:42,915 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6db4844e3/4c5874f2d4014b8f9626913f68d83b70 [2022-07-14 06:27:42,917 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:27:42,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:27:42,920 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:27:42,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:27:42,923 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:27:42,923 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:27:42" (1/1) ... [2022-07-14 06:27:42,924 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73165bac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:27:42, skipping insertion in model container [2022-07-14 06:27:42,924 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:27:42" (1/1) ... [2022-07-14 06:27:42,928 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:27:42,956 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:27:43,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:27:43,255 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:27:43,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:27:43,326 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:27:43,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:27:43 WrapperNode [2022-07-14 06:27:43,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:27:43,328 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:27:43,328 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:27:43,329 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:27:43,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:27:43" (1/1) ... [2022-07-14 06:27:43,354 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:27:43" (1/1) ... [2022-07-14 06:27:43,384 INFO L137 Inliner]: procedures = 181, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 223 [2022-07-14 06:27:43,387 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:27:43,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:27:43,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:27:43,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:27:43,394 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:27:43" (1/1) ... [2022-07-14 06:27:43,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:27:43" (1/1) ... [2022-07-14 06:27:43,397 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:27:43" (1/1) ... [2022-07-14 06:27:43,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:27:43" (1/1) ... [2022-07-14 06:27:43,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:27:43" (1/1) ... [2022-07-14 06:27:43,410 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:27:43" (1/1) ... [2022-07-14 06:27:43,412 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:27:43" (1/1) ... [2022-07-14 06:27:43,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:27:43,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:27:43,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:27:43,419 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:27:43,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:27:43" (1/1) ... [2022-07-14 06:27:43,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:27:43,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:27:43,444 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 06:27:43,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 06:27:43,477 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2022-07-14 06:27:43,477 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2022-07-14 06:27:43,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 06:27:43,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:27:43,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:27:43,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:27:43,478 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:27:43,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:27:43,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 06:27:43,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 06:27:43,478 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:27:43,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:27:43,553 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:27:43,554 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:27:43,918 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:27:43,925 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:27:43,927 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-14 06:27:43,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:27:43 BoogieIcfgContainer [2022-07-14 06:27:43,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:27:43,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:27:43,931 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:27:43,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:27:43,933 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:27:42" (1/3) ... [2022-07-14 06:27:43,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703a5688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:27:43, skipping insertion in model container [2022-07-14 06:27:43,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:27:43" (2/3) ... [2022-07-14 06:27:43,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@703a5688 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:27:43, skipping insertion in model container [2022-07-14 06:27:43,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:27:43" (3/3) ... [2022-07-14 06:27:43,935 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0214_1.i [2022-07-14 06:27:43,944 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:27:43,944 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 57 error locations. [2022-07-14 06:27:43,986 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:27:43,992 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@47729d93, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@b0ee20d [2022-07-14 06:27:43,992 INFO L358 AbstractCegarLoop]: Starting to check reachability of 57 error locations. [2022-07-14 06:27:43,997 INFO L276 IsEmpty]: Start isEmpty. Operand has 151 states, 90 states have (on average 1.9222222222222223) internal successors, (173), 147 states have internal predecessors, (173), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:27:44,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 06:27:44,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:44,015 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 06:27:44,015 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:44,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:44,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1044596682, now seen corresponding path program 1 times [2022-07-14 06:27:44,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:44,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111218229] [2022-07-14 06:27:44,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:44,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:44,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:44,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:44,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111218229] [2022-07-14 06:27:44,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111218229] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:44,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:44,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:27:44,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144414059] [2022-07-14 06:27:44,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:44,130 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-14 06:27:44,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:44,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 06:27:44,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 06:27:44,154 INFO L87 Difference]: Start difference. First operand has 151 states, 90 states have (on average 1.9222222222222223) internal successors, (173), 147 states have internal predecessors, (173), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:44,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:44,182 INFO L93 Difference]: Finished difference Result 151 states and 172 transitions. [2022-07-14 06:27:44,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 06:27:44,183 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-14 06:27:44,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:44,190 INFO L225 Difference]: With dead ends: 151 [2022-07-14 06:27:44,190 INFO L226 Difference]: Without dead ends: 148 [2022-07-14 06:27:44,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 06:27:44,194 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:44,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:27:44,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-07-14 06:27:44,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-07-14 06:27:44,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 88 states have (on average 1.8636363636363635) internal successors, (164), 144 states have internal predecessors, (164), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:27:44,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 168 transitions. [2022-07-14 06:27:44,225 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 168 transitions. Word has length 6 [2022-07-14 06:27:44,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:44,225 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 168 transitions. [2022-07-14 06:27:44,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:44,226 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 168 transitions. [2022-07-14 06:27:44,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 06:27:44,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:44,226 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:27:44,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 06:27:44,228 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:44,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:44,228 INFO L85 PathProgramCache]: Analyzing trace with hash 594339757, now seen corresponding path program 1 times [2022-07-14 06:27:44,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:44,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677357023] [2022-07-14 06:27:44,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:44,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:44,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:44,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:44,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677357023] [2022-07-14 06:27:44,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677357023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:44,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:44,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:27:44,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424754570] [2022-07-14 06:27:44,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:44,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:27:44,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:44,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:27:44,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:27:44,289 INFO L87 Difference]: Start difference. First operand 148 states and 168 transitions. Second operand has 4 states, 4 states have (on average 2.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) [2022-07-14 06:27:44,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:44,351 INFO L93 Difference]: Finished difference Result 294 states and 333 transitions. [2022-07-14 06:27:44,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:27:44,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.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 [2022-07-14 06:27:44,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:44,353 INFO L225 Difference]: With dead ends: 294 [2022-07-14 06:27:44,354 INFO L226 Difference]: Without dead ends: 294 [2022-07-14 06:27:44,355 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 [2022-07-14 06:27:44,356 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 163 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:44,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 485 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:27:44,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2022-07-14 06:27:44,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 150. [2022-07-14 06:27:44,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 90 states have (on average 1.8444444444444446) internal successors, (166), 146 states have internal predecessors, (166), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:27:44,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 170 transitions. [2022-07-14 06:27:44,372 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 170 transitions. Word has length 8 [2022-07-14 06:27:44,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:44,373 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 170 transitions. [2022-07-14 06:27:44,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.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) [2022-07-14 06:27:44,373 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2022-07-14 06:27:44,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 06:27:44,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:44,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:27:44,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 06:27:44,375 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:44,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:44,378 INFO L85 PathProgramCache]: Analyzing trace with hash 592492715, now seen corresponding path program 1 times [2022-07-14 06:27:44,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:44,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25818869] [2022-07-14 06:27:44,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:44,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:44,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:44,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:44,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25818869] [2022-07-14 06:27:44,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25818869] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:44,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:44,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-14 06:27:44,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540954939] [2022-07-14 06:27:44,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:44,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:27:44,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:44,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:27:44,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:27:44,473 INFO L87 Difference]: Start difference. First operand 150 states and 170 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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) [2022-07-14 06:27:44,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:44,608 INFO L93 Difference]: Finished difference Result 289 states and 328 transitions. [2022-07-14 06:27:44,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:27:44,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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 [2022-07-14 06:27:44,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:44,613 INFO L225 Difference]: With dead ends: 289 [2022-07-14 06:27:44,613 INFO L226 Difference]: Without dead ends: 289 [2022-07-14 06:27:44,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:27:44,619 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 148 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:44,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 223 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:27:44,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-07-14 06:27:44,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 203. [2022-07-14 06:27:44,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 203 states, 140 states have (on average 1.8285714285714285) internal successors, (256), 196 states have internal predecessors, (256), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:27:44,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 264 transitions. [2022-07-14 06:27:44,640 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 264 transitions. Word has length 8 [2022-07-14 06:27:44,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:44,641 INFO L495 AbstractCegarLoop]: Abstraction has 203 states and 264 transitions. [2022-07-14 06:27:44,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 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) [2022-07-14 06:27:44,641 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 264 transitions. [2022-07-14 06:27:44,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 06:27:44,641 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:44,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:27:44,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 06:27:44,642 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:44,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:44,642 INFO L85 PathProgramCache]: Analyzing trace with hash 592492716, now seen corresponding path program 1 times [2022-07-14 06:27:44,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:44,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410407732] [2022-07-14 06:27:44,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:44,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:44,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:44,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:44,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410407732] [2022-07-14 06:27:44,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410407732] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:44,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:44,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:27:44,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010340857] [2022-07-14 06:27:44,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:44,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:27:44,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:44,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:27:44,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:27:44,731 INFO L87 Difference]: Start difference. First operand 203 states and 264 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) 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) [2022-07-14 06:27:44,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:44,846 INFO L93 Difference]: Finished difference Result 360 states and 454 transitions. [2022-07-14 06:27:44,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:27:44,847 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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 [2022-07-14 06:27:44,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:44,848 INFO L225 Difference]: With dead ends: 360 [2022-07-14 06:27:44,848 INFO L226 Difference]: Without dead ends: 360 [2022-07-14 06:27:44,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:27:44,849 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 151 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:44,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 371 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:27:44,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2022-07-14 06:27:44,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 288. [2022-07-14 06:27:44,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 219 states have (on average 1.7945205479452055) internal successors, (393), 277 states have internal predecessors, (393), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-14 06:27:44,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 409 transitions. [2022-07-14 06:27:44,859 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 409 transitions. Word has length 8 [2022-07-14 06:27:44,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:44,859 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 409 transitions. [2022-07-14 06:27:44,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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) [2022-07-14 06:27:44,860 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 409 transitions. [2022-07-14 06:27:44,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 06:27:44,860 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:44,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:27:44,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 06:27:44,860 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:44,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:44,861 INFO L85 PathProgramCache]: Analyzing trace with hash 592492778, now seen corresponding path program 1 times [2022-07-14 06:27:44,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:44,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967109293] [2022-07-14 06:27:44,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:44,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:44,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:44,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:44,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967109293] [2022-07-14 06:27:44,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967109293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:44,929 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:44,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:27:44,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391937966] [2022-07-14 06:27:44,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:44,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:27:44,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:44,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:27:44,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:27:44,931 INFO L87 Difference]: Start difference. First operand 288 states and 409 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) 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) [2022-07-14 06:27:45,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:45,071 INFO L93 Difference]: Finished difference Result 359 states and 452 transitions. [2022-07-14 06:27:45,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:27:45,072 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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 [2022-07-14 06:27:45,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:45,073 INFO L225 Difference]: With dead ends: 359 [2022-07-14 06:27:45,073 INFO L226 Difference]: Without dead ends: 359 [2022-07-14 06:27:45,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:27:45,074 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 133 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:45,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 385 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:27:45,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-07-14 06:27:45,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 288. [2022-07-14 06:27:45,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 219 states have (on average 1.7945205479452055) internal successors, (393), 277 states have internal predecessors, (393), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-14 06:27:45,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 409 transitions. [2022-07-14 06:27:45,083 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 409 transitions. Word has length 8 [2022-07-14 06:27:45,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:45,083 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 409 transitions. [2022-07-14 06:27:45,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) 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) [2022-07-14 06:27:45,084 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 409 transitions. [2022-07-14 06:27:45,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 06:27:45,084 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:45,084 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:27:45,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 06:27:45,085 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:45,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:45,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1364890281, now seen corresponding path program 1 times [2022-07-14 06:27:45,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:45,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231813840] [2022-07-14 06:27:45,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:45,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:45,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:45,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:45,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:45,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231813840] [2022-07-14 06:27:45,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231813840] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:45,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:45,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:27:45,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146111467] [2022-07-14 06:27:45,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:45,105 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:27:45,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:45,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:27:45,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:27:45,106 INFO L87 Difference]: Start difference. First operand 288 states and 409 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:45,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:45,116 INFO L93 Difference]: Finished difference Result 391 states and 509 transitions. [2022-07-14 06:27:45,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:27:45,117 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-14 06:27:45,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:45,118 INFO L225 Difference]: With dead ends: 391 [2022-07-14 06:27:45,118 INFO L226 Difference]: Without dead ends: 391 [2022-07-14 06:27:45,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:27:45,119 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 139 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:45,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 328 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:27:45,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-07-14 06:27:45,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 290. [2022-07-14 06:27:45,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 221 states have (on average 1.7782805429864252) internal successors, (393), 279 states have internal predecessors, (393), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-14 06:27:45,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 409 transitions. [2022-07-14 06:27:45,137 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 409 transitions. Word has length 11 [2022-07-14 06:27:45,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:45,138 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 409 transitions. [2022-07-14 06:27:45,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:27:45,138 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 409 transitions. [2022-07-14 06:27:45,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 06:27:45,139 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:45,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:27:45,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 06:27:45,139 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:45,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:45,140 INFO L85 PathProgramCache]: Analyzing trace with hash 638072979, now seen corresponding path program 1 times [2022-07-14 06:27:45,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:45,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782705817] [2022-07-14 06:27:45,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:45,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:45,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:45,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:45,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782705817] [2022-07-14 06:27:45,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782705817] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:45,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:45,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:27:45,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836018379] [2022-07-14 06:27:45,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:45,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:27:45,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:45,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:27:45,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:27:45,158 INFO L87 Difference]: Start difference. First operand 290 states and 409 transitions. Second operand has 3 states, 2 states have (on average 6.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) [2022-07-14 06:27:45,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:45,225 INFO L93 Difference]: Finished difference Result 349 states and 466 transitions. [2022-07-14 06:27:45,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:27:45,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.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 [2022-07-14 06:27:45,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:45,228 INFO L225 Difference]: With dead ends: 349 [2022-07-14 06:27:45,228 INFO L226 Difference]: Without dead ends: 342 [2022-07-14 06:27:45,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:27:45,229 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 81 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:45,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 251 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:27:45,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-07-14 06:27:45,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 287. [2022-07-14 06:27:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 218 states have (on average 1.7798165137614679) internal successors, (388), 276 states have internal predecessors, (388), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-14 06:27:45,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 404 transitions. [2022-07-14 06:27:45,235 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 404 transitions. Word has length 12 [2022-07-14 06:27:45,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:45,236 INFO L495 AbstractCegarLoop]: Abstraction has 287 states and 404 transitions. [2022-07-14 06:27:45,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.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) [2022-07-14 06:27:45,236 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 404 transitions. [2022-07-14 06:27:45,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 06:27:45,236 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:45,237 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:27:45,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 06:27:45,237 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:45,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:45,237 INFO L85 PathProgramCache]: Analyzing trace with hash -529439982, now seen corresponding path program 1 times [2022-07-14 06:27:45,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:45,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804030421] [2022-07-14 06:27:45,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:45,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:45,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:27:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:45,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:45,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:45,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804030421] [2022-07-14 06:27:45,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804030421] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:45,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:45,258 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:27:45,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905023831] [2022-07-14 06:27:45,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:45,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:27:45,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:45,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:27:45,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:27:45,259 INFO L87 Difference]: Start difference. First operand 287 states and 404 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:45,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:45,277 INFO L93 Difference]: Finished difference Result 451 states and 620 transitions. [2022-07-14 06:27:45,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:27:45,277 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-07-14 06:27:45,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:45,279 INFO L225 Difference]: With dead ends: 451 [2022-07-14 06:27:45,279 INFO L226 Difference]: Without dead ends: 451 [2022-07-14 06:27:45,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:27:45,282 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 153 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:45,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 470 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:27:45,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-07-14 06:27:45,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 291. [2022-07-14 06:27:45,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 222 states have (on average 1.7567567567567568) internal successors, (390), 280 states have internal predecessors, (390), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-14 06:27:45,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 406 transitions. [2022-07-14 06:27:45,293 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 406 transitions. Word has length 14 [2022-07-14 06:27:45,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:45,293 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 406 transitions. [2022-07-14 06:27:45,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:45,297 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 406 transitions. [2022-07-14 06:27:45,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 06:27:45,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:45,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:27:45,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 06:27:45,299 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:45,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:45,299 INFO L85 PathProgramCache]: Analyzing trace with hash 279906644, now seen corresponding path program 1 times [2022-07-14 06:27:45,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:45,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584925405] [2022-07-14 06:27:45,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:45,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:45,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:27:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:45,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:45,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:45,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584925405] [2022-07-14 06:27:45,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584925405] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:45,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:45,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:27:45,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208319395] [2022-07-14 06:27:45,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:45,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:27:45,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:45,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:27:45,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:27:45,337 INFO L87 Difference]: Start difference. First operand 291 states and 406 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:45,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:45,544 INFO L93 Difference]: Finished difference Result 422 states and 514 transitions. [2022-07-14 06:27:45,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:27:45,545 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-07-14 06:27:45,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:45,546 INFO L225 Difference]: With dead ends: 422 [2022-07-14 06:27:45,546 INFO L226 Difference]: Without dead ends: 422 [2022-07-14 06:27:45,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:27:45,548 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 281 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:45,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 381 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:27:45,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-07-14 06:27:45,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 291. [2022-07-14 06:27:45,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 222 states have (on average 1.7297297297297298) internal successors, (384), 280 states have internal predecessors, (384), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-14 06:27:45,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 400 transitions. [2022-07-14 06:27:45,554 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 400 transitions. Word has length 14 [2022-07-14 06:27:45,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:45,554 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 400 transitions. [2022-07-14 06:27:45,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:45,554 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 400 transitions. [2022-07-14 06:27:45,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 06:27:45,555 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:45,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:27:45,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 06:27:45,555 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:45,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:45,555 INFO L85 PathProgramCache]: Analyzing trace with hash 279906645, now seen corresponding path program 1 times [2022-07-14 06:27:45,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:45,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291963201] [2022-07-14 06:27:45,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:45,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:45,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:45,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:27:45,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:45,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:45,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:45,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291963201] [2022-07-14 06:27:45,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291963201] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:45,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:45,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:27:45,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787101845] [2022-07-14 06:27:45,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:45,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:27:45,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:45,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:27:45,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:27:45,684 INFO L87 Difference]: Start difference. First operand 291 states and 400 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:45,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:45,874 INFO L93 Difference]: Finished difference Result 331 states and 409 transitions. [2022-07-14 06:27:45,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:27:45,874 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-07-14 06:27:45,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:45,876 INFO L225 Difference]: With dead ends: 331 [2022-07-14 06:27:45,876 INFO L226 Difference]: Without dead ends: 331 [2022-07-14 06:27:45,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:27:45,878 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 103 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:45,879 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 657 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:27:45,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-07-14 06:27:45,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 295. [2022-07-14 06:27:45,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 226 states have (on average 1.7212389380530972) internal successors, (389), 282 states have internal predecessors, (389), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-14 06:27:45,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 405 transitions. [2022-07-14 06:27:45,887 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 405 transitions. Word has length 14 [2022-07-14 06:27:45,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:45,888 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 405 transitions. [2022-07-14 06:27:45,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:45,888 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 405 transitions. [2022-07-14 06:27:45,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:27:45,890 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:45,890 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:27:45,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 06:27:45,890 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:45,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:45,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1443078130, now seen corresponding path program 1 times [2022-07-14 06:27:45,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:45,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835905101] [2022-07-14 06:27:45,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:45,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:45,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 06:27:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:45,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:45,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:45,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835905101] [2022-07-14 06:27:45,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835905101] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:45,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:45,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:27:45,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577734396] [2022-07-14 06:27:45,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:45,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:27:45,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:45,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:27:45,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:27:45,960 INFO L87 Difference]: Start difference. First operand 295 states and 405 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:46,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:46,116 INFO L93 Difference]: Finished difference Result 482 states and 619 transitions. [2022-07-14 06:27:46,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:27:46,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-14 06:27:46,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:46,118 INFO L225 Difference]: With dead ends: 482 [2022-07-14 06:27:46,118 INFO L226 Difference]: Without dead ends: 482 [2022-07-14 06:27:46,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:27:46,119 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 272 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:46,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 388 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:27:46,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2022-07-14 06:27:46,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 301. [2022-07-14 06:27:46,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 232 states have (on average 1.7025862068965518) internal successors, (395), 288 states have internal predecessors, (395), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-14 06:27:46,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 411 transitions. [2022-07-14 06:27:46,127 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 411 transitions. Word has length 17 [2022-07-14 06:27:46,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:46,128 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 411 transitions. [2022-07-14 06:27:46,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:46,128 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 411 transitions. [2022-07-14 06:27:46,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:27:46,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:46,128 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:27:46,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 06:27:46,129 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:46,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:46,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1443078131, now seen corresponding path program 1 times [2022-07-14 06:27:46,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:46,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089963778] [2022-07-14 06:27:46,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:46,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:46,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 06:27:46,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:46,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:46,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089963778] [2022-07-14 06:27:46,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089963778] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:46,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:46,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:27:46,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165286786] [2022-07-14 06:27:46,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:46,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:27:46,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:46,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:27:46,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:27:46,172 INFO L87 Difference]: Start difference. First operand 301 states and 411 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:46,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:46,261 INFO L93 Difference]: Finished difference Result 350 states and 431 transitions. [2022-07-14 06:27:46,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:27:46,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-07-14 06:27:46,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:46,263 INFO L225 Difference]: With dead ends: 350 [2022-07-14 06:27:46,263 INFO L226 Difference]: Without dead ends: 350 [2022-07-14 06:27:46,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:27:46,263 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 190 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:46,263 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 392 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:27:46,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2022-07-14 06:27:46,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 301. [2022-07-14 06:27:46,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 232 states have (on average 1.6767241379310345) internal successors, (389), 288 states have internal predecessors, (389), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-14 06:27:46,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 405 transitions. [2022-07-14 06:27:46,268 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 405 transitions. Word has length 17 [2022-07-14 06:27:46,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:46,268 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 405 transitions. [2022-07-14 06:27:46,268 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:46,269 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 405 transitions. [2022-07-14 06:27:46,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 06:27:46,269 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:46,269 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] [2022-07-14 06:27:46,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 06:27:46,269 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:46,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:46,269 INFO L85 PathProgramCache]: Analyzing trace with hash 534459326, now seen corresponding path program 1 times [2022-07-14 06:27:46,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:46,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225852410] [2022-07-14 06:27:46,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:46,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:46,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:27:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:46,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:46,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:46,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225852410] [2022-07-14 06:27:46,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225852410] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:46,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:46,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:27:46,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213692984] [2022-07-14 06:27:46,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:46,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:27:46,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:46,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:27:46,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:27:46,312 INFO L87 Difference]: Start difference. First operand 301 states and 405 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:46,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:46,381 INFO L93 Difference]: Finished difference Result 397 states and 512 transitions. [2022-07-14 06:27:46,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:27:46,382 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-14 06:27:46,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:46,383 INFO L225 Difference]: With dead ends: 397 [2022-07-14 06:27:46,383 INFO L226 Difference]: Without dead ends: 397 [2022-07-14 06:27:46,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:27:46,384 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 141 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:46,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 281 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:27:46,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-07-14 06:27:46,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 298. [2022-07-14 06:27:46,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 232 states have (on average 1.6508620689655173) internal successors, (383), 285 states have internal predecessors, (383), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-14 06:27:46,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 399 transitions. [2022-07-14 06:27:46,390 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 399 transitions. Word has length 20 [2022-07-14 06:27:46,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:46,390 INFO L495 AbstractCegarLoop]: Abstraction has 298 states and 399 transitions. [2022-07-14 06:27:46,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:46,390 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 399 transitions. [2022-07-14 06:27:46,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 06:27:46,391 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:46,391 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] [2022-07-14 06:27:46,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 06:27:46,391 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:46,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:46,392 INFO L85 PathProgramCache]: Analyzing trace with hash 534459327, now seen corresponding path program 1 times [2022-07-14 06:27:46,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:46,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801515652] [2022-07-14 06:27:46,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:46,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:46,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:46,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:27:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:46,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:46,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:46,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801515652] [2022-07-14 06:27:46,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801515652] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:46,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:46,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:27:46,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647027743] [2022-07-14 06:27:46,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:46,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:27:46,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:46,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:27:46,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:27:46,426 INFO L87 Difference]: Start difference. First operand 298 states and 399 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:46,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:46,556 INFO L93 Difference]: Finished difference Result 517 states and 636 transitions. [2022-07-14 06:27:46,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:27:46,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-07-14 06:27:46,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:46,558 INFO L225 Difference]: With dead ends: 517 [2022-07-14 06:27:46,558 INFO L226 Difference]: Without dead ends: 517 [2022-07-14 06:27:46,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:27:46,559 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 376 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:46,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 456 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:27:46,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2022-07-14 06:27:46,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 301. [2022-07-14 06:27:46,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 236 states have (on average 1.63135593220339) internal successors, (385), 288 states have internal predecessors, (385), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-14 06:27:46,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 401 transitions. [2022-07-14 06:27:46,566 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 401 transitions. Word has length 20 [2022-07-14 06:27:46,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:46,566 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 401 transitions. [2022-07-14 06:27:46,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:46,567 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 401 transitions. [2022-07-14 06:27:46,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:27:46,567 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:46,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:27:46,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 06:27:46,568 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:46,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:46,568 INFO L85 PathProgramCache]: Analyzing trace with hash -611630038, now seen corresponding path program 1 times [2022-07-14 06:27:46,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:46,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799696117] [2022-07-14 06:27:46,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:46,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:46,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:27:46,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:46,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:46,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:46,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799696117] [2022-07-14 06:27:46,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799696117] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:46,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:46,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:27:46,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209404075] [2022-07-14 06:27:46,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:46,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:27:46,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:46,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:27:46,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:27:46,615 INFO L87 Difference]: Start difference. First operand 301 states and 401 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:46,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:46,727 INFO L93 Difference]: Finished difference Result 516 states and 634 transitions. [2022-07-14 06:27:46,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:27:46,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-07-14 06:27:46,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:46,729 INFO L225 Difference]: With dead ends: 516 [2022-07-14 06:27:46,729 INFO L226 Difference]: Without dead ends: 516 [2022-07-14 06:27:46,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:27:46,731 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 442 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:46,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 407 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:27:46,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2022-07-14 06:27:46,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 303. [2022-07-14 06:27:46,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 238 states have (on average 1.6260504201680672) internal successors, (387), 290 states have internal predecessors, (387), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-14 06:27:46,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 403 transitions. [2022-07-14 06:27:46,738 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 403 transitions. Word has length 21 [2022-07-14 06:27:46,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:46,738 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 403 transitions. [2022-07-14 06:27:46,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:46,739 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 403 transitions. [2022-07-14 06:27:46,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:27:46,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:46,741 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] [2022-07-14 06:27:46,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 06:27:46,741 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:46,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:46,742 INFO L85 PathProgramCache]: Analyzing trace with hash -611574334, now seen corresponding path program 1 times [2022-07-14 06:27:46,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:46,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142222041] [2022-07-14 06:27:46,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:46,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:46,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:46,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:27:46,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:46,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:46,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:46,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142222041] [2022-07-14 06:27:46,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142222041] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:46,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:46,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:27:46,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102518352] [2022-07-14 06:27:46,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:46,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:27:46,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:46,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:27:46,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:27:46,834 INFO L87 Difference]: Start difference. First operand 303 states and 403 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:46,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:46,880 INFO L93 Difference]: Finished difference Result 336 states and 405 transitions. [2022-07-14 06:27:46,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:27:46,881 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-07-14 06:27:46,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:46,882 INFO L225 Difference]: With dead ends: 336 [2022-07-14 06:27:46,882 INFO L226 Difference]: Without dead ends: 336 [2022-07-14 06:27:46,882 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:27:46,882 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 348 mSDsluCounter, 895 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:46,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1140 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:27:46,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-07-14 06:27:46,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 303. [2022-07-14 06:27:46,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 238 states have (on average 1.6176470588235294) internal successors, (385), 290 states have internal predecessors, (385), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-14 06:27:46,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 401 transitions. [2022-07-14 06:27:46,888 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 401 transitions. Word has length 21 [2022-07-14 06:27:46,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:46,890 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 401 transitions. [2022-07-14 06:27:46,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:46,890 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 401 transitions. [2022-07-14 06:27:46,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:27:46,890 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:46,891 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] [2022-07-14 06:27:46,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 06:27:46,891 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:46,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:46,891 INFO L85 PathProgramCache]: Analyzing trace with hash -611572412, now seen corresponding path program 1 times [2022-07-14 06:27:46,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:46,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574320427] [2022-07-14 06:27:46,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:46,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:46,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:27:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:46,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:46,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:46,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574320427] [2022-07-14 06:27:46,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574320427] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:46,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:46,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:27:46,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464915461] [2022-07-14 06:27:46,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:46,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:27:46,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:46,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:27:46,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:27:46,968 INFO L87 Difference]: Start difference. First operand 303 states and 401 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:47,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:47,020 INFO L93 Difference]: Finished difference Result 326 states and 391 transitions. [2022-07-14 06:27:47,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:27:47,020 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-07-14 06:27:47,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:47,021 INFO L225 Difference]: With dead ends: 326 [2022-07-14 06:27:47,021 INFO L226 Difference]: Without dead ends: 326 [2022-07-14 06:27:47,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:27:47,022 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 337 mSDsluCounter, 889 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 337 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:47,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [337 Valid, 1130 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:27:47,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-07-14 06:27:47,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 293. [2022-07-14 06:27:47,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 230 states have (on average 1.6130434782608696) internal successors, (371), 280 states have internal predecessors, (371), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-07-14 06:27:47,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 387 transitions. [2022-07-14 06:27:47,027 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 387 transitions. Word has length 21 [2022-07-14 06:27:47,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:47,027 INFO L495 AbstractCegarLoop]: Abstraction has 293 states and 387 transitions. [2022-07-14 06:27:47,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:47,027 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 387 transitions. [2022-07-14 06:27:47,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 06:27:47,028 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:47,028 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] [2022-07-14 06:27:47,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 06:27:47,028 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:47,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:47,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1215813558, now seen corresponding path program 1 times [2022-07-14 06:27:47,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:47,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006543389] [2022-07-14 06:27:47,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:47,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:47,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:47,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 06:27:47,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:47,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:47,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:47,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006543389] [2022-07-14 06:27:47,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006543389] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:47,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:47,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:27:47,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699770098] [2022-07-14 06:27:47,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:47,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:27:47,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:47,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:27:47,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:27:47,223 INFO L87 Difference]: Start difference. First operand 293 states and 387 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:47,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:47,701 INFO L93 Difference]: Finished difference Result 410 states and 523 transitions. [2022-07-14 06:27:47,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:27:47,702 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-07-14 06:27:47,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:47,703 INFO L225 Difference]: With dead ends: 410 [2022-07-14 06:27:47,703 INFO L226 Difference]: Without dead ends: 408 [2022-07-14 06:27:47,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-07-14 06:27:47,704 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 253 mSDsluCounter, 761 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:47,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 905 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:27:47,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-07-14 06:27:47,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 345. [2022-07-14 06:27:47,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 277 states have (on average 1.5884476534296028) internal successors, (440), 328 states have internal predecessors, (440), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-14 06:27:47,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 462 transitions. [2022-07-14 06:27:47,709 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 462 transitions. Word has length 23 [2022-07-14 06:27:47,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:47,709 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 462 transitions. [2022-07-14 06:27:47,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:47,709 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 462 transitions. [2022-07-14 06:27:47,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:27:47,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:47,710 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] [2022-07-14 06:27:47,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 06:27:47,710 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:47,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:47,710 INFO L85 PathProgramCache]: Analyzing trace with hash 173365089, now seen corresponding path program 1 times [2022-07-14 06:27:47,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:47,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630632807] [2022-07-14 06:27:47,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:47,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:47,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 06:27:47,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:47,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:47,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:47,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630632807] [2022-07-14 06:27:47,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630632807] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:47,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:47,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:27:47,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036891072] [2022-07-14 06:27:47,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:47,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:27:47,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:47,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:27:47,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:27:47,740 INFO L87 Difference]: Start difference. First operand 345 states and 462 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:47,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:47,878 INFO L93 Difference]: Finished difference Result 520 states and 673 transitions. [2022-07-14 06:27:47,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:27:47,879 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-07-14 06:27:47,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:47,881 INFO L225 Difference]: With dead ends: 520 [2022-07-14 06:27:47,881 INFO L226 Difference]: Without dead ends: 520 [2022-07-14 06:27:47,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:27:47,881 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 236 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:47,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 372 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:27:47,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-07-14 06:27:47,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 377. [2022-07-14 06:27:47,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 309 states have (on average 1.6181229773462784) internal successors, (500), 360 states have internal predecessors, (500), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-14 06:27:47,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 522 transitions. [2022-07-14 06:27:47,889 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 522 transitions. Word has length 25 [2022-07-14 06:27:47,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:47,889 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 522 transitions. [2022-07-14 06:27:47,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:47,889 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 522 transitions. [2022-07-14 06:27:47,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:27:47,889 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:47,890 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] [2022-07-14 06:27:47,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-14 06:27:47,890 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:47,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:47,890 INFO L85 PathProgramCache]: Analyzing trace with hash 173365090, now seen corresponding path program 1 times [2022-07-14 06:27:47,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:47,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927794208] [2022-07-14 06:27:47,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:47,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:47,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 06:27:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:47,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:47,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927794208] [2022-07-14 06:27:47,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927794208] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:47,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:47,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:27:47,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266412] [2022-07-14 06:27:47,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:47,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:27:47,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:47,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:27:47,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:27:47,985 INFO L87 Difference]: Start difference. First operand 377 states and 522 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:48,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:48,187 INFO L93 Difference]: Finished difference Result 428 states and 544 transitions. [2022-07-14 06:27:48,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:27:48,188 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-07-14 06:27:48,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:48,189 INFO L225 Difference]: With dead ends: 428 [2022-07-14 06:27:48,189 INFO L226 Difference]: Without dead ends: 428 [2022-07-14 06:27:48,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:27:48,190 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 267 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 564 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:48,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 564 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:27:48,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-07-14 06:27:48,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 377. [2022-07-14 06:27:48,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 309 states have (on average 1.5792880258899675) internal successors, (488), 360 states have internal predecessors, (488), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-14 06:27:48,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 510 transitions. [2022-07-14 06:27:48,196 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 510 transitions. Word has length 25 [2022-07-14 06:27:48,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:48,196 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 510 transitions. [2022-07-14 06:27:48,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:48,196 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 510 transitions. [2022-07-14 06:27:48,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:27:48,196 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:48,196 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] [2022-07-14 06:27:48,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 06:27:48,197 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:48,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:48,197 INFO L85 PathProgramCache]: Analyzing trace with hash -560017875, now seen corresponding path program 1 times [2022-07-14 06:27:48,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:48,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736520465] [2022-07-14 06:27:48,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:48,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:48,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:27:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:48,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:48,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:48,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736520465] [2022-07-14 06:27:48,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736520465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:48,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:48,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:27:48,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734781294] [2022-07-14 06:27:48,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:48,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:27:48,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:48,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:27:48,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:27:48,291 INFO L87 Difference]: Start difference. First operand 377 states and 510 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:48,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:48,529 INFO L93 Difference]: Finished difference Result 667 states and 867 transitions. [2022-07-14 06:27:48,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:27:48,530 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-07-14 06:27:48,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:48,532 INFO L225 Difference]: With dead ends: 667 [2022-07-14 06:27:48,532 INFO L226 Difference]: Without dead ends: 667 [2022-07-14 06:27:48,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:27:48,533 INFO L413 NwaCegarLoop]: 243 mSDtfsCounter, 391 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:48,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1187 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:27:48,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-07-14 06:27:48,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 439. [2022-07-14 06:27:48,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 368 states have (on average 1.546195652173913) internal successors, (569), 419 states have internal predecessors, (569), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-14 06:27:48,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 595 transitions. [2022-07-14 06:27:48,540 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 595 transitions. Word has length 25 [2022-07-14 06:27:48,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:48,540 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 595 transitions. [2022-07-14 06:27:48,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:48,541 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 595 transitions. [2022-07-14 06:27:48,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 06:27:48,541 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:48,541 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] [2022-07-14 06:27:48,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-14 06:27:48,541 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:48,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:48,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1306109328, now seen corresponding path program 1 times [2022-07-14 06:27:48,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:48,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188610210] [2022-07-14 06:27:48,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:48,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:48,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:27:48,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:48,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:48,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:48,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188610210] [2022-07-14 06:27:48,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188610210] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:48,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:48,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:27:48,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695836398] [2022-07-14 06:27:48,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:48,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:27:48,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:48,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:27:48,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:27:48,631 INFO L87 Difference]: Start difference. First operand 439 states and 595 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:48,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:48,860 INFO L93 Difference]: Finished difference Result 552 states and 696 transitions. [2022-07-14 06:27:48,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:27:48,861 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-07-14 06:27:48,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:48,863 INFO L225 Difference]: With dead ends: 552 [2022-07-14 06:27:48,863 INFO L226 Difference]: Without dead ends: 552 [2022-07-14 06:27:48,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:27:48,864 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 991 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:48,864 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 372 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:27:48,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2022-07-14 06:27:48,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 455. [2022-07-14 06:27:48,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 389 states have (on average 1.5295629820051413) internal successors, (595), 434 states have internal predecessors, (595), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-14 06:27:48,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 623 transitions. [2022-07-14 06:27:48,871 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 623 transitions. Word has length 27 [2022-07-14 06:27:48,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:48,871 INFO L495 AbstractCegarLoop]: Abstraction has 455 states and 623 transitions. [2022-07-14 06:27:48,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:48,872 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 623 transitions. [2022-07-14 06:27:48,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-14 06:27:48,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:48,872 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] [2022-07-14 06:27:48,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-14 06:27:48,873 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:48,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:48,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1834683473, now seen corresponding path program 1 times [2022-07-14 06:27:48,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:48,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819885964] [2022-07-14 06:27:48,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:48,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:48,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:27:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:48,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:48,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:48,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819885964] [2022-07-14 06:27:48,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819885964] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:48,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:48,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:27:48,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895670708] [2022-07-14 06:27:48,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:48,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:27:48,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:48,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:27:48,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:27:48,925 INFO L87 Difference]: Start difference. First operand 455 states and 623 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:49,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:49,044 INFO L93 Difference]: Finished difference Result 480 states and 621 transitions. [2022-07-14 06:27:49,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:27:49,045 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 28 [2022-07-14 06:27:49,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:49,046 INFO L225 Difference]: With dead ends: 480 [2022-07-14 06:27:49,046 INFO L226 Difference]: Without dead ends: 480 [2022-07-14 06:27:49,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:27:49,047 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 420 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:49,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 871 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:27:49,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-07-14 06:27:49,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 453. [2022-07-14 06:27:49,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 389 states have (on average 1.519280205655527) internal successors, (591), 432 states have internal predecessors, (591), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-14 06:27:49,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 619 transitions. [2022-07-14 06:27:49,054 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 619 transitions. Word has length 28 [2022-07-14 06:27:49,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:49,054 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 619 transitions. [2022-07-14 06:27:49,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:49,054 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 619 transitions. [2022-07-14 06:27:49,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 06:27:49,055 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:49,055 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] [2022-07-14 06:27:49,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-14 06:27:49,055 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:49,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:49,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1486279512, now seen corresponding path program 1 times [2022-07-14 06:27:49,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:49,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206331471] [2022-07-14 06:27:49,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:49,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:49,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 06:27:49,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:49,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:49,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:49,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206331471] [2022-07-14 06:27:49,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206331471] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:49,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:49,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:27:49,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914563011] [2022-07-14 06:27:49,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:49,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:27:49,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:49,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:27:49,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:27:49,101 INFO L87 Difference]: Start difference. First operand 453 states and 619 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:49,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:49,213 INFO L93 Difference]: Finished difference Result 518 states and 681 transitions. [2022-07-14 06:27:49,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:27:49,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-07-14 06:27:49,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:49,215 INFO L225 Difference]: With dead ends: 518 [2022-07-14 06:27:49,215 INFO L226 Difference]: Without dead ends: 518 [2022-07-14 06:27:49,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:27:49,216 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 168 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:49,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 560 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:27:49,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2022-07-14 06:27:49,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 453. [2022-07-14 06:27:49,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 389 states have (on average 1.5141388174807198) internal successors, (589), 432 states have internal predecessors, (589), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-14 06:27:49,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 617 transitions. [2022-07-14 06:27:49,223 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 617 transitions. Word has length 29 [2022-07-14 06:27:49,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:49,223 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 617 transitions. [2022-07-14 06:27:49,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:49,223 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 617 transitions. [2022-07-14 06:27:49,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 06:27:49,224 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:49,224 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] [2022-07-14 06:27:49,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-14 06:27:49,224 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:49,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:49,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1169975593, now seen corresponding path program 1 times [2022-07-14 06:27:49,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:49,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457957174] [2022-07-14 06:27:49,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:49,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:49,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 06:27:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:49,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:49,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457957174] [2022-07-14 06:27:49,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457957174] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:49,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:49,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:27:49,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780588605] [2022-07-14 06:27:49,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:49,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:27:49,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:49,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:27:49,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:27:49,295 INFO L87 Difference]: Start difference. First operand 453 states and 617 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:49,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:49,421 INFO L93 Difference]: Finished difference Result 565 states and 746 transitions. [2022-07-14 06:27:49,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:27:49,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-07-14 06:27:49,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:49,423 INFO L225 Difference]: With dead ends: 565 [2022-07-14 06:27:49,423 INFO L226 Difference]: Without dead ends: 565 [2022-07-14 06:27:49,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:27:49,423 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 161 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:49,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 513 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:27:49,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-07-14 06:27:49,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 493. [2022-07-14 06:27:49,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 426 states have (on average 1.5046948356807512) internal successors, (641), 470 states have internal predecessors, (641), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 06:27:49,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 673 transitions. [2022-07-14 06:27:49,431 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 673 transitions. Word has length 30 [2022-07-14 06:27:49,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:49,432 INFO L495 AbstractCegarLoop]: Abstraction has 493 states and 673 transitions. [2022-07-14 06:27:49,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:49,432 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 673 transitions. [2022-07-14 06:27:49,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 06:27:49,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:49,433 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] [2022-07-14 06:27:49,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-14 06:27:49,433 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:49,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:49,433 INFO L85 PathProgramCache]: Analyzing trace with hash 2100742417, now seen corresponding path program 1 times [2022-07-14 06:27:49,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:49,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931508304] [2022-07-14 06:27:49,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:49,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:49,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:49,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:27:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:49,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:49,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:49,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931508304] [2022-07-14 06:27:49,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931508304] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:49,531 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:49,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:27:49,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901610127] [2022-07-14 06:27:49,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:49,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:27:49,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:49,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:27:49,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:27:49,533 INFO L87 Difference]: Start difference. First operand 493 states and 673 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:49,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:49,873 INFO L93 Difference]: Finished difference Result 585 states and 737 transitions. [2022-07-14 06:27:49,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:27:49,874 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-07-14 06:27:49,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:49,875 INFO L225 Difference]: With dead ends: 585 [2022-07-14 06:27:49,875 INFO L226 Difference]: Without dead ends: 585 [2022-07-14 06:27:49,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:27:49,876 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 779 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 781 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:49,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [781 Valid, 740 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:27:49,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2022-07-14 06:27:49,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 491. [2022-07-14 06:27:49,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 426 states have (on average 1.4953051643192488) internal successors, (637), 468 states have internal predecessors, (637), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 06:27:49,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 669 transitions. [2022-07-14 06:27:49,883 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 669 transitions. Word has length 30 [2022-07-14 06:27:49,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:49,883 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 669 transitions. [2022-07-14 06:27:49,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:49,883 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 669 transitions. [2022-07-14 06:27:49,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 06:27:49,884 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:49,884 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, 1] [2022-07-14 06:27:49,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-14 06:27:49,884 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:49,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:49,885 INFO L85 PathProgramCache]: Analyzing trace with hash -252550768, now seen corresponding path program 1 times [2022-07-14 06:27:49,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:49,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274082180] [2022-07-14 06:27:49,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:49,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:49,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 06:27:49,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:49,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:49,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:49,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274082180] [2022-07-14 06:27:49,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274082180] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:49,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:49,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:27:49,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363249506] [2022-07-14 06:27:49,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:49,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:27:49,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:49,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:27:49,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:27:49,920 INFO L87 Difference]: Start difference. First operand 491 states and 669 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:49,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:49,940 INFO L93 Difference]: Finished difference Result 581 states and 776 transitions. [2022-07-14 06:27:49,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:27:49,940 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-07-14 06:27:49,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:49,941 INFO L225 Difference]: With dead ends: 581 [2022-07-14 06:27:49,942 INFO L226 Difference]: Without dead ends: 581 [2022-07-14 06:27:49,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:27:49,942 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 196 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:49,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 630 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:27:49,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2022-07-14 06:27:49,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 491. [2022-07-14 06:27:49,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 426 states have (on average 1.4859154929577465) internal successors, (633), 468 states have internal predecessors, (633), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 06:27:49,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 665 transitions. [2022-07-14 06:27:49,949 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 665 transitions. Word has length 32 [2022-07-14 06:27:49,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:49,949 INFO L495 AbstractCegarLoop]: Abstraction has 491 states and 665 transitions. [2022-07-14 06:27:49,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 4 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:49,950 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 665 transitions. [2022-07-14 06:27:49,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 06:27:49,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:49,950 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, 1] [2022-07-14 06:27:49,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-14 06:27:49,950 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:49,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:49,951 INFO L85 PathProgramCache]: Analyzing trace with hash -252548846, now seen corresponding path program 1 times [2022-07-14 06:27:49,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:49,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198044063] [2022-07-14 06:27:49,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:49,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:49,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 06:27:49,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:50,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:50,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:50,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198044063] [2022-07-14 06:27:50,009 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198044063] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:50,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:50,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:27:50,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123578673] [2022-07-14 06:27:50,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:50,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:27:50,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:50,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:27:50,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:27:50,011 INFO L87 Difference]: Start difference. First operand 491 states and 665 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:50,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:50,168 INFO L93 Difference]: Finished difference Result 750 states and 983 transitions. [2022-07-14 06:27:50,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:27:50,169 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-07-14 06:27:50,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:50,170 INFO L225 Difference]: With dead ends: 750 [2022-07-14 06:27:50,171 INFO L226 Difference]: Without dead ends: 750 [2022-07-14 06:27:50,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:27:50,171 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 464 mSDsluCounter, 776 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:50,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1000 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:27:50,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2022-07-14 06:27:50,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 488. [2022-07-14 06:27:50,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 426 states have (on average 1.4530516431924883) internal successors, (619), 465 states have internal predecessors, (619), 16 states have call successors, (16), 8 states have call predecessors, (16), 8 states have return successors, (16), 14 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-14 06:27:50,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 651 transitions. [2022-07-14 06:27:50,179 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 651 transitions. Word has length 32 [2022-07-14 06:27:50,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:50,179 INFO L495 AbstractCegarLoop]: Abstraction has 488 states and 651 transitions. [2022-07-14 06:27:50,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:50,180 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 651 transitions. [2022-07-14 06:27:50,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 06:27:50,180 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:50,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:27:50,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-14 06:27:50,181 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:50,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:50,181 INFO L85 PathProgramCache]: Analyzing trace with hash -934879925, now seen corresponding path program 1 times [2022-07-14 06:27:50,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:50,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098629372] [2022-07-14 06:27:50,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:50,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:50,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:50,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 06:27:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:50,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:50,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:50,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098629372] [2022-07-14 06:27:50,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098629372] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:50,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:50,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:27:50,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343156115] [2022-07-14 06:27:50,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:50,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:27:50,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:50,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:27:50,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:27:50,255 INFO L87 Difference]: Start difference. First operand 488 states and 651 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:50,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:50,594 INFO L93 Difference]: Finished difference Result 925 states and 1213 transitions. [2022-07-14 06:27:50,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:27:50,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-07-14 06:27:50,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:50,597 INFO L225 Difference]: With dead ends: 925 [2022-07-14 06:27:50,597 INFO L226 Difference]: Without dead ends: 925 [2022-07-14 06:27:50,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:27:50,598 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 351 mSDsluCounter, 620 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:50,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 834 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:27:50,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2022-07-14 06:27:50,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 557. [2022-07-14 06:27:50,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 557 states, 489 states have (on average 1.4355828220858895) internal successors, (702), 530 states have internal predecessors, (702), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-07-14 06:27:50,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 742 transitions. [2022-07-14 06:27:50,607 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 742 transitions. Word has length 32 [2022-07-14 06:27:50,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:50,607 INFO L495 AbstractCegarLoop]: Abstraction has 557 states and 742 transitions. [2022-07-14 06:27:50,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:50,607 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 742 transitions. [2022-07-14 06:27:50,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-14 06:27:50,608 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:50,608 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 06:27:50,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-14 06:27:50,608 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:50,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:50,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1427861429, now seen corresponding path program 1 times [2022-07-14 06:27:50,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:50,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605888455] [2022-07-14 06:27:50,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:50,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:50,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:50,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 06:27:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:50,626 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:50,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:50,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605888455] [2022-07-14 06:27:50,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605888455] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:27:50,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683440136] [2022-07-14 06:27:50,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:50,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:50,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:27:50,629 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:27:50,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 06:27:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:50,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 06:27:50,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:27:50,729 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:27:50,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:27:50,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683440136] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:50,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:27:50,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2022-07-14 06:27:50,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515618504] [2022-07-14 06:27:50,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:50,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:27:50,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:50,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:27:50,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:27:50,731 INFO L87 Difference]: Start difference. First operand 557 states and 742 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:50,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:50,737 INFO L93 Difference]: Finished difference Result 566 states and 750 transitions. [2022-07-14 06:27:50,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:27:50,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-07-14 06:27:50,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:50,739 INFO L225 Difference]: With dead ends: 566 [2022-07-14 06:27:50,739 INFO L226 Difference]: Without dead ends: 565 [2022-07-14 06:27:50,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:27:50,740 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:50,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 281 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:27:50,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-07-14 06:27:50,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 561. [2022-07-14 06:27:50,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 561 states, 493 states have (on average 1.4300202839756593) internal successors, (705), 534 states have internal predecessors, (705), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 16 states have call predecessors, (20), 20 states have call successors, (20) [2022-07-14 06:27:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 745 transitions. [2022-07-14 06:27:50,747 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 745 transitions. Word has length 33 [2022-07-14 06:27:50,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:50,747 INFO L495 AbstractCegarLoop]: Abstraction has 561 states and 745 transitions. [2022-07-14 06:27:50,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 745 transitions. [2022-07-14 06:27:50,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-14 06:27:50,748 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:50,748 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] [2022-07-14 06:27:50,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 06:27:50,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:50,962 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:50,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:50,962 INFO L85 PathProgramCache]: Analyzing trace with hash -2049457417, now seen corresponding path program 1 times [2022-07-14 06:27:50,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:50,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642855921] [2022-07-14 06:27:50,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:50,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:51,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-14 06:27:51,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:51,221 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:27:51,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:51,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642855921] [2022-07-14 06:27:51,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642855921] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:51,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:51,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 06:27:51,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737629988] [2022-07-14 06:27:51,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:51,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:27:51,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:51,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:27:51,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:27:51,223 INFO L87 Difference]: Start difference. First operand 561 states and 745 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:51,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:51,817 INFO L93 Difference]: Finished difference Result 596 states and 770 transitions. [2022-07-14 06:27:51,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 06:27:51,817 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-07-14 06:27:51,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:51,818 INFO L225 Difference]: With dead ends: 596 [2022-07-14 06:27:51,819 INFO L226 Difference]: Without dead ends: 594 [2022-07-14 06:27:51,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=85, Invalid=187, Unknown=0, NotChecked=0, Total=272 [2022-07-14 06:27:51,819 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 279 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1017 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:51,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 1017 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:27:51,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-07-14 06:27:51,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 518. [2022-07-14 06:27:51,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 453 states have (on average 1.4216335540838851) internal successors, (644), 493 states have internal predecessors, (644), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-07-14 06:27:51,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 680 transitions. [2022-07-14 06:27:51,826 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 680 transitions. Word has length 33 [2022-07-14 06:27:51,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:51,826 INFO L495 AbstractCegarLoop]: Abstraction has 518 states and 680 transitions. [2022-07-14 06:27:51,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:51,826 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 680 transitions. [2022-07-14 06:27:51,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-14 06:27:51,827 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:51,827 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, 1, 1] [2022-07-14 06:27:51,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-14 06:27:51,827 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:51,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:51,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1083493612, now seen corresponding path program 1 times [2022-07-14 06:27:51,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:51,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162781888] [2022-07-14 06:27:51,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:51,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:51,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 06:27:51,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:51,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:51,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:51,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162781888] [2022-07-14 06:27:51,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162781888] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:51,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:51,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:27:51,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363459557] [2022-07-14 06:27:51,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:51,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:27:51,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:51,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:27:51,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:27:51,926 INFO L87 Difference]: Start difference. First operand 518 states and 680 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:52,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:52,278 INFO L93 Difference]: Finished difference Result 668 states and 826 transitions. [2022-07-14 06:27:52,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:27:52,278 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-07-14 06:27:52,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:52,280 INFO L225 Difference]: With dead ends: 668 [2022-07-14 06:27:52,280 INFO L226 Difference]: Without dead ends: 668 [2022-07-14 06:27:52,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:27:52,280 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 410 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:52,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 673 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:27:52,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2022-07-14 06:27:52,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 518. [2022-07-14 06:27:52,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 453 states have (on average 1.4105960264900663) internal successors, (639), 493 states have internal predecessors, (639), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-07-14 06:27:52,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 675 transitions. [2022-07-14 06:27:52,287 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 675 transitions. Word has length 33 [2022-07-14 06:27:52,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:52,287 INFO L495 AbstractCegarLoop]: Abstraction has 518 states and 675 transitions. [2022-07-14 06:27:52,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:52,287 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 675 transitions. [2022-07-14 06:27:52,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-14 06:27:52,288 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:52,288 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, 1, 1, 1] [2022-07-14 06:27:52,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-14 06:27:52,288 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:52,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:52,288 INFO L85 PathProgramCache]: Analyzing trace with hash 2113699762, now seen corresponding path program 1 times [2022-07-14 06:27:52,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:52,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705507769] [2022-07-14 06:27:52,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:52,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:52,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:52,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 06:27:52,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:52,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:52,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:52,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705507769] [2022-07-14 06:27:52,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705507769] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:52,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:52,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:27:52,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563657690] [2022-07-14 06:27:52,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:52,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:27:52,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:52,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:27:52,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:27:52,434 INFO L87 Difference]: Start difference. First operand 518 states and 675 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:52,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:52,595 INFO L93 Difference]: Finished difference Result 556 states and 716 transitions. [2022-07-14 06:27:52,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:27:52,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-07-14 06:27:52,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:52,597 INFO L225 Difference]: With dead ends: 556 [2022-07-14 06:27:52,597 INFO L226 Difference]: Without dead ends: 556 [2022-07-14 06:27:52,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:27:52,598 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 99 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:52,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 680 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:27:52,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2022-07-14 06:27:52,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 518. [2022-07-14 06:27:52,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 518 states, 453 states have (on average 1.4061810154525387) internal successors, (637), 493 states have internal predecessors, (637), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-07-14 06:27:52,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 673 transitions. [2022-07-14 06:27:52,605 INFO L78 Accepts]: Start accepts. Automaton has 518 states and 673 transitions. Word has length 34 [2022-07-14 06:27:52,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:52,605 INFO L495 AbstractCegarLoop]: Abstraction has 518 states and 673 transitions. [2022-07-14 06:27:52,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:52,605 INFO L276 IsEmpty]: Start isEmpty. Operand 518 states and 673 transitions. [2022-07-14 06:27:52,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 06:27:52,605 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:52,605 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2022-07-14 06:27:52,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-14 06:27:52,606 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:52,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:52,606 INFO L85 PathProgramCache]: Analyzing trace with hash 949188435, now seen corresponding path program 1 times [2022-07-14 06:27:52,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:52,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265430939] [2022-07-14 06:27:52,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:52,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:52,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:52,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:27:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:52,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 06:27:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:52,626 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-07-14 06:27:52,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:52,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265430939] [2022-07-14 06:27:52,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265430939] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:52,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:52,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:27:52,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046230845] [2022-07-14 06:27:52,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:52,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:27:52,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:52,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:27:52,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:27:52,627 INFO L87 Difference]: Start difference. First operand 518 states and 673 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:27:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:52,633 INFO L93 Difference]: Finished difference Result 520 states and 675 transitions. [2022-07-14 06:27:52,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:27:52,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-07-14 06:27:52,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:52,634 INFO L225 Difference]: With dead ends: 520 [2022-07-14 06:27:52,634 INFO L226 Difference]: Without dead ends: 520 [2022-07-14 06:27:52,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:27:52,635 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:52,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 282 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:27:52,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2022-07-14 06:27:52,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 520. [2022-07-14 06:27:52,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 455 states have (on average 1.4043956043956043) internal successors, (639), 495 states have internal predecessors, (639), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 15 states have call predecessors, (18), 18 states have call successors, (18) [2022-07-14 06:27:52,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 675 transitions. [2022-07-14 06:27:52,641 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 675 transitions. Word has length 41 [2022-07-14 06:27:52,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:52,641 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 675 transitions. [2022-07-14 06:27:52,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:27:52,641 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 675 transitions. [2022-07-14 06:27:52,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 06:27:52,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:52,642 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, 1, 1, 1, 1] [2022-07-14 06:27:52,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-14 06:27:52,642 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:52,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:52,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1758535061, now seen corresponding path program 1 times [2022-07-14 06:27:52,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:52,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874891137] [2022-07-14 06:27:52,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:52,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:52,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:52,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:27:52,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:52,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-14 06:27:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:52,843 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 06:27:52,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:52,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874891137] [2022-07-14 06:27:52,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874891137] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:27:52,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228065371] [2022-07-14 06:27:52,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:52,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:52,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:27:52,845 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:27:52,882 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 06:27:52,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:52,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-14 06:27:52,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:27:53,241 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:53,241 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:27:53,377 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:27:53,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2022-07-14 06:27:53,550 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:27:53,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228065371] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:27:53,551 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:27:53,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 7, 8] total 27 [2022-07-14 06:27:53,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385998388] [2022-07-14 06:27:53,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:27:53,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-14 06:27:53,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:53,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-14 06:27:53,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=653, Unknown=0, NotChecked=0, Total=756 [2022-07-14 06:27:53,552 INFO L87 Difference]: Start difference. First operand 520 states and 675 transitions. Second operand has 28 states, 27 states have (on average 4.037037037037037) internal successors, (109), 24 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 06:27:53,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:53,872 INFO L93 Difference]: Finished difference Result 545 states and 676 transitions. [2022-07-14 06:27:53,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:27:53,872 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.037037037037037) internal successors, (109), 24 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 41 [2022-07-14 06:27:53,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:53,874 INFO L225 Difference]: With dead ends: 545 [2022-07-14 06:27:53,874 INFO L226 Difference]: Without dead ends: 545 [2022-07-14 06:27:53,874 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=755, Unknown=0, NotChecked=0, Total=930 [2022-07-14 06:27:53,875 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 1697 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 481 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1699 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:53,875 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1699 Valid, 1449 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 481 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:27:53,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2022-07-14 06:27:53,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 517. [2022-07-14 06:27:53,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 453 states have (on average 1.3995584988962473) internal successors, (634), 493 states have internal predecessors, (634), 18 states have call successors, (18), 9 states have call predecessors, (18), 9 states have return successors, (18), 14 states have call predecessors, (18), 18 states have call successors, (18) [2022-07-14 06:27:53,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 670 transitions. [2022-07-14 06:27:53,881 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 670 transitions. Word has length 41 [2022-07-14 06:27:53,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:53,881 INFO L495 AbstractCegarLoop]: Abstraction has 517 states and 670 transitions. [2022-07-14 06:27:53,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.037037037037037) internal successors, (109), 24 states have internal predecessors, (109), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 06:27:53,881 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 670 transitions. [2022-07-14 06:27:53,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 06:27:53,881 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:53,882 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:27:53,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 06:27:54,093 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,SelfDestructingSolverStorable34 [2022-07-14 06:27:54,093 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:54,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:54,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1516271307, now seen corresponding path program 1 times [2022-07-14 06:27:54,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:54,094 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441495124] [2022-07-14 06:27:54,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:54,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:54,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:27:54,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:54,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 06:27:54,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:54,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 06:27:54,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:54,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441495124] [2022-07-14 06:27:54,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441495124] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:27:54,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028129688] [2022-07-14 06:27:54,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:54,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:54,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:27:54,123 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:27:54,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 06:27:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:54,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:27:54,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:27:54,245 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:54,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:27:54,286 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 06:27:54,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028129688] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:27:54,286 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:27:54,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-07-14 06:27:54,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491069728] [2022-07-14 06:27:54,286 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:27:54,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:27:54,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:54,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:27:54,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:27:54,288 INFO L87 Difference]: Start difference. First operand 517 states and 670 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-14 06:27:54,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:54,340 INFO L93 Difference]: Finished difference Result 1213 states and 1554 transitions. [2022-07-14 06:27:54,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:27:54,341 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 44 [2022-07-14 06:27:54,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:54,344 INFO L225 Difference]: With dead ends: 1213 [2022-07-14 06:27:54,344 INFO L226 Difference]: Without dead ends: 1213 [2022-07-14 06:27:54,344 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:27:54,344 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 649 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 755 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:54,345 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 755 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:27:54,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2022-07-14 06:27:54,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 679. [2022-07-14 06:27:54,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 609 states have (on average 1.361247947454844) internal successors, (829), 649 states have internal predecessors, (829), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 20 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-14 06:27:54,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 877 transitions. [2022-07-14 06:27:54,357 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 877 transitions. Word has length 44 [2022-07-14 06:27:54,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:54,357 INFO L495 AbstractCegarLoop]: Abstraction has 679 states and 877 transitions. [2022-07-14 06:27:54,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 8 states have internal predecessors, (95), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-07-14 06:27:54,357 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 877 transitions. [2022-07-14 06:27:54,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 06:27:54,357 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:54,357 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] [2022-07-14 06:27:54,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 06:27:54,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:54,575 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:54,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:54,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2077631411, now seen corresponding path program 1 times [2022-07-14 06:27:54,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:54,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641693945] [2022-07-14 06:27:54,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:54,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:54,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:27:54,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:54,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-14 06:27:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:54,695 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:27:54,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:54,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641693945] [2022-07-14 06:27:54,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641693945] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:27:54,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43369910] [2022-07-14 06:27:54,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:54,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:54,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:27:54,696 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:27:54,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 06:27:54,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:54,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-14 06:27:54,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:27:54,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:54,988 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:27:54,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43369910] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:54,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:27:54,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 13 [2022-07-14 06:27:54,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303531891] [2022-07-14 06:27:54,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:54,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:27:54,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:54,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:27:54,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:27:54,991 INFO L87 Difference]: Start difference. First operand 679 states and 877 transitions. Second operand has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:27:55,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:55,167 INFO L93 Difference]: Finished difference Result 873 states and 1085 transitions. [2022-07-14 06:27:55,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:27:55,167 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-07-14 06:27:55,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:55,169 INFO L225 Difference]: With dead ends: 873 [2022-07-14 06:27:55,169 INFO L226 Difference]: Without dead ends: 873 [2022-07-14 06:27:55,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2022-07-14 06:27:55,170 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 517 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 517 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:55,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [517 Valid, 371 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:27:55,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2022-07-14 06:27:55,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 676. [2022-07-14 06:27:55,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 609 states have (on average 1.348111658456486) internal successors, (821), 646 states have internal predecessors, (821), 24 states have call successors, (24), 9 states have call predecessors, (24), 9 states have return successors, (24), 20 states have call predecessors, (24), 24 states have call successors, (24) [2022-07-14 06:27:55,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 869 transitions. [2022-07-14 06:27:55,180 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 869 transitions. Word has length 44 [2022-07-14 06:27:55,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:55,180 INFO L495 AbstractCegarLoop]: Abstraction has 676 states and 869 transitions. [2022-07-14 06:27:55,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.666666666666667) internal successors, (40), 6 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:27:55,180 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 869 transitions. [2022-07-14 06:27:55,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 06:27:55,180 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:55,181 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:27:55,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 06:27:55,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-14 06:27:55,396 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:55,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:55,396 INFO L85 PathProgramCache]: Analyzing trace with hash 990140495, now seen corresponding path program 1 times [2022-07-14 06:27:55,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:55,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380708587] [2022-07-14 06:27:55,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:55,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:55,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 06:27:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:55,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-14 06:27:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 06:27:55,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:55,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380708587] [2022-07-14 06:27:55,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380708587] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:27:55,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223894525] [2022-07-14 06:27:55,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:55,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:55,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:27:55,455 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:27:55,457 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 06:27:55,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:55,528 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-14 06:27:55,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:27:55,710 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:55,710 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:27:55,733 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:27:55,733 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2022-07-14 06:27:55,749 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 06:27:55,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223894525] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:27:55,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:27:55,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-07-14 06:27:55,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272813799] [2022-07-14 06:27:55,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:27:55,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:27:55,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:55,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:27:55,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:27:55,751 INFO L87 Difference]: Start difference. First operand 676 states and 869 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:27:56,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:56,223 INFO L93 Difference]: Finished difference Result 2164 states and 2713 transitions. [2022-07-14 06:27:56,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 06:27:56,223 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 46 [2022-07-14 06:27:56,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:56,229 INFO L225 Difference]: With dead ends: 2164 [2022-07-14 06:27:56,229 INFO L226 Difference]: Without dead ends: 2164 [2022-07-14 06:27:56,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2022-07-14 06:27:56,230 INFO L413 NwaCegarLoop]: 228 mSDtfsCounter, 2244 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2246 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:56,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2246 Valid, 825 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:27:56,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2164 states. [2022-07-14 06:27:56,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2164 to 831. [2022-07-14 06:27:56,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 758 states have (on average 1.3007915567282322) internal successors, (986), 791 states have internal predecessors, (986), 33 states have call successors, (33), 12 states have call predecessors, (33), 12 states have return successors, (33), 27 states have call predecessors, (33), 33 states have call successors, (33) [2022-07-14 06:27:56,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1052 transitions. [2022-07-14 06:27:56,246 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1052 transitions. Word has length 46 [2022-07-14 06:27:56,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:56,247 INFO L495 AbstractCegarLoop]: Abstraction has 831 states and 1052 transitions. [2022-07-14 06:27:56,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:27:56,247 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1052 transitions. [2022-07-14 06:27:56,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 06:27:56,247 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:56,247 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:27:56,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 06:27:56,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-07-14 06:27:56,465 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:56,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:56,466 INFO L85 PathProgramCache]: Analyzing trace with hash -201066803, now seen corresponding path program 1 times [2022-07-14 06:27:56,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:56,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132730620] [2022-07-14 06:27:56,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:56,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:56,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:27:56,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:56,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 06:27:56,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:56,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132730620] [2022-07-14 06:27:56,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132730620] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:27:56,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1971047270] [2022-07-14 06:27:56,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:56,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:56,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:27:56,500 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:27:56,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 06:27:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:56,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:27:56,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:27:56,617 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 06:27:56,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:27:56,651 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 06:27:56,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1971047270] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:27:56,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:27:56,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 5] total 7 [2022-07-14 06:27:56,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655296456] [2022-07-14 06:27:56,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:27:56,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:27:56,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:56,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:27:56,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:27:56,652 INFO L87 Difference]: Start difference. First operand 831 states and 1052 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:27:56,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:56,695 INFO L93 Difference]: Finished difference Result 2728 states and 3437 transitions. [2022-07-14 06:27:56,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:27:56,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2022-07-14 06:27:56,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:56,701 INFO L225 Difference]: With dead ends: 2728 [2022-07-14 06:27:56,702 INFO L226 Difference]: Without dead ends: 2728 [2022-07-14 06:27:56,702 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:27:56,702 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 534 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:56,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 636 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:27:56,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2728 states. [2022-07-14 06:27:56,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2728 to 1906. [2022-07-14 06:27:56,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1906 states, 1774 states have (on average 1.2953776775648254) internal successors, (2298), 1811 states have internal predecessors, (2298), 74 states have call successors, (74), 30 states have call predecessors, (74), 30 states have return successors, (74), 64 states have call predecessors, (74), 74 states have call successors, (74) [2022-07-14 06:27:56,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1906 states to 1906 states and 2446 transitions. [2022-07-14 06:27:56,729 INFO L78 Accepts]: Start accepts. Automaton has 1906 states and 2446 transitions. Word has length 45 [2022-07-14 06:27:56,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:56,729 INFO L495 AbstractCegarLoop]: Abstraction has 1906 states and 2446 transitions. [2022-07-14 06:27:56,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:27:56,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1906 states and 2446 transitions. [2022-07-14 06:27:56,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 06:27:56,730 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:56,730 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] [2022-07-14 06:27:56,754 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-14 06:27:56,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-14 06:27:56,948 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:56,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:56,948 INFO L85 PathProgramCache]: Analyzing trace with hash -202913845, now seen corresponding path program 1 times [2022-07-14 06:27:56,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:56,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956256490] [2022-07-14 06:27:56,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:56,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:57,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:27:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:57,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:57,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:57,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956256490] [2022-07-14 06:27:57,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956256490] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:27:57,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034009360] [2022-07-14 06:27:57,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:57,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:57,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:27:57,209 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:27:57,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 06:27:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:57,295 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-14 06:27:57,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:27:57,498 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:57,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:27:57,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034009360] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:57,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:27:57,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 17 [2022-07-14 06:27:57,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035380993] [2022-07-14 06:27:57,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:57,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:27:57,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:57,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:27:57,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2022-07-14 06:27:57,500 INFO L87 Difference]: Start difference. First operand 1906 states and 2446 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:57,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:57,632 INFO L93 Difference]: Finished difference Result 1954 states and 2477 transitions. [2022-07-14 06:27:57,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:27:57,632 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-07-14 06:27:57,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:57,642 INFO L225 Difference]: With dead ends: 1954 [2022-07-14 06:27:57,643 INFO L226 Difference]: Without dead ends: 1954 [2022-07-14 06:27:57,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2022-07-14 06:27:57,644 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 395 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:57,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 439 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:27:57,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2022-07-14 06:27:57,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1908. [2022-07-14 06:27:57,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1908 states, 1776 states have (on average 1.2956081081081081) internal successors, (2301), 1813 states have internal predecessors, (2301), 74 states have call successors, (74), 30 states have call predecessors, (74), 30 states have return successors, (74), 64 states have call predecessors, (74), 74 states have call successors, (74) [2022-07-14 06:27:57,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1908 states to 1908 states and 2449 transitions. [2022-07-14 06:27:57,670 INFO L78 Accepts]: Start accepts. Automaton has 1908 states and 2449 transitions. Word has length 45 [2022-07-14 06:27:57,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:57,670 INFO L495 AbstractCegarLoop]: Abstraction has 1908 states and 2449 transitions. [2022-07-14 06:27:57,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:57,671 INFO L276 IsEmpty]: Start isEmpty. Operand 1908 states and 2449 transitions. [2022-07-14 06:27:57,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 06:27:57,673 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:57,673 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] [2022-07-14 06:27:57,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-14 06:27:57,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:57,888 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:57,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:57,888 INFO L85 PathProgramCache]: Analyzing trace with hash -202913783, now seen corresponding path program 1 times [2022-07-14 06:27:57,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:57,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941231199] [2022-07-14 06:27:57,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:57,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:57,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:27:57,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:57,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:57,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:57,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941231199] [2022-07-14 06:27:57,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941231199] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:27:57,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1152157987] [2022-07-14 06:27:57,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:57,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:27:57,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:27:58,008 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:27:58,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-14 06:27:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:58,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-14 06:27:58,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:27:58,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:58,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:27:58,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1152157987] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:58,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:27:58,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 14 [2022-07-14 06:27:58,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816297012] [2022-07-14 06:27:58,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:58,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:27:58,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:58,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:27:58,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-07-14 06:27:58,323 INFO L87 Difference]: Start difference. First operand 1908 states and 2449 transitions. Second operand has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:58,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:58,450 INFO L93 Difference]: Finished difference Result 1953 states and 2475 transitions. [2022-07-14 06:27:58,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:27:58,451 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-07-14 06:27:58,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:58,454 INFO L225 Difference]: With dead ends: 1953 [2022-07-14 06:27:58,454 INFO L226 Difference]: Without dead ends: 1953 [2022-07-14 06:27:58,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-07-14 06:27:58,455 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 284 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:58,455 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 460 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:27:58,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1953 states. [2022-07-14 06:27:58,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1953 to 1905. [2022-07-14 06:27:58,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1905 states, 1774 states have (on average 1.294250281848929) internal successors, (2296), 1810 states have internal predecessors, (2296), 74 states have call successors, (74), 30 states have call predecessors, (74), 30 states have return successors, (74), 64 states have call predecessors, (74), 74 states have call successors, (74) [2022-07-14 06:27:58,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1905 states to 1905 states and 2444 transitions. [2022-07-14 06:27:58,508 INFO L78 Accepts]: Start accepts. Automaton has 1905 states and 2444 transitions. Word has length 45 [2022-07-14 06:27:58,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:58,508 INFO L495 AbstractCegarLoop]: Abstraction has 1905 states and 2444 transitions. [2022-07-14 06:27:58,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:58,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1905 states and 2444 transitions. [2022-07-14 06:27:58,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 06:27:58,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:58,509 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, 1, 1] [2022-07-14 06:27:58,549 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-14 06:27:58,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-07-14 06:27:58,727 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:58,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:58,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1987177000, now seen corresponding path program 1 times [2022-07-14 06:27:58,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:58,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232993166] [2022-07-14 06:27:58,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:58,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:59,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:27:59,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:27:59,012 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:27:59,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:27:59,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232993166] [2022-07-14 06:27:59,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232993166] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:27:59,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:27:59,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-14 06:27:59,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179802568] [2022-07-14 06:27:59,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:27:59,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-14 06:27:59,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:27:59,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 06:27:59,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:27:59,014 INFO L87 Difference]: Start difference. First operand 1905 states and 2444 transitions. Second operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:59,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:27:59,521 INFO L93 Difference]: Finished difference Result 2115 states and 2684 transitions. [2022-07-14 06:27:59,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 06:27:59,522 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-07-14 06:27:59,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:27:59,525 INFO L225 Difference]: With dead ends: 2115 [2022-07-14 06:27:59,525 INFO L226 Difference]: Without dead ends: 2115 [2022-07-14 06:27:59,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=549, Unknown=0, NotChecked=0, Total=812 [2022-07-14 06:27:59,526 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 1130 mSDsluCounter, 966 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1132 SdHoareTripleChecker+Valid, 1128 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:27:59,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1132 Valid, 1128 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:27:59,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2115 states. [2022-07-14 06:27:59,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2115 to 1965. [2022-07-14 06:27:59,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1965 states, 1827 states have (on average 1.2939244663382594) internal successors, (2364), 1864 states have internal predecessors, (2364), 78 states have call successors, (78), 34 states have call predecessors, (78), 34 states have return successors, (78), 66 states have call predecessors, (78), 78 states have call successors, (78) [2022-07-14 06:27:59,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1965 states to 1965 states and 2520 transitions. [2022-07-14 06:27:59,558 INFO L78 Accepts]: Start accepts. Automaton has 1965 states and 2520 transitions. Word has length 48 [2022-07-14 06:27:59,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:27:59,558 INFO L495 AbstractCegarLoop]: Abstraction has 1965 states and 2520 transitions. [2022-07-14 06:27:59,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:27:59,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1965 states and 2520 transitions. [2022-07-14 06:27:59,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 06:27:59,571 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:27:59,571 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, 1, 1] [2022-07-14 06:27:59,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-07-14 06:27:59,571 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:27:59,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:27:59,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1987176999, now seen corresponding path program 1 times [2022-07-14 06:27:59,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:27:59,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168947366] [2022-07-14 06:27:59,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:27:59,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:27:59,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:00,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:28:00,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:00,036 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:00,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:00,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168947366] [2022-07-14 06:28:00,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168947366] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:28:00,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:28:00,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-14 06:28:00,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582999] [2022-07-14 06:28:00,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:28:00,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-14 06:28:00,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:00,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 06:28:00,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:28:00,037 INFO L87 Difference]: Start difference. First operand 1965 states and 2520 transitions. Second operand has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:28:00,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:00,754 INFO L93 Difference]: Finished difference Result 2303 states and 2927 transitions. [2022-07-14 06:28:00,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 06:28:00,755 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-07-14 06:28:00,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:00,758 INFO L225 Difference]: With dead ends: 2303 [2022-07-14 06:28:00,758 INFO L226 Difference]: Without dead ends: 2303 [2022-07-14 06:28:00,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=527, Unknown=0, NotChecked=0, Total=756 [2022-07-14 06:28:00,759 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 1560 mSDsluCounter, 877 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1560 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:00,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1560 Valid, 1037 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:28:00,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2303 states. [2022-07-14 06:28:00,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2303 to 2169. [2022-07-14 06:28:00,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2015 states have (on average 1.3076923076923077) internal successors, (2635), 2056 states have internal predecessors, (2635), 88 states have call successors, (88), 40 states have call predecessors, (88), 40 states have return successors, (88), 72 states have call predecessors, (88), 88 states have call successors, (88) [2022-07-14 06:28:00,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 2811 transitions. [2022-07-14 06:28:00,790 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 2811 transitions. Word has length 48 [2022-07-14 06:28:00,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:00,791 INFO L495 AbstractCegarLoop]: Abstraction has 2169 states and 2811 transitions. [2022-07-14 06:28:00,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.066666666666667) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:28:00,791 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 2811 transitions. [2022-07-14 06:28:00,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 06:28:00,792 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:00,792 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, 1, 1] [2022-07-14 06:28:00,792 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-14 06:28:00,792 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:28:00,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:00,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1985329958, now seen corresponding path program 1 times [2022-07-14 06:28:00,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:00,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617866888] [2022-07-14 06:28:00,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:00,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:01,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:28:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:01,541 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:01,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:01,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617866888] [2022-07-14 06:28:01,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617866888] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:28:01,542 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:28:01,542 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-14 06:28:01,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141668866] [2022-07-14 06:28:01,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:28:01,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-14 06:28:01,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:01,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 06:28:01,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:28:01,543 INFO L87 Difference]: Start difference. First operand 2169 states and 2811 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:28:02,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:02,265 INFO L93 Difference]: Finished difference Result 2215 states and 2859 transitions. [2022-07-14 06:28:02,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 06:28:02,266 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2022-07-14 06:28:02,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:02,270 INFO L225 Difference]: With dead ends: 2215 [2022-07-14 06:28:02,270 INFO L226 Difference]: Without dead ends: 2215 [2022-07-14 06:28:02,270 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=531, Unknown=0, NotChecked=0, Total=702 [2022-07-14 06:28:02,271 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 102 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 855 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:02,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 855 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:28:02,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2215 states. [2022-07-14 06:28:02,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2215 to 2201. [2022-07-14 06:28:02,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2201 states, 2047 states have (on average 1.3043478260869565) internal successors, (2670), 2088 states have internal predecessors, (2670), 88 states have call successors, (88), 40 states have call predecessors, (88), 40 states have return successors, (88), 72 states have call predecessors, (88), 88 states have call successors, (88) [2022-07-14 06:28:02,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2201 states to 2201 states and 2846 transitions. [2022-07-14 06:28:02,301 INFO L78 Accepts]: Start accepts. Automaton has 2201 states and 2846 transitions. Word has length 48 [2022-07-14 06:28:02,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:02,301 INFO L495 AbstractCegarLoop]: Abstraction has 2201 states and 2846 transitions. [2022-07-14 06:28:02,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:28:02,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2201 states and 2846 transitions. [2022-07-14 06:28:02,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 06:28:02,303 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:02,303 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, 1, 1, 1] [2022-07-14 06:28:02,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-07-14 06:28:02,303 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:28:02,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:02,303 INFO L85 PathProgramCache]: Analyzing trace with hash -894968564, now seen corresponding path program 1 times [2022-07-14 06:28:02,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:02,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821237080] [2022-07-14 06:28:02,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:02,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:02,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:28:02,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:02,501 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:02,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:02,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821237080] [2022-07-14 06:28:02,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821237080] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:28:02,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:28:02,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 06:28:02,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673169974] [2022-07-14 06:28:02,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:28:02,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:28:02,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:02,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:28:02,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:28:02,503 INFO L87 Difference]: Start difference. First operand 2201 states and 2846 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:28:03,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:03,111 INFO L93 Difference]: Finished difference Result 2921 states and 3720 transitions. [2022-07-14 06:28:03,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 06:28:03,112 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-07-14 06:28:03,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:03,117 INFO L225 Difference]: With dead ends: 2921 [2022-07-14 06:28:03,117 INFO L226 Difference]: Without dead ends: 2921 [2022-07-14 06:28:03,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2022-07-14 06:28:03,117 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 984 mSDsluCounter, 1146 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 986 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:03,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [986 Valid, 1318 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:28:03,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2921 states. [2022-07-14 06:28:03,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2921 to 2503. [2022-07-14 06:28:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2503 states, 2311 states have (on average 1.3033318909562959) internal successors, (3012), 2376 states have internal predecessors, (3012), 119 states have call successors, (119), 47 states have call predecessors, (119), 47 states have return successors, (119), 79 states have call predecessors, (119), 119 states have call successors, (119) [2022-07-14 06:28:03,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2503 states to 2503 states and 3250 transitions. [2022-07-14 06:28:03,153 INFO L78 Accepts]: Start accepts. Automaton has 2503 states and 3250 transitions. Word has length 49 [2022-07-14 06:28:03,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:03,153 INFO L495 AbstractCegarLoop]: Abstraction has 2503 states and 3250 transitions. [2022-07-14 06:28:03,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:28:03,153 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 3250 transitions. [2022-07-14 06:28:03,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 06:28:03,154 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:03,154 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, 1, 1, 1] [2022-07-14 06:28:03,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-07-14 06:28:03,154 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:28:03,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:03,155 INFO L85 PathProgramCache]: Analyzing trace with hash -894968563, now seen corresponding path program 1 times [2022-07-14 06:28:03,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:03,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644361477] [2022-07-14 06:28:03,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:03,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:03,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:03,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:28:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:03,449 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:03,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:03,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644361477] [2022-07-14 06:28:03,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644361477] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:28:03,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:28:03,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 06:28:03,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225710835] [2022-07-14 06:28:03,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:28:03,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:28:03,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:03,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:28:03,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:28:03,452 INFO L87 Difference]: Start difference. First operand 2503 states and 3250 transitions. Second operand has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:28:03,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:03,948 INFO L93 Difference]: Finished difference Result 3034 states and 3868 transitions. [2022-07-14 06:28:03,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 06:28:03,948 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-07-14 06:28:03,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:03,953 INFO L225 Difference]: With dead ends: 3034 [2022-07-14 06:28:03,953 INFO L226 Difference]: Without dead ends: 3034 [2022-07-14 06:28:03,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2022-07-14 06:28:03,954 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 1071 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:03,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 874 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:28:03,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3034 states. [2022-07-14 06:28:04,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3034 to 2696. [2022-07-14 06:28:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2696 states, 2488 states have (on average 1.3135048231511255) internal successors, (3268), 2557 states have internal predecessors, (3268), 129 states have call successors, (129), 53 states have call predecessors, (129), 53 states have return successors, (129), 85 states have call predecessors, (129), 129 states have call successors, (129) [2022-07-14 06:28:04,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 3526 transitions. [2022-07-14 06:28:04,009 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 3526 transitions. Word has length 49 [2022-07-14 06:28:04,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:04,009 INFO L495 AbstractCegarLoop]: Abstraction has 2696 states and 3526 transitions. [2022-07-14 06:28:04,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.2727272727272725) internal successors, (47), 12 states have internal predecessors, (47), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:28:04,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 3526 transitions. [2022-07-14 06:28:04,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-14 06:28:04,011 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:04,011 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, 1, 1, 1, 1] [2022-07-14 06:28:04,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-07-14 06:28:04,011 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:28:04,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:04,012 INFO L85 PathProgramCache]: Analyzing trace with hash -2031481280, now seen corresponding path program 1 times [2022-07-14 06:28:04,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:04,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499835217] [2022-07-14 06:28:04,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:04,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:04,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:04,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:28:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:04,041 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:04,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:04,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499835217] [2022-07-14 06:28:04,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499835217] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:28:04,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [932804429] [2022-07-14 06:28:04,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:04,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:28:04,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:28:04,064 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:28:04,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-14 06:28:04,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:04,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 06:28:04,175 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:28:04,222 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:04,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:28:04,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [932804429] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:28:04,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:28:04,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2022-07-14 06:28:04,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24869905] [2022-07-14 06:28:04,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:28:04,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:28:04,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:04,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:28:04,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:28:04,224 INFO L87 Difference]: Start difference. First operand 2696 states and 3526 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:28:04,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:04,246 INFO L93 Difference]: Finished difference Result 3305 states and 4345 transitions. [2022-07-14 06:28:04,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:28:04,247 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 50 [2022-07-14 06:28:04,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:04,252 INFO L225 Difference]: With dead ends: 3305 [2022-07-14 06:28:04,252 INFO L226 Difference]: Without dead ends: 3305 [2022-07-14 06:28:04,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:28:04,253 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 213 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:04,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 337 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:28:04,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3305 states. [2022-07-14 06:28:04,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3305 to 3181. [2022-07-14 06:28:04,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3181 states, 2959 states have (on average 1.3264616424467726) internal successors, (3925), 3028 states have internal predecessors, (3925), 143 states have call successors, (143), 53 states have call predecessors, (143), 53 states have return successors, (143), 99 states have call predecessors, (143), 143 states have call successors, (143) [2022-07-14 06:28:04,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 4211 transitions. [2022-07-14 06:28:04,287 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 4211 transitions. Word has length 50 [2022-07-14 06:28:04,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:04,287 INFO L495 AbstractCegarLoop]: Abstraction has 3181 states and 4211 transitions. [2022-07-14 06:28:04,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:28:04,288 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 4211 transitions. [2022-07-14 06:28:04,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-14 06:28:04,289 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:04,289 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, 1, 1, 1, 1, 1] [2022-07-14 06:28:04,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-14 06:28:04,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-07-14 06:28:04,513 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:28:04,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:04,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1111433432, now seen corresponding path program 1 times [2022-07-14 06:28:04,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:04,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645038130] [2022-07-14 06:28:04,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:04,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:04,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:05,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:28:05,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:05,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 06:28:05,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:05,056 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 06:28:05,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:05,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645038130] [2022-07-14 06:28:05,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645038130] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:28:05,078 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:28:05,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-07-14 06:28:05,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556239974] [2022-07-14 06:28:05,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:28:05,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-14 06:28:05,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:05,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-14 06:28:05,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-07-14 06:28:05,080 INFO L87 Difference]: Start difference. First operand 3181 states and 4211 transitions. Second operand has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:28:06,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:06,258 INFO L93 Difference]: Finished difference Result 3476 states and 4504 transitions. [2022-07-14 06:28:06,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 06:28:06,259 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 51 [2022-07-14 06:28:06,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:06,279 INFO L225 Difference]: With dead ends: 3476 [2022-07-14 06:28:06,280 INFO L226 Difference]: Without dead ends: 3474 [2022-07-14 06:28:06,280 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=296, Invalid=826, Unknown=0, NotChecked=0, Total=1122 [2022-07-14 06:28:06,281 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 1261 mSDsluCounter, 1936 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1261 SdHoareTripleChecker+Valid, 2126 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:06,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1261 Valid, 2126 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:28:06,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3474 states. [2022-07-14 06:28:06,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3474 to 3142. [2022-07-14 06:28:06,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3142 states, 2923 states have (on average 1.3243243243243243) internal successors, (3871), 2991 states have internal predecessors, (3871), 141 states have call successors, (141), 52 states have call predecessors, (141), 52 states have return successors, (141), 98 states have call predecessors, (141), 141 states have call successors, (141) [2022-07-14 06:28:06,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 4153 transitions. [2022-07-14 06:28:06,317 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 4153 transitions. Word has length 51 [2022-07-14 06:28:06,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:06,318 INFO L495 AbstractCegarLoop]: Abstraction has 3142 states and 4153 transitions. [2022-07-14 06:28:06,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 17 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:28:06,318 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 4153 transitions. [2022-07-14 06:28:06,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-14 06:28:06,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:06,319 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, 1, 1, 1, 1, 1] [2022-07-14 06:28:06,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-07-14 06:28:06,319 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:28:06,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:06,320 INFO L85 PathProgramCache]: Analyzing trace with hash -38812235, now seen corresponding path program 1 times [2022-07-14 06:28:06,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:06,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355529172] [2022-07-14 06:28:06,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:06,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:06,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 06:28:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:06,363 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:06,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:06,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355529172] [2022-07-14 06:28:06,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355529172] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:28:06,364 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:28:06,364 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:28:06,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536313763] [2022-07-14 06:28:06,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:28:06,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:28:06,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:06,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:28:06,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:28:06,365 INFO L87 Difference]: Start difference. First operand 3142 states and 4153 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:28:06,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:06,383 INFO L93 Difference]: Finished difference Result 3700 states and 4965 transitions. [2022-07-14 06:28:06,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:28:06,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-07-14 06:28:06,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:06,389 INFO L225 Difference]: With dead ends: 3700 [2022-07-14 06:28:06,389 INFO L226 Difference]: Without dead ends: 3700 [2022-07-14 06:28:06,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:28:06,390 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 122 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:06,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 461 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:28:06,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3700 states. [2022-07-14 06:28:06,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3700 to 2749. [2022-07-14 06:28:06,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2749 states, 2554 states have (on average 1.308535630383712) internal successors, (3342), 2618 states have internal predecessors, (3342), 126 states have call successors, (126), 43 states have call predecessors, (126), 43 states have return successors, (126), 87 states have call predecessors, (126), 126 states have call successors, (126) [2022-07-14 06:28:06,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2749 states to 2749 states and 3594 transitions. [2022-07-14 06:28:06,449 INFO L78 Accepts]: Start accepts. Automaton has 2749 states and 3594 transitions. Word has length 51 [2022-07-14 06:28:06,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:06,450 INFO L495 AbstractCegarLoop]: Abstraction has 2749 states and 3594 transitions. [2022-07-14 06:28:06,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:28:06,450 INFO L276 IsEmpty]: Start isEmpty. Operand 2749 states and 3594 transitions. [2022-07-14 06:28:06,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-14 06:28:06,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:06,451 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, 1, 1, 1, 1, 1, 1] [2022-07-14 06:28:06,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-07-14 06:28:06,451 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:28:06,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:06,452 INFO L85 PathProgramCache]: Analyzing trace with hash -86585480, now seen corresponding path program 1 times [2022-07-14 06:28:06,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:06,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917008063] [2022-07-14 06:28:06,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:06,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:06,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 06:28:06,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:06,528 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:06,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:06,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917008063] [2022-07-14 06:28:06,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917008063] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:28:06,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1718878579] [2022-07-14 06:28:06,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:06,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:28:06,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:28:06,544 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:28:06,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-14 06:28:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:06,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 06:28:06,658 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:28:06,881 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:06,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-07-14 06:28:06,957 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:28:06,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:28:07,055 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:28:07,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1718878579] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:28:07,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:28:07,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 6] total 15 [2022-07-14 06:28:07,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347384602] [2022-07-14 06:28:07,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:28:07,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-14 06:28:07,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:07,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-14 06:28:07,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2022-07-14 06:28:07,057 INFO L87 Difference]: Start difference. First operand 2749 states and 3594 transitions. Second operand has 15 states, 15 states have (on average 9.866666666666667) internal successors, (148), 15 states have internal predecessors, (148), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:28:07,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:07,712 INFO L93 Difference]: Finished difference Result 3759 states and 4929 transitions. [2022-07-14 06:28:07,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 06:28:07,713 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 9.866666666666667) internal successors, (148), 15 states have internal predecessors, (148), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 52 [2022-07-14 06:28:07,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:07,723 INFO L225 Difference]: With dead ends: 3759 [2022-07-14 06:28:07,726 INFO L226 Difference]: Without dead ends: 3751 [2022-07-14 06:28:07,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2022-07-14 06:28:07,729 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 631 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 634 SdHoareTripleChecker+Valid, 1717 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:07,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [634 Valid, 1717 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:28:07,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3751 states. [2022-07-14 06:28:07,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3751 to 2761. [2022-07-14 06:28:07,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2761 states, 2566 states have (on average 1.3059236165237724) internal successors, (3351), 2630 states have internal predecessors, (3351), 126 states have call successors, (126), 43 states have call predecessors, (126), 43 states have return successors, (126), 87 states have call predecessors, (126), 126 states have call successors, (126) [2022-07-14 06:28:07,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2761 states to 2761 states and 3603 transitions. [2022-07-14 06:28:07,824 INFO L78 Accepts]: Start accepts. Automaton has 2761 states and 3603 transitions. Word has length 52 [2022-07-14 06:28:07,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:07,824 INFO L495 AbstractCegarLoop]: Abstraction has 2761 states and 3603 transitions. [2022-07-14 06:28:07,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 9.866666666666667) internal successors, (148), 15 states have internal predecessors, (148), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:28:07,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2761 states and 3603 transitions. [2022-07-14 06:28:07,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-14 06:28:07,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:07,826 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, 1, 1, 1, 1, 1, 1] [2022-07-14 06:28:07,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-14 06:28:08,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-07-14 06:28:08,048 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:28:08,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:08,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1958066468, now seen corresponding path program 1 times [2022-07-14 06:28:08,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:08,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918543856] [2022-07-14 06:28:08,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:08,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:08,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:08,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:28:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:08,481 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:08,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:08,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918543856] [2022-07-14 06:28:08,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918543856] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:28:08,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:28:08,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-14 06:28:08,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979401387] [2022-07-14 06:28:08,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:28:08,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-14 06:28:08,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:08,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 06:28:08,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:28:08,482 INFO L87 Difference]: Start difference. First operand 2761 states and 3603 transitions. Second operand has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:28:09,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:09,611 INFO L93 Difference]: Finished difference Result 2946 states and 3803 transitions. [2022-07-14 06:28:09,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 06:28:09,611 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-07-14 06:28:09,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:09,616 INFO L225 Difference]: With dead ends: 2946 [2022-07-14 06:28:09,616 INFO L226 Difference]: Without dead ends: 2946 [2022-07-14 06:28:09,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=370, Invalid=820, Unknown=0, NotChecked=0, Total=1190 [2022-07-14 06:28:09,617 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 1251 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1251 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:09,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1251 Valid, 1246 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:28:09,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2022-07-14 06:28:09,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 2775. [2022-07-14 06:28:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2775 states, 2580 states have (on average 1.3058139534883721) internal successors, (3369), 2644 states have internal predecessors, (3369), 126 states have call successors, (126), 43 states have call predecessors, (126), 43 states have return successors, (126), 87 states have call predecessors, (126), 126 states have call successors, (126) [2022-07-14 06:28:09,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2775 states to 2775 states and 3621 transitions. [2022-07-14 06:28:09,645 INFO L78 Accepts]: Start accepts. Automaton has 2775 states and 3621 transitions. Word has length 52 [2022-07-14 06:28:09,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:09,645 INFO L495 AbstractCegarLoop]: Abstraction has 2775 states and 3621 transitions. [2022-07-14 06:28:09,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 16 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:28:09,645 INFO L276 IsEmpty]: Start isEmpty. Operand 2775 states and 3621 transitions. [2022-07-14 06:28:09,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-14 06:28:09,646 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:09,647 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, 1, 1, 1, 1, 1, 1] [2022-07-14 06:28:09,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-07-14 06:28:09,647 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:28:09,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:09,647 INFO L85 PathProgramCache]: Analyzing trace with hash 1148719842, now seen corresponding path program 1 times [2022-07-14 06:28:09,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:09,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234170520] [2022-07-14 06:28:09,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:09,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:09,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:28:09,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:09,821 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:09,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:09,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234170520] [2022-07-14 06:28:09,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234170520] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:28:09,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:28:09,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 06:28:09,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223338447] [2022-07-14 06:28:09,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:28:09,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:28:09,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:09,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:28:09,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:28:09,824 INFO L87 Difference]: Start difference. First operand 2775 states and 3621 transitions. Second operand has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:28:10,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:10,264 INFO L93 Difference]: Finished difference Result 3193 states and 4105 transitions. [2022-07-14 06:28:10,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 06:28:10,265 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2022-07-14 06:28:10,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:10,269 INFO L225 Difference]: With dead ends: 3193 [2022-07-14 06:28:10,269 INFO L226 Difference]: Without dead ends: 3193 [2022-07-14 06:28:10,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=183, Invalid=369, Unknown=0, NotChecked=0, Total=552 [2022-07-14 06:28:10,269 INFO L413 NwaCegarLoop]: 178 mSDtfsCounter, 1129 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:10,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1129 Valid, 856 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:28:10,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2022-07-14 06:28:10,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 2762. [2022-07-14 06:28:10,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2762 states, 2567 states have (on average 1.3058044409816907) internal successors, (3352), 2631 states have internal predecessors, (3352), 126 states have call successors, (126), 43 states have call predecessors, (126), 43 states have return successors, (126), 87 states have call predecessors, (126), 126 states have call successors, (126) [2022-07-14 06:28:10,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2762 states to 2762 states and 3604 transitions. [2022-07-14 06:28:10,301 INFO L78 Accepts]: Start accepts. Automaton has 2762 states and 3604 transitions. Word has length 52 [2022-07-14 06:28:10,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:10,301 INFO L495 AbstractCegarLoop]: Abstraction has 2762 states and 3604 transitions. [2022-07-14 06:28:10,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.545454545454546) internal successors, (50), 12 states have internal predecessors, (50), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:28:10,302 INFO L276 IsEmpty]: Start isEmpty. Operand 2762 states and 3604 transitions. [2022-07-14 06:28:10,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-14 06:28:10,302 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:10,303 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:28:10,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-07-14 06:28:10,303 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:28:10,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:10,303 INFO L85 PathProgramCache]: Analyzing trace with hash 1366968916, now seen corresponding path program 1 times [2022-07-14 06:28:10,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:10,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671802956] [2022-07-14 06:28:10,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:10,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:10,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:10,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:28:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:10,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 06:28:10,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:10,444 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:28:10,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:10,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671802956] [2022-07-14 06:28:10,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671802956] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:28:10,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439543663] [2022-07-14 06:28:10,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:10,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:28:10,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:28:10,447 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:28:10,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-14 06:28:10,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:10,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-14 06:28:10,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:28:10,868 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:10,868 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:28:10,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439543663] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:28:10,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:28:10,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 16 [2022-07-14 06:28:10,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808446959] [2022-07-14 06:28:10,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:28:10,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:28:10,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:10,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:28:10,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2022-07-14 06:28:10,869 INFO L87 Difference]: Start difference. First operand 2762 states and 3604 transitions. Second operand has 8 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:28:11,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:11,155 INFO L93 Difference]: Finished difference Result 3180 states and 4095 transitions. [2022-07-14 06:28:11,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:28:11,156 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2022-07-14 06:28:11,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:11,159 INFO L225 Difference]: With dead ends: 3180 [2022-07-14 06:28:11,159 INFO L226 Difference]: Without dead ends: 3180 [2022-07-14 06:28:11,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2022-07-14 06:28:11,159 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 469 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:11,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [469 Valid, 524 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:28:11,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3180 states. [2022-07-14 06:28:11,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3180 to 2760. [2022-07-14 06:28:11,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2760 states, 2567 states have (on average 1.2987923646279704) internal successors, (3334), 2629 states have internal predecessors, (3334), 126 states have call successors, (126), 43 states have call predecessors, (126), 43 states have return successors, (126), 87 states have call predecessors, (126), 126 states have call successors, (126) [2022-07-14 06:28:11,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2760 states to 2760 states and 3586 transitions. [2022-07-14 06:28:11,180 INFO L78 Accepts]: Start accepts. Automaton has 2760 states and 3586 transitions. Word has length 53 [2022-07-14 06:28:11,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:11,180 INFO L495 AbstractCegarLoop]: Abstraction has 2760 states and 3586 transitions. [2022-07-14 06:28:11,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:28:11,181 INFO L276 IsEmpty]: Start isEmpty. Operand 2760 states and 3586 transitions. [2022-07-14 06:28:11,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-14 06:28:11,181 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:11,182 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-14 06:28:11,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-14 06:28:11,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-07-14 06:28:11,404 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:28:11,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:11,404 INFO L85 PathProgramCache]: Analyzing trace with hash 633585951, now seen corresponding path program 1 times [2022-07-14 06:28:11,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:11,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205983376] [2022-07-14 06:28:11,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:11,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:11,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:11,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:28:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:11,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 06:28:11,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:11,785 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:28:11,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:11,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205983376] [2022-07-14 06:28:11,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205983376] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:28:11,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575824019] [2022-07-14 06:28:11,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:11,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:28:11,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:28:11,787 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:28:11,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-14 06:28:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:11,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-14 06:28:11,922 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:28:12,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:28:12,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-14 06:28:12,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:12,309 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 28 [2022-07-14 06:28:12,438 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-07-14 06:28:12,451 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:28:12,452 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:28:12,464 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:12,464 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:28:12,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575824019] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:28:12,589 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:28:12,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2022-07-14 06:28:12,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972529243] [2022-07-14 06:28:12,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:28:12,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-14 06:28:12,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:12,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-14 06:28:12,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1089, Unknown=0, NotChecked=0, Total=1260 [2022-07-14 06:28:12,590 INFO L87 Difference]: Start difference. First operand 2760 states and 3586 transitions. Second operand has 32 states, 31 states have (on average 3.0) internal successors, (93), 29 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:28:13,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:13,815 INFO L93 Difference]: Finished difference Result 3760 states and 4886 transitions. [2022-07-14 06:28:13,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-14 06:28:13,815 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 3.0) internal successors, (93), 29 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 53 [2022-07-14 06:28:13,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:13,833 INFO L225 Difference]: With dead ends: 3760 [2022-07-14 06:28:13,843 INFO L226 Difference]: Without dead ends: 3760 [2022-07-14 06:28:13,844 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=801, Invalid=2739, Unknown=0, NotChecked=0, Total=3540 [2022-07-14 06:28:13,844 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 2001 mSDsluCounter, 2464 mSDsCounter, 0 mSdLazyCounter, 1549 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2003 SdHoareTripleChecker+Valid, 2670 SdHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:13,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2003 Valid, 2670 Invalid, 1690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1549 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:28:13,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3760 states. [2022-07-14 06:28:13,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3760 to 2786. [2022-07-14 06:28:13,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2786 states, 2593 states have (on average 1.2892402622445045) internal successors, (3343), 2653 states have internal predecessors, (3343), 126 states have call successors, (126), 43 states have call predecessors, (126), 43 states have return successors, (126), 89 states have call predecessors, (126), 126 states have call successors, (126) [2022-07-14 06:28:13,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2786 states and 3595 transitions. [2022-07-14 06:28:13,869 INFO L78 Accepts]: Start accepts. Automaton has 2786 states and 3595 transitions. Word has length 53 [2022-07-14 06:28:13,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:13,869 INFO L495 AbstractCegarLoop]: Abstraction has 2786 states and 3595 transitions. [2022-07-14 06:28:13,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 3.0) internal successors, (93), 29 states have internal predecessors, (93), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:28:13,870 INFO L276 IsEmpty]: Start isEmpty. Operand 2786 states and 3595 transitions. [2022-07-14 06:28:13,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-14 06:28:13,870 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:13,871 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-14 06:28:13,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-14 06:28:14,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-07-14 06:28:14,087 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:28:14,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:14,087 INFO L85 PathProgramCache]: Analyzing trace with hash 633585952, now seen corresponding path program 1 times [2022-07-14 06:28:14,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:14,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042556184] [2022-07-14 06:28:14,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:14,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:14,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:28:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:14,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 06:28:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:14,492 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:28:14,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:14,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042556184] [2022-07-14 06:28:14,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042556184] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:28:14,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986322307] [2022-07-14 06:28:14,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:14,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:28:14,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:28:14,508 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:28:14,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-14 06:28:14,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:14,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 97 conjunts are in the unsatisfiable core [2022-07-14 06:28:14,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:28:14,784 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:28:14,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:28:14,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:28:14,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:28:14,941 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:28:14,953 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:28:14,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:28:14,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:28:14,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:28:15,172 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-14 06:28:15,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2022-07-14 06:28:15,180 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-14 06:28:15,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 22 [2022-07-14 06:28:15,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:15,478 INFO L356 Elim1Store]: treesize reduction 41, result has 31.7 percent of original size [2022-07-14 06:28:15,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 63 [2022-07-14 06:28:15,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:15,493 INFO L356 Elim1Store]: treesize reduction 41, result has 31.7 percent of original size [2022-07-14 06:28:15,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 44 [2022-07-14 06:28:15,960 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:15,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-07-14 06:28:15,965 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:15,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 11 [2022-07-14 06:28:16,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:16,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-14 06:28:16,026 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 06:28:16,026 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 18 [2022-07-14 06:28:16,226 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:16,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:28:16,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [986322307] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:28:16,566 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:28:16,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 32 [2022-07-14 06:28:16,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99511544] [2022-07-14 06:28:16,566 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:28:16,567 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-14 06:28:16,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:16,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-14 06:28:16,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1403, Unknown=0, NotChecked=0, Total=1560 [2022-07-14 06:28:16,567 INFO L87 Difference]: Start difference. First operand 2786 states and 3595 transitions. Second operand has 33 states, 32 states have (on average 3.0625) internal successors, (98), 31 states have internal predecessors, (98), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:28:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:18,732 INFO L93 Difference]: Finished difference Result 5615 states and 7216 transitions. [2022-07-14 06:28:18,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-07-14 06:28:18,733 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.0625) internal successors, (98), 31 states have internal predecessors, (98), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 53 [2022-07-14 06:28:18,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:18,739 INFO L225 Difference]: With dead ends: 5615 [2022-07-14 06:28:18,739 INFO L226 Difference]: Without dead ends: 5615 [2022-07-14 06:28:18,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1507 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=647, Invalid=5205, Unknown=0, NotChecked=0, Total=5852 [2022-07-14 06:28:18,740 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 653 mSDsluCounter, 3928 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 4160 SdHoareTripleChecker+Invalid, 2432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1152 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:18,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 4160 Invalid, 2432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1212 Invalid, 0 Unknown, 1152 Unchecked, 0.5s Time] [2022-07-14 06:28:18,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5615 states. [2022-07-14 06:28:18,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5615 to 4813. [2022-07-14 06:28:18,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4813 states, 4502 states have (on average 1.286539315859618) internal successors, (5792), 4591 states have internal predecessors, (5792), 225 states have call successors, (225), 62 states have call predecessors, (225), 62 states have return successors, (225), 159 states have call predecessors, (225), 225 states have call successors, (225) [2022-07-14 06:28:18,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4813 states to 4813 states and 6242 transitions. [2022-07-14 06:28:18,780 INFO L78 Accepts]: Start accepts. Automaton has 4813 states and 6242 transitions. Word has length 53 [2022-07-14 06:28:18,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:18,780 INFO L495 AbstractCegarLoop]: Abstraction has 4813 states and 6242 transitions. [2022-07-14 06:28:18,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.0625) internal successors, (98), 31 states have internal predecessors, (98), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:28:18,781 INFO L276 IsEmpty]: Start isEmpty. Operand 4813 states and 6242 transitions. [2022-07-14 06:28:18,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-14 06:28:18,781 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:18,782 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:28:18,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-14 06:28:18,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-07-14 06:28:18,995 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:28:18,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:18,996 INFO L85 PathProgramCache]: Analyzing trace with hash 385346035, now seen corresponding path program 1 times [2022-07-14 06:28:18,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:18,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672893419] [2022-07-14 06:28:18,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:18,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:19,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:19,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 06:28:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:19,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-14 06:28:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 06:28:19,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:19,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672893419] [2022-07-14 06:28:19,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672893419] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:28:19,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288301788] [2022-07-14 06:28:19,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:19,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:28:19,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:28:19,083 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:28:19,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-14 06:28:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:19,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-14 06:28:19,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:28:19,285 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:19,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-07-14 06:28:19,288 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:19,289 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-07-14 06:28:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 06:28:19,320 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:28:19,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288301788] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:28:19,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:28:19,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 12 [2022-07-14 06:28:19,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807029466] [2022-07-14 06:28:19,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:28:19,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:28:19,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:19,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:28:19,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:28:19,322 INFO L87 Difference]: Start difference. First operand 4813 states and 6242 transitions. Second operand has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:28:19,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:19,533 INFO L93 Difference]: Finished difference Result 4903 states and 6323 transitions. [2022-07-14 06:28:19,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:28:19,534 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-07-14 06:28:19,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:19,539 INFO L225 Difference]: With dead ends: 4903 [2022-07-14 06:28:19,539 INFO L226 Difference]: Without dead ends: 4903 [2022-07-14 06:28:19,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-07-14 06:28:19,540 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 220 mSDsluCounter, 918 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:19,540 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 1101 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:28:19,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4903 states. [2022-07-14 06:28:19,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4903 to 4246. [2022-07-14 06:28:19,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4246 states, 3975 states have (on average 1.2827672955974843) internal successors, (5099), 4054 states have internal predecessors, (5099), 200 states have call successors, (200), 47 states have call predecessors, (200), 47 states have return successors, (200), 144 states have call predecessors, (200), 200 states have call successors, (200) [2022-07-14 06:28:19,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4246 states to 4246 states and 5499 transitions. [2022-07-14 06:28:19,577 INFO L78 Accepts]: Start accepts. Automaton has 4246 states and 5499 transitions. Word has length 54 [2022-07-14 06:28:19,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:19,577 INFO L495 AbstractCegarLoop]: Abstraction has 4246 states and 5499 transitions. [2022-07-14 06:28:19,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.125) internal successors, (49), 7 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:28:19,577 INFO L276 IsEmpty]: Start isEmpty. Operand 4246 states and 5499 transitions. [2022-07-14 06:28:19,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-14 06:28:19,579 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:19,579 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2022-07-14 06:28:19,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-14 06:28:19,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:28:19,796 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:28:19,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:19,796 INFO L85 PathProgramCache]: Analyzing trace with hash -885676746, now seen corresponding path program 1 times [2022-07-14 06:28:19,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:19,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230945387] [2022-07-14 06:28:19,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:19,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:19,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:19,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:28:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:19,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 06:28:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:19,992 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 06:28:19,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:19,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230945387] [2022-07-14 06:28:19,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230945387] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:28:19,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:28:19,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-14 06:28:19,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995419138] [2022-07-14 06:28:19,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:28:19,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:28:19,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:19,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:28:19,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:28:19,994 INFO L87 Difference]: Start difference. First operand 4246 states and 5499 transitions. Second operand has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:28:20,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:20,193 INFO L93 Difference]: Finished difference Result 4342 states and 5588 transitions. [2022-07-14 06:28:20,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 06:28:20,193 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2022-07-14 06:28:20,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:20,197 INFO L225 Difference]: With dead ends: 4342 [2022-07-14 06:28:20,197 INFO L226 Difference]: Without dead ends: 4342 [2022-07-14 06:28:20,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2022-07-14 06:28:20,197 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 1245 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1245 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:20,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1245 Valid, 384 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:28:20,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4342 states. [2022-07-14 06:28:20,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4342 to 4191. [2022-07-14 06:28:20,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4191 states, 3921 states have (on average 1.2713593471053302) internal successors, (4985), 4000 states have internal predecessors, (4985), 199 states have call successors, (199), 47 states have call predecessors, (199), 47 states have return successors, (199), 143 states have call predecessors, (199), 199 states have call successors, (199) [2022-07-14 06:28:20,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4191 states to 4191 states and 5383 transitions. [2022-07-14 06:28:20,229 INFO L78 Accepts]: Start accepts. Automaton has 4191 states and 5383 transitions. Word has length 54 [2022-07-14 06:28:20,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:20,229 INFO L495 AbstractCegarLoop]: Abstraction has 4191 states and 5383 transitions. [2022-07-14 06:28:20,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.0) internal successors, (48), 12 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:28:20,229 INFO L276 IsEmpty]: Start isEmpty. Operand 4191 states and 5383 transitions. [2022-07-14 06:28:20,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-14 06:28:20,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:20,230 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:28:20,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-07-14 06:28:20,230 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:28:20,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:20,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1487364529, now seen corresponding path program 1 times [2022-07-14 06:28:20,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:20,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663802732] [2022-07-14 06:28:20,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:20,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:20,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:28:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:20,260 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:20,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:20,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663802732] [2022-07-14 06:28:20,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663802732] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:28:20,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1812837987] [2022-07-14 06:28:20,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:20,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:28:20,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:28:20,262 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:28:20,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-14 06:28:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:20,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:28:20,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:28:20,462 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:20,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:28:20,518 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:20,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1812837987] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:28:20,518 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:28:20,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 5 [2022-07-14 06:28:20,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60208033] [2022-07-14 06:28:20,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:28:20,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:28:20,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:20,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:28:20,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:28:20,519 INFO L87 Difference]: Start difference. First operand 4191 states and 5383 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:28:20,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:20,556 INFO L93 Difference]: Finished difference Result 8538 states and 11073 transitions. [2022-07-14 06:28:20,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:28:20,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 55 [2022-07-14 06:28:20,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:20,564 INFO L225 Difference]: With dead ends: 8538 [2022-07-14 06:28:20,564 INFO L226 Difference]: Without dead ends: 8538 [2022-07-14 06:28:20,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:28:20,565 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 279 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:20,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 658 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:28:20,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8538 states. [2022-07-14 06:28:20,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8538 to 6614. [2022-07-14 06:28:20,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6614 states, 6239 states have (on average 1.2875460811027408) internal successors, (8033), 6330 states have internal predecessors, (8033), 304 states have call successors, (304), 47 states have call predecessors, (304), 47 states have return successors, (304), 236 states have call predecessors, (304), 304 states have call successors, (304) [2022-07-14 06:28:20,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6614 states to 6614 states and 8641 transitions. [2022-07-14 06:28:20,622 INFO L78 Accepts]: Start accepts. Automaton has 6614 states and 8641 transitions. Word has length 55 [2022-07-14 06:28:20,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:20,622 INFO L495 AbstractCegarLoop]: Abstraction has 6614 states and 8641 transitions. [2022-07-14 06:28:20,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:28:20,622 INFO L276 IsEmpty]: Start isEmpty. Operand 6614 states and 8641 transitions. [2022-07-14 06:28:20,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-14 06:28:20,623 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:20,623 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:28:20,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-14 06:28:20,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:28:20,836 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:28:20,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:20,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1136338587, now seen corresponding path program 1 times [2022-07-14 06:28:20,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:20,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966890632] [2022-07-14 06:28:20,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:20,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:21,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:28:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:21,290 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:21,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:21,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966890632] [2022-07-14 06:28:21,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966890632] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:28:21,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648437331] [2022-07-14 06:28:21,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:21,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:28:21,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:28:21,292 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:28:21,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-14 06:28:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:21,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-14 06:28:21,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:28:21,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:21,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:28:21,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:21,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:28:21,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:21,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:28:21,892 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-14 06:28:21,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2022-07-14 06:28:22,128 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:22,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:22,138 INFO L356 Elim1Store]: treesize reduction 41, result has 31.7 percent of original size [2022-07-14 06:28:22,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 77 [2022-07-14 06:28:22,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:22,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2022-07-14 06:28:22,499 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:22,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2022-07-14 06:28:22,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 06:28:22,713 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:22,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:28:22,963 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:28:22,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 77 [2022-07-14 06:28:34,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1648437331] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:28:34,133 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:28:34,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 33 [2022-07-14 06:28:34,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165484429] [2022-07-14 06:28:34,133 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:28:34,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-14 06:28:34,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:34,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-14 06:28:34,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=2073, Unknown=11, NotChecked=0, Total=2256 [2022-07-14 06:28:34,134 INFO L87 Difference]: Start difference. First operand 6614 states and 8641 transitions. Second operand has 34 states, 33 states have (on average 3.272727272727273) internal successors, (108), 32 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:28:35,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:35,352 INFO L93 Difference]: Finished difference Result 6961 states and 9072 transitions. [2022-07-14 06:28:35,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-14 06:28:35,353 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 3.272727272727273) internal successors, (108), 32 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 56 [2022-07-14 06:28:35,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:35,359 INFO L225 Difference]: With dead ends: 6961 [2022-07-14 06:28:35,359 INFO L226 Difference]: Without dead ends: 6950 [2022-07-14 06:28:35,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=365, Invalid=3914, Unknown=11, NotChecked=0, Total=4290 [2022-07-14 06:28:35,360 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 206 mSDsluCounter, 2118 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 2246 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 464 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:35,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 2246 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 625 Invalid, 0 Unknown, 464 Unchecked, 0.3s Time] [2022-07-14 06:28:35,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6950 states. [2022-07-14 06:28:35,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6950 to 6715. [2022-07-14 06:28:35,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6715 states, 6335 states have (on average 1.285872138910813) internal successors, (8146), 6426 states have internal predecessors, (8146), 306 states have call successors, (306), 50 states have call predecessors, (306), 50 states have return successors, (306), 238 states have call predecessors, (306), 306 states have call successors, (306) [2022-07-14 06:28:35,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6715 states to 6715 states and 8758 transitions. [2022-07-14 06:28:35,435 INFO L78 Accepts]: Start accepts. Automaton has 6715 states and 8758 transitions. Word has length 56 [2022-07-14 06:28:35,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:35,435 INFO L495 AbstractCegarLoop]: Abstraction has 6715 states and 8758 transitions. [2022-07-14 06:28:35,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 3.272727272727273) internal successors, (108), 32 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:28:35,436 INFO L276 IsEmpty]: Start isEmpty. Operand 6715 states and 8758 transitions. [2022-07-14 06:28:35,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-14 06:28:35,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:35,437 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:28:35,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-14 06:28:35,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-07-14 06:28:35,653 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:28:35,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:35,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1394504025, now seen corresponding path program 1 times [2022-07-14 06:28:35,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:35,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006763728] [2022-07-14 06:28:35,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:35,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:35,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:28:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:35,866 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:35,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:35,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006763728] [2022-07-14 06:28:35,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006763728] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:28:35,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164349468] [2022-07-14 06:28:35,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:35,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:28:35,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:28:35,876 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:28:35,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-14 06:28:36,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:36,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-14 06:28:36,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:28:36,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-14 06:28:36,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:36,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2022-07-14 06:28:36,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:28:36,633 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:36,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:28:36,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2022-07-14 06:28:38,738 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_44 Int)) (let ((.cse0 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse2 (= |c_~#list~0.base| |c_ULTIMATE.start_append_one_~list#1.base|)) (.cse1 (let ((.cse3 (* ~unnamed1~0~LIST_END 4))) (= (+ |c_~#list~0.offset| .cse3) (+ .cse3 |c_ULTIMATE.start_append_one_~list#1.offset|))))) (or (and (= .cse0 (select (store |c_#valid| |c_ULTIMATE.start_append_one_~item~1#1.base| 0) v_antiDerIndex_entry0_1)) .cse1 .cse2) (and (= .cse0 (select (store |c_#valid| v_arrayElimCell_44 0) v_antiDerIndex_entry0_1)) (or (not .cse2) (not .cse1)))))) is different from false [2022-07-14 06:28:42,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164349468] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:28:42,051 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:28:42,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-07-14 06:28:42,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636880312] [2022-07-14 06:28:42,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:28:42,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-14 06:28:42,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:42,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-14 06:28:42,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=939, Unknown=1, NotChecked=62, Total=1122 [2022-07-14 06:28:42,052 INFO L87 Difference]: Start difference. First operand 6715 states and 8758 transitions. Second operand has 25 states, 24 states have (on average 4.25) internal successors, (102), 25 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:28:42,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:42,545 INFO L93 Difference]: Finished difference Result 7206 states and 9405 transitions. [2022-07-14 06:28:42,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 06:28:42,545 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.25) internal successors, (102), 25 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 56 [2022-07-14 06:28:42,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:42,553 INFO L225 Difference]: With dead ends: 7206 [2022-07-14 06:28:42,553 INFO L226 Difference]: Without dead ends: 7191 [2022-07-14 06:28:42,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=173, Invalid=1312, Unknown=1, NotChecked=74, Total=1560 [2022-07-14 06:28:42,554 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 283 mSDsluCounter, 2450 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 2626 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 620 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:42,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 2626 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 626 Invalid, 0 Unknown, 620 Unchecked, 0.3s Time] [2022-07-14 06:28:42,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7191 states. [2022-07-14 06:28:42,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7191 to 6712. [2022-07-14 06:28:42,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6712 states, 6332 states have (on average 1.2855337965887554) internal successors, (8140), 6423 states have internal predecessors, (8140), 306 states have call successors, (306), 50 states have call predecessors, (306), 50 states have return successors, (306), 238 states have call predecessors, (306), 306 states have call successors, (306) [2022-07-14 06:28:42,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6712 states to 6712 states and 8752 transitions. [2022-07-14 06:28:42,612 INFO L78 Accepts]: Start accepts. Automaton has 6712 states and 8752 transitions. Word has length 56 [2022-07-14 06:28:42,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:42,612 INFO L495 AbstractCegarLoop]: Abstraction has 6712 states and 8752 transitions. [2022-07-14 06:28:42,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.25) internal successors, (102), 25 states have internal predecessors, (102), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:28:42,612 INFO L276 IsEmpty]: Start isEmpty. Operand 6712 states and 8752 transitions. [2022-07-14 06:28:42,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-14 06:28:42,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:42,613 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:28:42,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-14 06:28:42,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-07-14 06:28:42,827 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:28:42,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:42,828 INFO L85 PathProgramCache]: Analyzing trace with hash 471291546, now seen corresponding path program 1 times [2022-07-14 06:28:42,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:42,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029116369] [2022-07-14 06:28:42,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:42,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:42,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:43,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:28:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:43,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 06:28:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:43,033 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-14 06:28:43,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:43,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029116369] [2022-07-14 06:28:43,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029116369] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:28:43,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:28:43,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-14 06:28:43,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389833444] [2022-07-14 06:28:43,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:28:43,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 06:28:43,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:28:43,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 06:28:43,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:28:43,034 INFO L87 Difference]: Start difference. First operand 6712 states and 8752 transitions. Second operand has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:28:43,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:28:43,595 INFO L93 Difference]: Finished difference Result 7803 states and 10100 transitions. [2022-07-14 06:28:43,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 06:28:43,596 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 57 [2022-07-14 06:28:43,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:28:43,603 INFO L225 Difference]: With dead ends: 7803 [2022-07-14 06:28:43,603 INFO L226 Difference]: Without dead ends: 7803 [2022-07-14 06:28:43,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=270, Invalid=660, Unknown=0, NotChecked=0, Total=930 [2022-07-14 06:28:43,604 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 912 mSDsluCounter, 974 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 1146 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:28:43,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 1146 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 462 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:28:43,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7803 states. [2022-07-14 06:28:43,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7803 to 6838. [2022-07-14 06:28:43,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6838 states, 6458 states have (on average 1.2856921647568906) internal successors, (8303), 6549 states have internal predecessors, (8303), 306 states have call successors, (306), 50 states have call predecessors, (306), 50 states have return successors, (306), 238 states have call predecessors, (306), 306 states have call successors, (306) [2022-07-14 06:28:43,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6838 states to 6838 states and 8915 transitions. [2022-07-14 06:28:43,658 INFO L78 Accepts]: Start accepts. Automaton has 6838 states and 8915 transitions. Word has length 57 [2022-07-14 06:28:43,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:28:43,658 INFO L495 AbstractCegarLoop]: Abstraction has 6838 states and 8915 transitions. [2022-07-14 06:28:43,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.923076923076923) internal successors, (51), 14 states have internal predecessors, (51), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:28:43,659 INFO L276 IsEmpty]: Start isEmpty. Operand 6838 states and 8915 transitions. [2022-07-14 06:28:43,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 06:28:43,659 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:28:43,660 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:28:43,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-07-14 06:28:43,660 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:28:43,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:28:43,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1725136247, now seen corresponding path program 1 times [2022-07-14 06:28:43,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:28:43,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632007815] [2022-07-14 06:28:43,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:43,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:28:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:43,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:28:43,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:43,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 06:28:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:43,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:28:43,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:28:43,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632007815] [2022-07-14 06:28:43,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632007815] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:28:43,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649613889] [2022-07-14 06:28:43,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:28:43,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:28:43,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:28:43,932 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:28:43,934 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-14 06:28:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:28:44,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-14 06:28:44,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:28:44,213 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:28:44,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:28:44,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 06:28:44,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 06:28:44,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 06:28:44,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 06:28:44,377 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 06:28:44,385 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 14 treesize of output 16 [2022-07-14 06:28:44,545 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-14 06:28:44,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2022-07-14 06:28:44,557 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-14 06:28:44,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 1 case distinctions, treesize of input 23 treesize of output 30 [2022-07-14 06:28:44,705 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:44,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-07-14 06:28:44,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:28:44,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 33 [2022-07-14 06:28:45,234 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:28:45,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2022-07-14 06:28:45,284 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:28:45,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:30:11,913 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1462 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1467 Int) (|ULTIMATE.start_append_one_~to#1| Int)) (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_1461))) (let ((.cse2 (+ (* ~unnamed1~0~LIST_END 4) |c_ULTIMATE.start_append_one_~list#1.offset|)) (.cse1 (store (select .cse0 |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|)) (.cse3 (* ~unnamed1~0~LIST_BEG 4))) (or (<= (+ (select (select (store .cse0 |c_ULTIMATE.start_append_one_~list#1.base| (store .cse1 .cse2 v_ArrVal_1467)) |c_~#list~0.base|) (+ |c_~#list~0.offset| .cse3)) 1) |c_#StackHeapBarrier|) (not (= (select .cse1 .cse2) 0)) (and (= (select .cse1 (+ |c_ULTIMATE.start_append_one_~list#1.offset| .cse3)) 0) (forall ((v_ArrVal_1466 Int)) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |c_ULTIMATE.start_append_one_~list#1.offset|) v_ArrVal_1466) (+ |c_ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))))))) is different from false [2022-07-14 06:30:11,952 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1467 Int) (|ULTIMATE.start_append_one_~to#1| Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_1461))) (let ((.cse1 (* ~unnamed1~0~LIST_BEG 4)) (.cse0 (store (select .cse2 |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|)) (.cse3 (+ (* ~unnamed1~0~LIST_END 4) |c_ULTIMATE.start_append_one_~list#1.offset|))) (or (and (= (select .cse0 (+ |c_ULTIMATE.start_append_one_~list#1.offset| .cse1)) 0) (forall ((v_ArrVal_1466 Int) (v_ArrVal_1462 (Array Int Int))) (= (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_1462) |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |c_ULTIMATE.start_append_one_~list#1.offset|) v_ArrVal_1466) (+ |c_ULTIMATE.start_append_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))) (<= (+ (select (select (store .cse2 |c_ULTIMATE.start_append_one_~list#1.base| (store .cse0 .cse3 v_ArrVal_1467)) |c_~#list~0.base|) (+ |c_~#list~0.offset| .cse1)) 1) |c_#StackHeapBarrier|) (not (= (select .cse0 .cse3) 0)))))) is different from false [2022-07-14 06:30:12,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649613889] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:30:12,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:30:12,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 29 [2022-07-14 06:30:12,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909175082] [2022-07-14 06:30:12,697 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:30:12,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-14 06:30:12,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:30:12,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-14 06:30:12,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1496, Unknown=53, NotChecked=162, Total=1892 [2022-07-14 06:30:12,698 INFO L87 Difference]: Start difference. First operand 6838 states and 8915 transitions. Second operand has 30 states, 29 states have (on average 3.7241379310344827) internal successors, (108), 29 states have internal predecessors, (108), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:30:16,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:30:16,074 INFO L93 Difference]: Finished difference Result 8138 states and 10491 transitions. [2022-07-14 06:30:16,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-07-14 06:30:16,074 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.7241379310344827) internal successors, (108), 29 states have internal predecessors, (108), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 58 [2022-07-14 06:30:16,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:30:16,084 INFO L225 Difference]: With dead ends: 8138 [2022-07-14 06:30:16,084 INFO L226 Difference]: Without dead ends: 8138 [2022-07-14 06:30:16,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2363 ImplicationChecksByTransitivity, 89.2s TimeCoverageRelationStatistics Valid=1006, Invalid=7505, Unknown=53, NotChecked=366, Total=8930 [2022-07-14 06:30:16,086 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 1257 mSDsluCounter, 3430 mSDsCounter, 0 mSdLazyCounter, 1889 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1259 SdHoareTripleChecker+Valid, 3597 SdHoareTripleChecker+Invalid, 2253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 204 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:30:16,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1259 Valid, 3597 Invalid, 2253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1889 Invalid, 0 Unknown, 204 Unchecked, 1.1s Time] [2022-07-14 06:30:16,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8138 states. [2022-07-14 06:30:16,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8138 to 7026. [2022-07-14 06:30:16,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7026 states, 6631 states have (on average 1.2839692354094405) internal successors, (8514), 6725 states have internal predecessors, (8514), 316 states have call successors, (316), 55 states have call predecessors, (316), 55 states have return successors, (316), 245 states have call predecessors, (316), 316 states have call successors, (316) [2022-07-14 06:30:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7026 states to 7026 states and 9146 transitions. [2022-07-14 06:30:16,170 INFO L78 Accepts]: Start accepts. Automaton has 7026 states and 9146 transitions. Word has length 58 [2022-07-14 06:30:16,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:30:16,170 INFO L495 AbstractCegarLoop]: Abstraction has 7026 states and 9146 transitions. [2022-07-14 06:30:16,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.7241379310344827) internal successors, (108), 29 states have internal predecessors, (108), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:30:16,171 INFO L276 IsEmpty]: Start isEmpty. Operand 7026 states and 9146 transitions. [2022-07-14 06:30:16,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-14 06:30:16,172 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:30:16,172 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:30:16,194 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-07-14 06:30:16,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:30:16,386 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:30:16,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:30:16,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1939616316, now seen corresponding path program 1 times [2022-07-14 06:30:16,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:30:16,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978762817] [2022-07-14 06:30:16,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:30:16,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:30:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:30:16,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:30:16,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:30:16,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 06:30:16,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:30:16,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:30:16,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:30:16,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978762817] [2022-07-14 06:30:16,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978762817] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:30:16,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288404199] [2022-07-14 06:30:16,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:30:16,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:30:16,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:30:16,876 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:30:16,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-14 06:30:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:30:17,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-14 06:30:17,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:30:17,238 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:30:17,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 [2022-07-14 06:30:17,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:30:17,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:30:17,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:30:17,498 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-14 06:30:17,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2022-07-14 06:30:17,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:30:17,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2022-07-14 06:30:17,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:30:17,863 INFO L356 Elim1Store]: treesize reduction 44, result has 42.1 percent of original size [2022-07-14 06:30:17,863 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 73 [2022-07-14 06:30:18,717 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:30:18,721 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:30:18,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 55 [2022-07-14 06:30:18,832 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:30:18,832 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:30:19,094 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:30:19,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2022-07-14 06:30:35,752 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1539 Int) (|ULTIMATE.start_append_one_~to#1| Int)) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_#res#1.base|)) (.cse2 (+ (* ~unnamed1~0~LIST_END 4) |c_ULTIMATE.start_append_one_~list#1.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store .cse1 .cse2 v_ArrVal_1539)) |c_~#list~0.base|) (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))) (or (= .cse0 0) (= (select |c_#valid| .cse0) 1) (not (= (select .cse1 .cse2) 0)))))) is different from false [2022-07-14 06:30:36,523 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1539 Int) (|ULTIMATE.start_append_one_~to#1| Int)) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~head~0#1.base|)) (.cse2 (+ (* ~unnamed1~0~LIST_END 4) |c_ULTIMATE.start_append_one_~list#1.offset|))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store .cse1 .cse2 v_ArrVal_1539)) |c_~#list~0.base|) (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))) (or (= .cse0 0) (not (= (select .cse1 .cse2) 0)) (= (select |c_#valid| .cse0) 1))))) is different from false [2022-07-14 06:31:02,940 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1539 Int) (v_ArrVal_1536 (Array Int Int)) (|ULTIMATE.start_append_one_~to#1| Int)) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| v_ArrVal_1536))) (let ((.cse0 (store (select .cse3 |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|)) (.cse1 (+ (* ~unnamed1~0~LIST_END 4) |c_ULTIMATE.start_append_one_~list#1.offset|))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_append_one_~list#1.base| (store .cse0 .cse1 v_ArrVal_1539)) |c_~#list~0.base|) (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))) (or (not (= 0 (select .cse0 .cse1))) (= (select |c_#valid| .cse2) 1) (= .cse2 0)))))) is different from false [2022-07-14 06:31:08,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288404199] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:31:08,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:31:08,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 30 [2022-07-14 06:31:08,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048650484] [2022-07-14 06:31:08,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:31:08,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-14 06:31:08,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:31:08,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-14 06:31:08,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=1505, Unknown=52, NotChecked=252, Total=2070 [2022-07-14 06:31:08,416 INFO L87 Difference]: Start difference. First operand 7026 states and 9146 transitions. Second operand has 31 states, 30 states have (on average 3.6666666666666665) internal successors, (110), 30 states have internal predecessors, (110), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:31:27,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:31:27,190 INFO L93 Difference]: Finished difference Result 8793 states and 11303 transitions. [2022-07-14 06:31:27,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-14 06:31:27,191 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.6666666666666665) internal successors, (110), 30 states have internal predecessors, (110), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 59 [2022-07-14 06:31:27,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:31:27,203 INFO L225 Difference]: With dead ends: 8793 [2022-07-14 06:31:27,203 INFO L226 Difference]: Without dead ends: 8793 [2022-07-14 06:31:27,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1327 ImplicationChecksByTransitivity, 68.4s TimeCoverageRelationStatistics Valid=639, Invalid=4414, Unknown=71, NotChecked=426, Total=5550 [2022-07-14 06:31:27,204 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 452 mSDsluCounter, 2552 mSDsCounter, 0 mSdLazyCounter, 699 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 2761 SdHoareTripleChecker+Invalid, 1241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 507 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:31:27,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 2761 Invalid, 1241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 699 Invalid, 0 Unknown, 507 Unchecked, 0.3s Time] [2022-07-14 06:31:27,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8793 states. [2022-07-14 06:31:27,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8793 to 8181. [2022-07-14 06:31:27,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8181 states, 7723 states have (on average 1.2739867926971384) internal successors, (9839), 7829 states have internal predecessors, (9839), 372 states have call successors, (372), 62 states have call predecessors, (372), 62 states have return successors, (372), 289 states have call predecessors, (372), 372 states have call successors, (372) [2022-07-14 06:31:27,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8181 states to 8181 states and 10583 transitions. [2022-07-14 06:31:27,297 INFO L78 Accepts]: Start accepts. Automaton has 8181 states and 10583 transitions. Word has length 59 [2022-07-14 06:31:27,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:31:27,298 INFO L495 AbstractCegarLoop]: Abstraction has 8181 states and 10583 transitions. [2022-07-14 06:31:27,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.6666666666666665) internal successors, (110), 30 states have internal predecessors, (110), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-14 06:31:27,298 INFO L276 IsEmpty]: Start isEmpty. Operand 8181 states and 10583 transitions. [2022-07-14 06:31:27,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-07-14 06:31:27,299 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:31:27,299 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:31:27,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-14 06:31:27,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:31:27,500 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 54 more)] === [2022-07-14 06:31:27,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:31:27,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1436135, now seen corresponding path program 1 times [2022-07-14 06:31:27,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:31:27,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800789665] [2022-07-14 06:31:27,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:31:27,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:31:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:31:27,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:31:27,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:31:27,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 06:31:27,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:31:27,908 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:31:27,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:31:27,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800789665] [2022-07-14 06:31:27,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800789665] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:31:27,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389084081] [2022-07-14 06:31:27,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:31:27,909 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:31:27,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:31:27,920 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:31:27,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-14 06:31:28,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:31:28,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 66 conjunts are in the unsatisfiable core [2022-07-14 06:31:28,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:31:28,234 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:31:28,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:31:28,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:31:28,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:31:28,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:31:28,482 INFO L356 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2022-07-14 06:31:28,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 30 [2022-07-14 06:31:28,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:31:28,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2022-07-14 06:31:28,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:31:28,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-07-14 06:31:28,909 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:31:28,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2022-07-14 06:31:28,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-14 06:31:28,973 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:31:28,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:31:29,257 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:31:29,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 20 [2022-07-14 06:31:29,300 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:31:29,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 48 [2022-07-14 06:31:59,442 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_append_one_~to#1| Int)) (or (and (forall ((v_ArrVal_1613 Int)) (not (= |c_~#list~0.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~head~0#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |c_ULTIMATE.start_append_one_~list#1.offset|) v_ArrVal_1613)) |c_~#list~0.base|) (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4)))))) (= |c_~#list~0.base| |c_ULTIMATE.start_append_one_~list#1.base|)) (not (= (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* 4 |ULTIMATE.start_append_one_~to#1|) |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~head~0#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |c_ULTIMATE.start_append_one_~list#1.offset|)) 0)))) is different from false