./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0217.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/memsafety/test-0217.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 163bc3b45d6f21a8e478003f84571178259b289b3d9717ecadbc4595fc507bec --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:16:35,369 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:16:35,370 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:16:35,394 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:16:35,396 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:16:35,397 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:16:35,399 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:16:35,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:16:35,402 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:16:35,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:16:35,405 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:16:35,406 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:16:35,406 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:16:35,407 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:16:35,408 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:16:35,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:16:35,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:16:35,409 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:16:35,410 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:16:35,412 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:16:35,412 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:16:35,415 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:16:35,416 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:16:35,417 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:16:35,418 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:16:35,420 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:16:35,424 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:16:35,425 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:16:35,426 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:16:35,426 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:16:35,426 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:16:35,427 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:16:35,427 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:16:35,428 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:16:35,429 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:16:35,430 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:16:35,431 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:16:35,431 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:16:35,431 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:16:35,431 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:16:35,432 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:16:35,433 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:16:35,435 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:16:35,452 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:16:35,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:16:35,453 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:16:35,453 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:16:35,453 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:16:35,454 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:16:35,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:16:35,454 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:16:35,454 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:16:35,454 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:16:35,455 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:16:35,455 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:16:35,455 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:16:35,456 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:16:35,456 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:16:35,456 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:16:35,456 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:16:35,457 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:16:35,457 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:16:35,457 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:16:35,457 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:16:35,457 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:16:35,457 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:16:35,459 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:16:35,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:16:35,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:16:35,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:16:35,459 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:16:35,459 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 06:16:35,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 06:16:35,460 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 -> 163bc3b45d6f21a8e478003f84571178259b289b3d9717ecadbc4595fc507bec [2022-07-14 06:16:35,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:16:35,660 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:16:35,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:16:35,662 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:16:35,664 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:16:35,665 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0217.i [2022-07-14 06:16:35,718 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d715f964/8d15b7714c284120ba67dc4cbe0cfd59/FLAGe31eae624 [2022-07-14 06:16:36,151 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:16:36,152 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0217.i [2022-07-14 06:16:36,166 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d715f964/8d15b7714c284120ba67dc4cbe0cfd59/FLAGe31eae624 [2022-07-14 06:16:36,178 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d715f964/8d15b7714c284120ba67dc4cbe0cfd59 [2022-07-14 06:16:36,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:16:36,182 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:16:36,183 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:16:36,183 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:16:36,187 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:16:36,188 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:16:36" (1/1) ... [2022-07-14 06:16:36,189 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15a75e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:16:36, skipping insertion in model container [2022-07-14 06:16:36,189 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:16:36" (1/1) ... [2022-07-14 06:16:36,194 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:16:36,227 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:16:36,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:16:36,511 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:16:36,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:16:36,586 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:16:36,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:16:36 WrapperNode [2022-07-14 06:16:36,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:16:36,588 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:16:36,588 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:16:36,589 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:16:36,596 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:16:36" (1/1) ... [2022-07-14 06:16:36,625 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:16:36" (1/1) ... [2022-07-14 06:16:36,666 INFO L137 Inliner]: procedures = 181, calls = 47, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 218 [2022-07-14 06:16:36,667 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:16:36,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:16:36,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:16:36,668 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:16:36,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:16:36" (1/1) ... [2022-07-14 06:16:36,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:16:36" (1/1) ... [2022-07-14 06:16:36,694 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:16:36" (1/1) ... [2022-07-14 06:16:36,695 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:16:36" (1/1) ... [2022-07-14 06:16:36,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:16:36" (1/1) ... [2022-07-14 06:16:36,704 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:16:36" (1/1) ... [2022-07-14 06:16:36,706 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:16:36" (1/1) ... [2022-07-14 06:16:36,717 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:16:36,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:16:36,718 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:16:36,718 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:16:36,724 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:16:36" (1/1) ... [2022-07-14 06:16:36,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:16:36,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:16:36,749 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:16:36,751 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:16:36,773 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2022-07-14 06:16:36,773 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2022-07-14 06:16:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 06:16:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:16:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:16:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:16:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:16:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:16:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 06:16:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 06:16:36,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:16:36,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:16:36,939 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:16:36,940 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:16:37,345 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:16:37,351 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:16:37,351 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-14 06:16:37,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:16:37 BoogieIcfgContainer [2022-07-14 06:16:37,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:16:37,365 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:16:37,365 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:16:37,368 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:16:37,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:16:36" (1/3) ... [2022-07-14 06:16:37,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e48fb36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:16:37, skipping insertion in model container [2022-07-14 06:16:37,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:16:36" (2/3) ... [2022-07-14 06:16:37,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e48fb36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:16:37, skipping insertion in model container [2022-07-14 06:16:37,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:16:37" (3/3) ... [2022-07-14 06:16:37,370 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0217.i [2022-07-14 06:16:37,381 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:16:37,381 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2022-07-14 06:16:37,445 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:16:37,451 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@21b3abcd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7f1e2598 [2022-07-14 06:16:37,451 INFO L358 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2022-07-14 06:16:37,456 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 100 states have (on average 1.94) internal successors, (194), 167 states have internal predecessors, (194), 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:16:37,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 06:16:37,482 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:37,483 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 06:16:37,484 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:37,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:37,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1074949738, now seen corresponding path program 1 times [2022-07-14 06:16:37,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:37,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267635063] [2022-07-14 06:16:37,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:37,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:37,600 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:16:37,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:37,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267635063] [2022-07-14 06:16:37,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267635063] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:37,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:37,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:16:37,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267567810] [2022-07-14 06:16:37,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:37,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-14 06:16:37,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:37,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 06:16:37,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 06:16:37,634 INFO L87 Difference]: Start difference. First operand has 171 states, 100 states have (on average 1.94) internal successors, (194), 167 states have internal predecessors, (194), 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:16:37,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:37,663 INFO L93 Difference]: Finished difference Result 171 states and 192 transitions. [2022-07-14 06:16:37,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 06:16:37,665 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:16:37,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:37,670 INFO L225 Difference]: With dead ends: 171 [2022-07-14 06:16:37,670 INFO L226 Difference]: Without dead ends: 169 [2022-07-14 06:16:37,672 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:16:37,674 INFO L413 NwaCegarLoop]: 192 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, 192 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:16:37,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:16:37,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-14 06:16:37,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2022-07-14 06:16:37,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 99 states have (on average 1.878787878787879) internal successors, (186), 165 states have internal predecessors, (186), 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:16:37,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 190 transitions. [2022-07-14 06:16:37,718 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 190 transitions. Word has length 6 [2022-07-14 06:16:37,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:37,718 INFO L495 AbstractCegarLoop]: Abstraction has 169 states and 190 transitions. [2022-07-14 06:16:37,718 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:16:37,718 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 190 transitions. [2022-07-14 06:16:37,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:16:37,719 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:37,719 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:16:37,719 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 06:16:37,719 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:37,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:37,720 INFO L85 PathProgramCache]: Analyzing trace with hash -1280317330, now seen corresponding path program 1 times [2022-07-14 06:16:37,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:37,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401100467] [2022-07-14 06:16:37,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:37,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:37,783 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:16:37,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:37,784 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401100467] [2022-07-14 06:16:37,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401100467] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:37,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:37,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-14 06:16:37,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674931455] [2022-07-14 06:16:37,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:37,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:16:37,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:37,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:16:37,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:16:37,788 INFO L87 Difference]: Start difference. First operand 169 states and 190 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:16:37,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:37,984 INFO L93 Difference]: Finished difference Result 329 states and 370 transitions. [2022-07-14 06:16:37,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:16:37,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 06:16:37,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:37,987 INFO L225 Difference]: With dead ends: 329 [2022-07-14 06:16:37,987 INFO L226 Difference]: Without dead ends: 329 [2022-07-14 06:16:37,988 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:16:37,988 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 171 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:37,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 249 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:16:37,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-07-14 06:16:37,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 233. [2022-07-14 06:16:37,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 160 states have (on average 1.8625) internal successors, (298), 226 states have internal predecessors, (298), 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:16:38,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 306 transitions. [2022-07-14 06:16:38,001 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 306 transitions. Word has length 7 [2022-07-14 06:16:38,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:38,001 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 306 transitions. [2022-07-14 06:16:38,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:16:38,001 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 306 transitions. [2022-07-14 06:16:38,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:16:38,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:38,002 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:16:38,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 06:16:38,011 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:38,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:38,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1280317329, now seen corresponding path program 1 times [2022-07-14 06:16:38,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:38,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010750909] [2022-07-14 06:16:38,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:38,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:38,127 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:16:38,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:38,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010750909] [2022-07-14 06:16:38,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010750909] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:38,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:38,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:16:38,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696523173] [2022-07-14 06:16:38,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:38,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:16:38,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:38,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:16:38,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:16:38,129 INFO L87 Difference]: Start difference. First operand 233 states and 306 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:16:38,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:38,283 INFO L93 Difference]: Finished difference Result 376 states and 474 transitions. [2022-07-14 06:16:38,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:16:38,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 06:16:38,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:38,285 INFO L225 Difference]: With dead ends: 376 [2022-07-14 06:16:38,285 INFO L226 Difference]: Without dead ends: 376 [2022-07-14 06:16:38,285 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:16:38,291 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 141 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:38,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 422 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:16:38,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-07-14 06:16:38,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 310. [2022-07-14 06:16:38,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 231 states have (on average 1.8225108225108224) internal successors, (421), 299 states have internal predecessors, (421), 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:16:38,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 437 transitions. [2022-07-14 06:16:38,311 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 437 transitions. Word has length 7 [2022-07-14 06:16:38,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:38,311 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 437 transitions. [2022-07-14 06:16:38,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:16:38,311 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 437 transitions. [2022-07-14 06:16:38,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:16:38,311 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:38,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:16:38,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 06:16:38,320 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:38,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:38,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1280317267, now seen corresponding path program 1 times [2022-07-14 06:16:38,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:38,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391416620] [2022-07-14 06:16:38,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:38,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:38,379 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:16:38,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:38,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391416620] [2022-07-14 06:16:38,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391416620] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:38,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:38,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:16:38,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248333332] [2022-07-14 06:16:38,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:38,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:16:38,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:38,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:16:38,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:16:38,381 INFO L87 Difference]: Start difference. First operand 310 states and 437 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:16:38,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:38,518 INFO L93 Difference]: Finished difference Result 375 states and 472 transitions. [2022-07-14 06:16:38,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:16:38,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 06:16:38,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:38,520 INFO L225 Difference]: With dead ends: 375 [2022-07-14 06:16:38,520 INFO L226 Difference]: Without dead ends: 375 [2022-07-14 06:16:38,520 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:16:38,521 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 123 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:38,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 436 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:16:38,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-07-14 06:16:38,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 310. [2022-07-14 06:16:38,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 231 states have (on average 1.8225108225108224) internal successors, (421), 299 states have internal predecessors, (421), 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:16:38,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 437 transitions. [2022-07-14 06:16:38,534 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 437 transitions. Word has length 7 [2022-07-14 06:16:38,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:38,534 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 437 transitions. [2022-07-14 06:16:38,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:16:38,534 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 437 transitions. [2022-07-14 06:16:38,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 06:16:38,535 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:38,535 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:16:38,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 06:16:38,535 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:38,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:38,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1671227278, now seen corresponding path program 1 times [2022-07-14 06:16:38,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:38,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378599023] [2022-07-14 06:16:38,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:38,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:38,634 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:16:38,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:38,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378599023] [2022-07-14 06:16:38,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378599023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:38,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:38,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:16:38,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378001309] [2022-07-14 06:16:38,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:38,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:16:38,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:38,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:16:38,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:16:38,637 INFO L87 Difference]: Start difference. First operand 310 states and 437 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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:16:38,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:38,841 INFO L93 Difference]: Finished difference Result 461 states and 621 transitions. [2022-07-14 06:16:38,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:16:38,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-07-14 06:16:38,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:38,844 INFO L225 Difference]: With dead ends: 461 [2022-07-14 06:16:38,844 INFO L226 Difference]: Without dead ends: 461 [2022-07-14 06:16:38,845 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:16:38,846 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 150 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:38,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 803 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:16:38,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2022-07-14 06:16:38,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 352. [2022-07-14 06:16:38,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 352 states, 270 states have (on average 1.8074074074074074) internal successors, (488), 339 states have internal predecessors, (488), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-14 06:16:38,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 508 transitions. [2022-07-14 06:16:38,856 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 508 transitions. Word has length 10 [2022-07-14 06:16:38,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:38,856 INFO L495 AbstractCegarLoop]: Abstraction has 352 states and 508 transitions. [2022-07-14 06:16:38,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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:16:38,857 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 508 transitions. [2022-07-14 06:16:38,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 06:16:38,857 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:38,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:16:38,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 06:16:38,857 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:38,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:38,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1673074320, now seen corresponding path program 1 times [2022-07-14 06:16:38,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:38,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098933875] [2022-07-14 06:16:38,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:38,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:38,976 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:16:38,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:38,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098933875] [2022-07-14 06:16:38,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098933875] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:38,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:38,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:16:38,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992886644] [2022-07-14 06:16:38,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:38,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:16:38,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:38,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:16:38,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:16:38,983 INFO L87 Difference]: Start difference. First operand 352 states and 508 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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:16:39,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:39,120 INFO L93 Difference]: Finished difference Result 451 states and 610 transitions. [2022-07-14 06:16:39,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:16:39,121 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-07-14 06:16:39,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:39,122 INFO L225 Difference]: With dead ends: 451 [2022-07-14 06:16:39,123 INFO L226 Difference]: Without dead ends: 451 [2022-07-14 06:16:39,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:16:39,123 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 131 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 762 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:39,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 762 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:16:39,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-07-14 06:16:39,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 351. [2022-07-14 06:16:39,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 269 states have (on average 1.8104089219330854) internal successors, (487), 338 states have internal predecessors, (487), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-14 06:16:39,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 507 transitions. [2022-07-14 06:16:39,133 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 507 transitions. Word has length 10 [2022-07-14 06:16:39,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:39,134 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 507 transitions. [2022-07-14 06:16:39,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 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:16:39,134 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 507 transitions. [2022-07-14 06:16:39,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 06:16:39,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:39,135 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:16:39,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 06:16:39,135 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:39,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:39,136 INFO L85 PathProgramCache]: Analyzing trace with hash 268436822, now seen corresponding path program 1 times [2022-07-14 06:16:39,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:39,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125548638] [2022-07-14 06:16:39,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:39,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:39,154 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:16:39,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:39,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125548638] [2022-07-14 06:16:39,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125548638] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:39,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:39,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:16:39,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220468653] [2022-07-14 06:16:39,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:39,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:16:39,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:39,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:16:39,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:16:39,157 INFO L87 Difference]: Start difference. First operand 351 states and 507 transitions. Second operand has 3 states, 2 states have (on average 5.5) 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:16:39,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:39,232 INFO L93 Difference]: Finished difference Result 406 states and 560 transitions. [2022-07-14 06:16:39,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:16:39,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) 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:16:39,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:39,235 INFO L225 Difference]: With dead ends: 406 [2022-07-14 06:16:39,235 INFO L226 Difference]: Without dead ends: 399 [2022-07-14 06:16:39,235 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:16:39,236 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 70 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:39,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 287 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:16:39,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2022-07-14 06:16:39,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 348. [2022-07-14 06:16:39,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 266 states have (on average 1.8120300751879699) internal successors, (482), 335 states have internal predecessors, (482), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-14 06:16:39,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 502 transitions. [2022-07-14 06:16:39,246 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 502 transitions. Word has length 11 [2022-07-14 06:16:39,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:39,246 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 502 transitions. [2022-07-14 06:16:39,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) 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:16:39,247 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 502 transitions. [2022-07-14 06:16:39,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 06:16:39,247 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:39,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:16:39,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 06:16:39,248 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:39,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:39,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1044692257, now seen corresponding path program 1 times [2022-07-14 06:16:39,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:39,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506580841] [2022-07-14 06:16:39,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:39,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:39,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:16:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:39,286 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:16:39,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:39,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506580841] [2022-07-14 06:16:39,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506580841] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:39,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:39,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:16:39,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870001815] [2022-07-14 06:16:39,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:39,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:16:39,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:39,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:16:39,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:16:39,288 INFO L87 Difference]: Start difference. First operand 348 states and 502 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:16:39,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:39,504 INFO L93 Difference]: Finished difference Result 570 states and 734 transitions. [2022-07-14 06:16:39,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:16:39,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2022-07-14 06:16:39,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:39,507 INFO L225 Difference]: With dead ends: 570 [2022-07-14 06:16:39,508 INFO L226 Difference]: Without dead ends: 570 [2022-07-14 06:16:39,508 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:16:39,508 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 329 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:39,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 434 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:16:39,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2022-07-14 06:16:39,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 354. [2022-07-14 06:16:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 272 states have (on average 1.7941176470588236) internal successors, (488), 341 states have internal predecessors, (488), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-14 06:16:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 508 transitions. [2022-07-14 06:16:39,519 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 508 transitions. Word has length 15 [2022-07-14 06:16:39,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:39,520 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 508 transitions. [2022-07-14 06:16:39,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:16:39,520 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 508 transitions. [2022-07-14 06:16:39,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 06:16:39,520 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:39,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:16:39,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 06:16:39,521 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:39,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:39,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1044692256, now seen corresponding path program 1 times [2022-07-14 06:16:39,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:39,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076077850] [2022-07-14 06:16:39,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:39,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:39,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:16:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:39,581 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:16:39,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:39,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076077850] [2022-07-14 06:16:39,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076077850] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:39,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:39,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:16:39,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558456562] [2022-07-14 06:16:39,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:39,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:16:39,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:39,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:16:39,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:16:39,583 INFO L87 Difference]: Start difference. First operand 354 states and 508 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:16:39,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:39,731 INFO L93 Difference]: Finished difference Result 408 states and 530 transitions. [2022-07-14 06:16:39,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:16:39,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2022-07-14 06:16:39,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:39,733 INFO L225 Difference]: With dead ends: 408 [2022-07-14 06:16:39,733 INFO L226 Difference]: Without dead ends: 408 [2022-07-14 06:16:39,733 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:16:39,734 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 197 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:39,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 445 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:16:39,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-07-14 06:16:39,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 354. [2022-07-14 06:16:39,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 272 states have (on average 1.7610294117647058) internal successors, (479), 341 states have internal predecessors, (479), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-14 06:16:39,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 499 transitions. [2022-07-14 06:16:39,744 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 499 transitions. Word has length 15 [2022-07-14 06:16:39,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:39,744 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 499 transitions. [2022-07-14 06:16:39,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:16:39,745 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 499 transitions. [2022-07-14 06:16:39,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:16:39,745 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:39,745 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:16:39,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 06:16:39,746 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:39,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:39,746 INFO L85 PathProgramCache]: Analyzing trace with hash 742849514, now seen corresponding path program 1 times [2022-07-14 06:16:39,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:39,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614278689] [2022-07-14 06:16:39,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:39,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:39,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:39,809 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:16:39,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:39,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614278689] [2022-07-14 06:16:39,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614278689] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:39,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:39,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:16:39,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723688342] [2022-07-14 06:16:39,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:39,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:16:39,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:39,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:16:39,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:16:39,811 INFO L87 Difference]: Start difference. First operand 354 states and 499 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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:16:40,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:40,108 INFO L93 Difference]: Finished difference Result 707 states and 854 transitions. [2022-07-14 06:16:40,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:16:40,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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:16:40,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:40,111 INFO L225 Difference]: With dead ends: 707 [2022-07-14 06:16:40,111 INFO L226 Difference]: Without dead ends: 707 [2022-07-14 06:16:40,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:16:40,112 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 867 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 869 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:40,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [869 Valid, 521 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:16:40,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2022-07-14 06:16:40,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 351. [2022-07-14 06:16:40,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 273 states have (on average 1.7326007326007327) internal successors, (473), 338 states have internal predecessors, (473), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-14 06:16:40,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 493 transitions. [2022-07-14 06:16:40,122 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 493 transitions. Word has length 17 [2022-07-14 06:16:40,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:40,122 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 493 transitions. [2022-07-14 06:16:40,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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:16:40,123 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 493 transitions. [2022-07-14 06:16:40,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:16:40,123 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:40,123 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:16:40,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 06:16:40,123 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:40,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:40,124 INFO L85 PathProgramCache]: Analyzing trace with hash 742849515, now seen corresponding path program 1 times [2022-07-14 06:16:40,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:40,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943260490] [2022-07-14 06:16:40,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:40,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:40,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:40,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:40,252 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:16:40,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:40,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943260490] [2022-07-14 06:16:40,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943260490] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:40,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:40,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:16:40,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201042106] [2022-07-14 06:16:40,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:40,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:16:40,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:40,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:16:40,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:16:40,255 INFO L87 Difference]: Start difference. First operand 351 states and 493 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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:16:40,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:40,749 INFO L93 Difference]: Finished difference Result 766 states and 951 transitions. [2022-07-14 06:16:40,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:16:40,750 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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:16:40,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:40,752 INFO L225 Difference]: With dead ends: 766 [2022-07-14 06:16:40,752 INFO L226 Difference]: Without dead ends: 766 [2022-07-14 06:16:40,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:16:40,753 INFO L413 NwaCegarLoop]: 155 mSDtfsCounter, 895 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 901 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:40,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [901 Valid, 697 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:16:40,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2022-07-14 06:16:40,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 384. [2022-07-14 06:16:40,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 304 states have (on average 1.7203947368421053) internal successors, (523), 370 states have internal predecessors, (523), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-14 06:16:40,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 547 transitions. [2022-07-14 06:16:40,763 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 547 transitions. Word has length 17 [2022-07-14 06:16:40,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:40,763 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 547 transitions. [2022-07-14 06:16:40,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 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:16:40,764 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 547 transitions. [2022-07-14 06:16:40,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:16:40,764 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:40,764 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:16:40,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 06:16:40,764 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:40,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:40,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1064604948, now seen corresponding path program 1 times [2022-07-14 06:16:40,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:40,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316198316] [2022-07-14 06:16:40,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:40,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:40,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:40,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:40,819 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:16:40,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:40,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316198316] [2022-07-14 06:16:40,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316198316] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:40,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:40,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:16:40,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874566487] [2022-07-14 06:16:40,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:40,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:16:40,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:40,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:16:40,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:16:40,828 INFO L87 Difference]: Start difference. First operand 384 states and 547 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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:16:40,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:40,880 INFO L93 Difference]: Finished difference Result 614 states and 849 transitions. [2022-07-14 06:16:40,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:16:40,881 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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:16:40,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:40,884 INFO L225 Difference]: With dead ends: 614 [2022-07-14 06:16:40,884 INFO L226 Difference]: Without dead ends: 614 [2022-07-14 06:16:40,884 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:16:40,885 INFO L413 NwaCegarLoop]: 362 mSDtfsCounter, 243 mSDsluCounter, 1183 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1545 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:40,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1545 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:16:40,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2022-07-14 06:16:40,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 394. [2022-07-14 06:16:40,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 311 states have (on average 1.7009646302250805) internal successors, (529), 379 states have internal predecessors, (529), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:16:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 559 transitions. [2022-07-14 06:16:40,898 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 559 transitions. Word has length 17 [2022-07-14 06:16:40,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:40,900 INFO L495 AbstractCegarLoop]: Abstraction has 394 states and 559 transitions. [2022-07-14 06:16:40,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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:16:40,900 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 559 transitions. [2022-07-14 06:16:40,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 06:16:40,901 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:40,901 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:16:40,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 06:16:40,901 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:40,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:40,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1357040557, now seen corresponding path program 1 times [2022-07-14 06:16:40,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:40,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731381055] [2022-07-14 06:16:40,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:40,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:40,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:41,000 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:16:41,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:41,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731381055] [2022-07-14 06:16:41,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731381055] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:41,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:41,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:16:41,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873041705] [2022-07-14 06:16:41,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:41,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:16:41,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:41,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:16:41,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:16:41,003 INFO L87 Difference]: Start difference. First operand 394 states and 559 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:16:41,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:41,520 INFO L93 Difference]: Finished difference Result 793 states and 993 transitions. [2022-07-14 06:16:41,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:16:41,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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 18 [2022-07-14 06:16:41,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:41,523 INFO L225 Difference]: With dead ends: 793 [2022-07-14 06:16:41,523 INFO L226 Difference]: Without dead ends: 793 [2022-07-14 06:16:41,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:16:41,524 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 545 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:41,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 835 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:16:41,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2022-07-14 06:16:41,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 391. [2022-07-14 06:16:41,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 308 states have (on average 1.7012987012987013) internal successors, (524), 376 states have internal predecessors, (524), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:16:41,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 554 transitions. [2022-07-14 06:16:41,534 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 554 transitions. Word has length 18 [2022-07-14 06:16:41,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:41,534 INFO L495 AbstractCegarLoop]: Abstraction has 391 states and 554 transitions. [2022-07-14 06:16:41,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 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:16:41,534 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 554 transitions. [2022-07-14 06:16:41,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:16:41,535 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:41,535 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:16:41,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 06:16:41,535 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:41,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:41,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1279047357, now seen corresponding path program 1 times [2022-07-14 06:16:41,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:41,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047464109] [2022-07-14 06:16:41,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:41,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:41,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:41,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:16:41,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:41,765 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:16:41,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:41,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047464109] [2022-07-14 06:16:41,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047464109] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:41,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:41,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:16:41,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415520453] [2022-07-14 06:16:41,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:41,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:16:41,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:41,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:16:41,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:16:41,767 INFO L87 Difference]: Start difference. First operand 391 states and 554 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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:16:42,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:42,286 INFO L93 Difference]: Finished difference Result 813 states and 1121 transitions. [2022-07-14 06:16:42,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:16:42,287 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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:16:42,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:42,289 INFO L225 Difference]: With dead ends: 813 [2022-07-14 06:16:42,289 INFO L226 Difference]: Without dead ends: 811 [2022-07-14 06:16:42,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-07-14 06:16:42,290 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 568 mSDsluCounter, 1599 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1860 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:42,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1860 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:16:42,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 811 states. [2022-07-14 06:16:42,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 811 to 385. [2022-07-14 06:16:42,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 302 states have (on average 1.6986754966887416) internal successors, (513), 370 states have internal predecessors, (513), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:16:42,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 543 transitions. [2022-07-14 06:16:42,299 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 543 transitions. Word has length 21 [2022-07-14 06:16:42,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:42,299 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 543 transitions. [2022-07-14 06:16:42,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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:16:42,300 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 543 transitions. [2022-07-14 06:16:42,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:16:42,300 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:42,300 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:16:42,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 06:16:42,301 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:42,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:42,301 INFO L85 PathProgramCache]: Analyzing trace with hash 2000662896, now seen corresponding path program 1 times [2022-07-14 06:16:42,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:42,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615762284] [2022-07-14 06:16:42,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:42,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:42,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:42,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:42,421 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:16:42,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:42,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615762284] [2022-07-14 06:16:42,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615762284] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:42,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:42,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:16:42,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032371402] [2022-07-14 06:16:42,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:42,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:16:42,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:42,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:16:42,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:16:42,422 INFO L87 Difference]: Start difference. First operand 385 states and 543 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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:16:42,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:42,722 INFO L93 Difference]: Finished difference Result 548 states and 728 transitions. [2022-07-14 06:16:42,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:16:42,723 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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:16:42,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:42,724 INFO L225 Difference]: With dead ends: 548 [2022-07-14 06:16:42,724 INFO L226 Difference]: Without dead ends: 548 [2022-07-14 06:16:42,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:16:42,725 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 200 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:42,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1103 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:16:42,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-07-14 06:16:42,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 401. [2022-07-14 06:16:42,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 318 states have (on average 1.6761006289308176) internal successors, (533), 384 states have internal predecessors, (533), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:16:42,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 563 transitions. [2022-07-14 06:16:42,733 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 563 transitions. Word has length 21 [2022-07-14 06:16:42,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:42,733 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 563 transitions. [2022-07-14 06:16:42,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 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:16:42,733 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 563 transitions. [2022-07-14 06:16:42,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:16:42,733 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:42,733 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] [2022-07-14 06:16:42,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 06:16:42,734 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:42,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:42,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1680606867, now seen corresponding path program 1 times [2022-07-14 06:16:42,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:42,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699294576] [2022-07-14 06:16:42,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:42,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:42,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:42,802 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:16:42,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:42,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699294576] [2022-07-14 06:16:42,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699294576] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:42,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:42,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:16:42,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550738692] [2022-07-14 06:16:42,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:42,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:16:42,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:42,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:16:42,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:16:42,806 INFO L87 Difference]: Start difference. First operand 401 states and 563 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:16:42,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:42,836 INFO L93 Difference]: Finished difference Result 646 states and 894 transitions. [2022-07-14 06:16:42,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:16:42,837 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 22 [2022-07-14 06:16:42,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:42,839 INFO L225 Difference]: With dead ends: 646 [2022-07-14 06:16:42,839 INFO L226 Difference]: Without dead ends: 646 [2022-07-14 06:16:42,840 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:16:42,840 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 245 mSDsluCounter, 970 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:42,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 1235 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:16:42,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2022-07-14 06:16:42,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 403. [2022-07-14 06:16:42,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 320 states have (on average 1.671875) internal successors, (535), 386 states have internal predecessors, (535), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:16:42,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 565 transitions. [2022-07-14 06:16:42,849 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 565 transitions. Word has length 22 [2022-07-14 06:16:42,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:42,849 INFO L495 AbstractCegarLoop]: Abstraction has 403 states and 565 transitions. [2022-07-14 06:16:42,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:16:42,849 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 565 transitions. [2022-07-14 06:16:42,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:16:42,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:42,850 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] [2022-07-14 06:16:42,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 06:16:42,850 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:42,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:42,851 INFO L85 PathProgramCache]: Analyzing trace with hash -839353067, now seen corresponding path program 1 times [2022-07-14 06:16:42,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:42,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017678436] [2022-07-14 06:16:42,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:42,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:42,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:42,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:42,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:42,903 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:16:42,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:42,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017678436] [2022-07-14 06:16:42,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017678436] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:42,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:42,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:16:42,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143841891] [2022-07-14 06:16:42,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:42,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:16:42,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:42,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:16:42,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:16:42,906 INFO L87 Difference]: Start difference. First operand 403 states and 565 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:16:42,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:42,939 INFO L93 Difference]: Finished difference Result 642 states and 886 transitions. [2022-07-14 06:16:42,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:16:42,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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 22 [2022-07-14 06:16:42,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:42,942 INFO L225 Difference]: With dead ends: 642 [2022-07-14 06:16:42,942 INFO L226 Difference]: Without dead ends: 642 [2022-07-14 06:16:42,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:16:42,943 INFO L413 NwaCegarLoop]: 271 mSDtfsCounter, 242 mSDsluCounter, 980 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1251 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:42,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 1251 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:16:42,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2022-07-14 06:16:42,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 401. [2022-07-14 06:16:42,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 318 states have (on average 1.6635220125786163) internal successors, (529), 384 states have internal predecessors, (529), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:16:42,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 559 transitions. [2022-07-14 06:16:42,952 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 559 transitions. Word has length 22 [2022-07-14 06:16:42,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:42,952 INFO L495 AbstractCegarLoop]: Abstraction has 401 states and 559 transitions. [2022-07-14 06:16:42,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 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:16:42,953 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 559 transitions. [2022-07-14 06:16:42,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:16:42,955 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:42,955 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] [2022-07-14 06:16:42,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 06:16:42,955 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:42,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:42,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1175048242, now seen corresponding path program 1 times [2022-07-14 06:16:42,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:42,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580491246] [2022-07-14 06:16:42,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:42,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:42,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:43,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:43,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:43,057 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:16:43,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:43,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580491246] [2022-07-14 06:16:43,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580491246] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:43,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:43,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:16:43,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087414693] [2022-07-14 06:16:43,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:43,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:16:43,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:43,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:16:43,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:16:43,059 INFO L87 Difference]: Start difference. First operand 401 states and 559 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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:16:43,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:43,312 INFO L93 Difference]: Finished difference Result 578 states and 779 transitions. [2022-07-14 06:16:43,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 06:16:43,312 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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 22 [2022-07-14 06:16:43,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:43,314 INFO L225 Difference]: With dead ends: 578 [2022-07-14 06:16:43,314 INFO L226 Difference]: Without dead ends: 578 [2022-07-14 06:16:43,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:16:43,314 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 194 mSDsluCounter, 996 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:43,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 1197 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:16:43,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2022-07-14 06:16:43,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 411. [2022-07-14 06:16:43,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 328 states have (on average 1.649390243902439) internal successors, (541), 392 states have internal predecessors, (541), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:16:43,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 571 transitions. [2022-07-14 06:16:43,323 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 571 transitions. Word has length 22 [2022-07-14 06:16:43,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:43,323 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 571 transitions. [2022-07-14 06:16:43,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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:16:43,323 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 571 transitions. [2022-07-14 06:16:43,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 06:16:43,323 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:43,323 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:16:43,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 06:16:43,324 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:43,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:43,324 INFO L85 PathProgramCache]: Analyzing trace with hash -796222002, now seen corresponding path program 1 times [2022-07-14 06:16:43,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:43,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906042253] [2022-07-14 06:16:43,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:43,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:43,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:43,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:16:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:43,349 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:16:43,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:43,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906042253] [2022-07-14 06:16:43,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906042253] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:43,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:43,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:16:43,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227856875] [2022-07-14 06:16:43,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:43,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:16:43,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:43,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:16:43,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:16:43,350 INFO L87 Difference]: Start difference. First operand 411 states and 571 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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:16:43,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:43,513 INFO L93 Difference]: Finished difference Result 654 states and 844 transitions. [2022-07-14 06:16:43,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:16:43,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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:16:43,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:43,515 INFO L225 Difference]: With dead ends: 654 [2022-07-14 06:16:43,515 INFO L226 Difference]: Without dead ends: 654 [2022-07-14 06:16:43,515 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:16:43,516 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 303 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:43,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 442 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:16:43,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2022-07-14 06:16:43,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 439. [2022-07-14 06:16:43,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 356 states have (on average 1.6657303370786516) internal successors, (593), 420 states have internal predecessors, (593), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:16:43,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 623 transitions. [2022-07-14 06:16:43,524 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 623 transitions. Word has length 23 [2022-07-14 06:16:43,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:43,524 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 623 transitions. [2022-07-14 06:16:43,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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:16:43,524 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 623 transitions. [2022-07-14 06:16:43,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 06:16:43,525 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:43,525 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:16:43,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-14 06:16:43,525 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:43,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:43,526 INFO L85 PathProgramCache]: Analyzing trace with hash -796222001, now seen corresponding path program 1 times [2022-07-14 06:16:43,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:43,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89493577] [2022-07-14 06:16:43,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:43,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:43,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:43,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:16:43,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:43,620 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:16:43,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:43,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89493577] [2022-07-14 06:16:43,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89493577] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:43,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:43,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:16:43,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466190181] [2022-07-14 06:16:43,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:43,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:16:43,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:43,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:16:43,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:16:43,622 INFO L87 Difference]: Start difference. First operand 439 states and 623 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:16:43,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:43,824 INFO L93 Difference]: Finished difference Result 491 states and 648 transitions. [2022-07-14 06:16:43,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:16:43,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:16:43,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:43,826 INFO L225 Difference]: With dead ends: 491 [2022-07-14 06:16:43,826 INFO L226 Difference]: Without dead ends: 491 [2022-07-14 06:16:43,826 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:16:43,826 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 366 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:43,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 543 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:16:43,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2022-07-14 06:16:43,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 439. [2022-07-14 06:16:43,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 356 states have (on average 1.6404494382022472) internal successors, (584), 420 states have internal predecessors, (584), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:16:43,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 614 transitions. [2022-07-14 06:16:43,834 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 614 transitions. Word has length 23 [2022-07-14 06:16:43,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:43,834 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 614 transitions. [2022-07-14 06:16:43,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:16:43,834 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 614 transitions. [2022-07-14 06:16:43,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:16:43,834 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:43,835 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:16:43,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 06:16:43,835 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:43,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:43,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1911985061, now seen corresponding path program 1 times [2022-07-14 06:16:43,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:43,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477875689] [2022-07-14 06:16:43,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:43,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:43,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:43,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:43,852 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:16:43,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:43,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477875689] [2022-07-14 06:16:43,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477875689] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:43,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:43,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:16:43,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660128195] [2022-07-14 06:16:43,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:43,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:16:43,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:43,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:16:43,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:16:43,855 INFO L87 Difference]: Start difference. First operand 439 states and 614 transitions. Second operand has 4 states, 4 states have (on average 5.75) 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:16:43,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:43,869 INFO L93 Difference]: Finished difference Result 451 states and 626 transitions. [2022-07-14 06:16:43,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:16:43,870 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) 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:16:43,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:43,871 INFO L225 Difference]: With dead ends: 451 [2022-07-14 06:16:43,871 INFO L226 Difference]: Without dead ends: 451 [2022-07-14 06:16:43,872 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:16:43,872 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 3 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:43,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 541 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:16:43,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2022-07-14 06:16:43,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 448. [2022-07-14 06:16:43,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 365 states have (on average 1.6246575342465754) internal successors, (593), 429 states have internal predecessors, (593), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:16:43,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 623 transitions. [2022-07-14 06:16:43,880 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 623 transitions. Word has length 25 [2022-07-14 06:16:43,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:43,881 INFO L495 AbstractCegarLoop]: Abstraction has 448 states and 623 transitions. [2022-07-14 06:16:43,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) 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:16:43,882 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 623 transitions. [2022-07-14 06:16:43,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:16:43,882 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:43,882 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:16:43,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-14 06:16:43,882 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:43,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:43,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1913832103, now seen corresponding path program 1 times [2022-07-14 06:16:43,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:43,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370393262] [2022-07-14 06:16:43,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:43,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:43,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:43,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:43,924 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:16:43,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:43,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370393262] [2022-07-14 06:16:43,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370393262] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:43,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:43,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:16:43,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281108546] [2022-07-14 06:16:43,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:43,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:16:43,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:43,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:16:43,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:16:43,926 INFO L87 Difference]: Start difference. First operand 448 states and 623 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:16:44,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:44,063 INFO L93 Difference]: Finished difference Result 756 states and 1001 transitions. [2022-07-14 06:16:44,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:16:44,065 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:16:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:44,067 INFO L225 Difference]: With dead ends: 756 [2022-07-14 06:16:44,067 INFO L226 Difference]: Without dead ends: 756 [2022-07-14 06:16:44,067 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:16:44,068 INFO L413 NwaCegarLoop]: 257 mSDtfsCounter, 427 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:44,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 455 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:16:44,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2022-07-14 06:16:44,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 507. [2022-07-14 06:16:44,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 425 states have (on average 1.6) internal successors, (680), 488 states have internal predecessors, (680), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:16:44,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 710 transitions. [2022-07-14 06:16:44,076 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 710 transitions. Word has length 25 [2022-07-14 06:16:44,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:44,076 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 710 transitions. [2022-07-14 06:16:44,076 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:16:44,077 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 710 transitions. [2022-07-14 06:16:44,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:16:44,077 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:44,077 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:16:44,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-14 06:16:44,077 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:44,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:44,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1913832102, now seen corresponding path program 1 times [2022-07-14 06:16:44,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:44,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239128052] [2022-07-14 06:16:44,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:44,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:44,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:44,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:44,094 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:16:44,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:44,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239128052] [2022-07-14 06:16:44,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239128052] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:44,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:44,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:16:44,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062251982] [2022-07-14 06:16:44,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:44,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:16:44,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:44,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:16:44,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:16:44,096 INFO L87 Difference]: Start difference. First operand 507 states and 710 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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:16:44,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:44,174 INFO L93 Difference]: Finished difference Result 594 states and 801 transitions. [2022-07-14 06:16:44,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:16:44,175 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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:16:44,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:44,185 INFO L225 Difference]: With dead ends: 594 [2022-07-14 06:16:44,185 INFO L226 Difference]: Without dead ends: 594 [2022-07-14 06:16:44,185 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:16:44,185 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 148 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:44,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 272 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:16:44,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-07-14 06:16:44,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 504. [2022-07-14 06:16:44,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 425 states have (on average 1.571764705882353) internal successors, (668), 485 states have internal predecessors, (668), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:16:44,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 698 transitions. [2022-07-14 06:16:44,193 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 698 transitions. Word has length 25 [2022-07-14 06:16:44,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:44,194 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 698 transitions. [2022-07-14 06:16:44,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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:16:44,194 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 698 transitions. [2022-07-14 06:16:44,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 06:16:44,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:44,194 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] [2022-07-14 06:16:44,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-14 06:16:44,195 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:44,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:44,195 INFO L85 PathProgramCache]: Analyzing trace with hash 2102112361, now seen corresponding path program 1 times [2022-07-14 06:16:44,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:44,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285568219] [2022-07-14 06:16:44,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:44,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:44,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:44,238 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:16:44,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:44,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285568219] [2022-07-14 06:16:44,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285568219] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:44,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:44,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:16:44,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285846910] [2022-07-14 06:16:44,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:44,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:16:44,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:44,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:16:44,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:16:44,241 INFO L87 Difference]: Start difference. First operand 504 states and 698 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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:16:44,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:44,387 INFO L93 Difference]: Finished difference Result 810 states and 1070 transitions. [2022-07-14 06:16:44,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:16:44,388 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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 26 [2022-07-14 06:16:44,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:44,390 INFO L225 Difference]: With dead ends: 810 [2022-07-14 06:16:44,390 INFO L226 Difference]: Without dead ends: 810 [2022-07-14 06:16:44,390 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:16:44,391 INFO L413 NwaCegarLoop]: 317 mSDtfsCounter, 326 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:44,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 515 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:16:44,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states. [2022-07-14 06:16:44,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 504. [2022-07-14 06:16:44,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 425 states have (on average 1.571764705882353) internal successors, (668), 485 states have internal predecessors, (668), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:16:44,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 698 transitions. [2022-07-14 06:16:44,400 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 698 transitions. Word has length 26 [2022-07-14 06:16:44,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:44,400 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 698 transitions. [2022-07-14 06:16:44,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 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:16:44,401 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 698 transitions. [2022-07-14 06:16:44,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 06:16:44,401 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:44,401 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] [2022-07-14 06:16:44,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-14 06:16:44,401 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:44,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:44,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1491790357, now seen corresponding path program 1 times [2022-07-14 06:16:44,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:44,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707458729] [2022-07-14 06:16:44,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:44,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:44,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:44,454 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:16:44,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:44,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707458729] [2022-07-14 06:16:44,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707458729] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:44,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:44,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:16:44,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847710656] [2022-07-14 06:16:44,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:44,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:16:44,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:44,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:16:44,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:16:44,456 INFO L87 Difference]: Start difference. First operand 504 states and 698 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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:16:44,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:44,487 INFO L93 Difference]: Finished difference Result 708 states and 959 transitions. [2022-07-14 06:16:44,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:16:44,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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 26 [2022-07-14 06:16:44,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:44,489 INFO L225 Difference]: With dead ends: 708 [2022-07-14 06:16:44,490 INFO L226 Difference]: Without dead ends: 708 [2022-07-14 06:16:44,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:16:44,490 INFO L413 NwaCegarLoop]: 347 mSDtfsCounter, 233 mSDsluCounter, 1140 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:44,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1487 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:16:44,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2022-07-14 06:16:44,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 443. [2022-07-14 06:16:44,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 365 states have (on average 1.5726027397260274) internal successors, (574), 424 states have internal predecessors, (574), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:16:44,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 604 transitions. [2022-07-14 06:16:44,512 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 604 transitions. Word has length 26 [2022-07-14 06:16:44,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:44,513 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 604 transitions. [2022-07-14 06:16:44,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 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:16:44,516 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 604 transitions. [2022-07-14 06:16:44,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 06:16:44,517 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:44,517 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:16:44,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-14 06:16:44,517 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:44,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:44,517 INFO L85 PathProgramCache]: Analyzing trace with hash 731575509, now seen corresponding path program 1 times [2022-07-14 06:16:44,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:44,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839410144] [2022-07-14 06:16:44,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:44,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:44,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:44,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:16:44,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:44,562 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:16:44,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:44,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839410144] [2022-07-14 06:16:44,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839410144] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:44,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:44,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:16:44,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507753546] [2022-07-14 06:16:44,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:44,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:16:44,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:44,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:16:44,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:16:44,564 INFO L87 Difference]: Start difference. First operand 443 states and 604 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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:16:44,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:44,680 INFO L93 Difference]: Finished difference Result 517 states and 672 transitions. [2022-07-14 06:16:44,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:16:44,681 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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:16:44,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:44,683 INFO L225 Difference]: With dead ends: 517 [2022-07-14 06:16:44,683 INFO L226 Difference]: Without dead ends: 517 [2022-07-14 06:16:44,683 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:16:44,684 INFO L413 NwaCegarLoop]: 190 mSDtfsCounter, 167 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:44,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 660 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:16:44,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 517 states. [2022-07-14 06:16:44,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 517 to 443. [2022-07-14 06:16:44,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 365 states have (on average 1.5698630136986302) internal successors, (573), 424 states have internal predecessors, (573), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:16:44,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 603 transitions. [2022-07-14 06:16:44,693 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 603 transitions. Word has length 27 [2022-07-14 06:16:44,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:44,693 INFO L495 AbstractCegarLoop]: Abstraction has 443 states and 603 transitions. [2022-07-14 06:16:44,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 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:16:44,693 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 603 transitions. [2022-07-14 06:16:44,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 06:16:44,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:44,693 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:16:44,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-14 06:16:44,694 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:44,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:44,694 INFO L85 PathProgramCache]: Analyzing trace with hash 946649543, now seen corresponding path program 1 times [2022-07-14 06:16:44,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:44,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431602666] [2022-07-14 06:16:44,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:44,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:44,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:44,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:44,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:44,743 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:16:44,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:44,743 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431602666] [2022-07-14 06:16:44,743 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431602666] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:44,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:44,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:16:44,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023794001] [2022-07-14 06:16:44,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:44,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:16:44,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:44,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:16:44,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:16:44,745 INFO L87 Difference]: Start difference. First operand 443 states and 603 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) 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:16:44,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:44,923 INFO L93 Difference]: Finished difference Result 645 states and 864 transitions. [2022-07-14 06:16:44,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:16:44,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) 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:16:44,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:44,925 INFO L225 Difference]: With dead ends: 645 [2022-07-14 06:16:44,925 INFO L226 Difference]: Without dead ends: 645 [2022-07-14 06:16:44,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:16:44,926 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 158 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1294 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:44,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1294 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:16:44,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2022-07-14 06:16:44,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 473. [2022-07-14 06:16:44,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 395 states have (on average 1.539240506329114) internal successors, (608), 454 states have internal predecessors, (608), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:16:44,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 638 transitions. [2022-07-14 06:16:44,937 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 638 transitions. Word has length 27 [2022-07-14 06:16:44,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:44,938 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 638 transitions. [2022-07-14 06:16:44,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) 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:16:44,938 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 638 transitions. [2022-07-14 06:16:44,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 06:16:44,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:44,940 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:16:44,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-14 06:16:44,940 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:44,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:44,940 INFO L85 PathProgramCache]: Analyzing trace with hash 946649737, now seen corresponding path program 1 times [2022-07-14 06:16:44,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:44,941 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896520325] [2022-07-14 06:16:44,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:44,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:44,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:44,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:44,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:44,982 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:16:44,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:44,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896520325] [2022-07-14 06:16:44,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896520325] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:44,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:44,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:16:44,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839270515] [2022-07-14 06:16:44,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:44,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:16:44,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:44,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:16:44,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:16:44,985 INFO L87 Difference]: Start difference. First operand 473 states and 638 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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:16:45,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:45,106 INFO L93 Difference]: Finished difference Result 808 states and 1039 transitions. [2022-07-14 06:16:45,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:16:45,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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:16:45,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:45,108 INFO L225 Difference]: With dead ends: 808 [2022-07-14 06:16:45,108 INFO L226 Difference]: Without dead ends: 808 [2022-07-14 06:16:45,108 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:16:45,109 INFO L413 NwaCegarLoop]: 207 mSDtfsCounter, 482 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:45,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 405 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:16:45,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2022-07-14 06:16:45,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 563. [2022-07-14 06:16:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 485 states have (on average 1.5175257731958762) internal successors, (736), 544 states have internal predecessors, (736), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:16:45,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 766 transitions. [2022-07-14 06:16:45,120 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 766 transitions. Word has length 27 [2022-07-14 06:16:45,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:45,120 INFO L495 AbstractCegarLoop]: Abstraction has 563 states and 766 transitions. [2022-07-14 06:16:45,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 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:16:45,121 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 766 transitions. [2022-07-14 06:16:45,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-14 06:16:45,121 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:45,121 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:16:45,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-14 06:16:45,121 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:45,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:45,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1204004541, now seen corresponding path program 1 times [2022-07-14 06:16:45,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:45,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765870241] [2022-07-14 06:16:45,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:45,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:45,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:45,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:16:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:45,177 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:16:45,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:45,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765870241] [2022-07-14 06:16:45,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765870241] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:45,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:45,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:16:45,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528357261] [2022-07-14 06:16:45,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:45,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:16:45,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:45,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:16:45,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:16:45,179 INFO L87 Difference]: Start difference. First operand 563 states and 766 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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:16:45,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:45,318 INFO L93 Difference]: Finished difference Result 758 states and 993 transitions. [2022-07-14 06:16:45,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:16:45,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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:16:45,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:45,320 INFO L225 Difference]: With dead ends: 758 [2022-07-14 06:16:45,320 INFO L226 Difference]: Without dead ends: 758 [2022-07-14 06:16:45,320 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:16:45,321 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 218 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:45,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 665 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:16:45,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2022-07-14 06:16:45,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 601. [2022-07-14 06:16:45,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 519 states have (on average 1.5144508670520231) internal successors, (786), 580 states have internal predecessors, (786), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 14 states have call predecessors, (24), 12 states have call successors, (24) [2022-07-14 06:16:45,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 822 transitions. [2022-07-14 06:16:45,332 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 822 transitions. Word has length 28 [2022-07-14 06:16:45,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:45,332 INFO L495 AbstractCegarLoop]: Abstraction has 601 states and 822 transitions. [2022-07-14 06:16:45,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 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:16:45,332 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 822 transitions. [2022-07-14 06:16:45,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-14 06:16:45,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:45,332 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:16:45,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-14 06:16:45,333 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:45,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:45,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1495351243, now seen corresponding path program 1 times [2022-07-14 06:16:45,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:45,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054587804] [2022-07-14 06:16:45,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:45,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:45,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:45,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:45,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:45,367 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:16:45,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:45,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054587804] [2022-07-14 06:16:45,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054587804] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:45,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:45,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:16:45,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766414403] [2022-07-14 06:16:45,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:45,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:16:45,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:45,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:16:45,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:16:45,368 INFO L87 Difference]: Start difference. First operand 601 states and 822 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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:16:45,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:45,497 INFO L93 Difference]: Finished difference Result 845 states and 1089 transitions. [2022-07-14 06:16:45,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:16:45,499 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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:16:45,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:45,501 INFO L225 Difference]: With dead ends: 845 [2022-07-14 06:16:45,501 INFO L226 Difference]: Without dead ends: 845 [2022-07-14 06:16:45,502 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:16:45,502 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 317 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:45,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 518 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:16:45,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-07-14 06:16:45,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 510. [2022-07-14 06:16:45,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 429 states have (on average 1.5198135198135199) internal successors, (652), 489 states have internal predecessors, (652), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 14 states have call predecessors, (24), 12 states have call successors, (24) [2022-07-14 06:16:45,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 688 transitions. [2022-07-14 06:16:45,510 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 688 transitions. Word has length 28 [2022-07-14 06:16:45,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:45,510 INFO L495 AbstractCegarLoop]: Abstraction has 510 states and 688 transitions. [2022-07-14 06:16:45,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 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:16:45,511 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 688 transitions. [2022-07-14 06:16:45,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 06:16:45,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:45,511 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:16:45,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-14 06:16:45,511 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:45,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:45,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1910467130, now seen corresponding path program 1 times [2022-07-14 06:16:45,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:45,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481545466] [2022-07-14 06:16:45,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:45,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:45,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:16:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:45,594 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:16:45,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:45,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481545466] [2022-07-14 06:16:45,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481545466] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:45,595 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:45,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:16:45,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321388551] [2022-07-14 06:16:45,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:45,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:16:45,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:45,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:16:45,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:16:45,596 INFO L87 Difference]: Start difference. First operand 510 states and 688 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:16:45,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:45,855 INFO L93 Difference]: Finished difference Result 1252 states and 1682 transitions. [2022-07-14 06:16:45,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:16:45,856 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:16:45,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:45,859 INFO L225 Difference]: With dead ends: 1252 [2022-07-14 06:16:45,859 INFO L226 Difference]: Without dead ends: 1252 [2022-07-14 06:16:45,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 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:16:45,859 INFO L413 NwaCegarLoop]: 316 mSDtfsCounter, 540 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:45,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1622 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:16:45,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2022-07-14 06:16:45,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 644. [2022-07-14 06:16:45,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 563 states have (on average 1.5204262877442274) internal successors, (856), 617 states have internal predecessors, (856), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) [2022-07-14 06:16:45,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 892 transitions. [2022-07-14 06:16:45,870 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 892 transitions. Word has length 30 [2022-07-14 06:16:45,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:45,870 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 892 transitions. [2022-07-14 06:16:45,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:16:45,870 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 892 transitions. [2022-07-14 06:16:45,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 06:16:45,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:45,871 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:16:45,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-14 06:16:45,871 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:45,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:45,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1702169087, now seen corresponding path program 1 times [2022-07-14 06:16:45,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:45,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060703803] [2022-07-14 06:16:45,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:45,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:45,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:45,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:16:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:45,947 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:16:45,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:45,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060703803] [2022-07-14 06:16:45,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060703803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:45,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:45,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:16:45,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032811969] [2022-07-14 06:16:45,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:45,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:16:45,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:45,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:16:45,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:16:45,948 INFO L87 Difference]: Start difference. First operand 644 states and 892 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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:16:46,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:46,355 INFO L93 Difference]: Finished difference Result 1137 states and 1525 transitions. [2022-07-14 06:16:46,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:16:46,355 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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:16:46,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:46,358 INFO L225 Difference]: With dead ends: 1137 [2022-07-14 06:16:46,358 INFO L226 Difference]: Without dead ends: 1137 [2022-07-14 06:16:46,359 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:16:46,359 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 470 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 581 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 1053 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:46,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 1053 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 581 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:16:46,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2022-07-14 06:16:46,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 687. [2022-07-14 06:16:46,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 602 states have (on average 1.5016611295681064) internal successors, (904), 657 states have internal predecessors, (904), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-14 06:16:46,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 946 transitions. [2022-07-14 06:16:46,375 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 946 transitions. Word has length 30 [2022-07-14 06:16:46,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:46,375 INFO L495 AbstractCegarLoop]: Abstraction has 687 states and 946 transitions. [2022-07-14 06:16:46,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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:16:46,375 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 946 transitions. [2022-07-14 06:16:46,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 06:16:46,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:46,375 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:16:46,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-14 06:16:46,375 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:46,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:46,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1975675941, now seen corresponding path program 1 times [2022-07-14 06:16:46,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:46,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250611189] [2022-07-14 06:16:46,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:46,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:46,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:46,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:16:46,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:46,438 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:16:46,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:46,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250611189] [2022-07-14 06:16:46,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250611189] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:46,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:46,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:16:46,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917475797] [2022-07-14 06:16:46,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:46,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:16:46,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:46,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:16:46,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:16:46,440 INFO L87 Difference]: Start difference. First operand 687 states and 946 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:16:46,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:46,467 INFO L93 Difference]: Finished difference Result 1055 states and 1417 transitions. [2022-07-14 06:16:46,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:16:46,468 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:16:46,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:46,471 INFO L225 Difference]: With dead ends: 1055 [2022-07-14 06:16:46,471 INFO L226 Difference]: Without dead ends: 1055 [2022-07-14 06:16:46,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:16:46,471 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 226 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1130 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:46,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1130 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:16:46,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1055 states. [2022-07-14 06:16:46,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1055 to 679. [2022-07-14 06:16:46,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 594 states have (on average 1.5016835016835017) internal successors, (892), 649 states have internal predecessors, (892), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-14 06:16:46,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 934 transitions. [2022-07-14 06:16:46,483 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 934 transitions. Word has length 30 [2022-07-14 06:16:46,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:46,483 INFO L495 AbstractCegarLoop]: Abstraction has 679 states and 934 transitions. [2022-07-14 06:16:46,483 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:16:46,483 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 934 transitions. [2022-07-14 06:16:46,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 06:16:46,484 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:46,484 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:16:46,484 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-14 06:16:46,484 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:46,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:46,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1977522983, now seen corresponding path program 1 times [2022-07-14 06:16:46,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:46,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398691616] [2022-07-14 06:16:46,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:46,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:46,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:46,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:16:46,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:46,546 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:16:46,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:46,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398691616] [2022-07-14 06:16:46,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398691616] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:46,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:46,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:16:46,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202922307] [2022-07-14 06:16:46,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:46,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:16:46,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:46,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:16:46,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:16:46,548 INFO L87 Difference]: Start difference. First operand 679 states and 934 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:16:46,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:46,758 INFO L93 Difference]: Finished difference Result 1259 states and 1668 transitions. [2022-07-14 06:16:46,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:16:46,759 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:16:46,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:46,762 INFO L225 Difference]: With dead ends: 1259 [2022-07-14 06:16:46,762 INFO L226 Difference]: Without dead ends: 1259 [2022-07-14 06:16:46,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 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:16:46,762 INFO L413 NwaCegarLoop]: 388 mSDtfsCounter, 502 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 1798 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:46,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 1798 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:16:46,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2022-07-14 06:16:46,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 646. [2022-07-14 06:16:46,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 564 states have (on average 1.4663120567375887) internal successors, (827), 616 states have internal predecessors, (827), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-14 06:16:46,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 869 transitions. [2022-07-14 06:16:46,772 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 869 transitions. Word has length 30 [2022-07-14 06:16:46,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:46,772 INFO L495 AbstractCegarLoop]: Abstraction has 646 states and 869 transitions. [2022-07-14 06:16:46,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:16:46,773 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 869 transitions. [2022-07-14 06:16:46,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-14 06:16:46,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:46,773 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] [2022-07-14 06:16:46,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-14 06:16:46,773 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:46,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:46,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1227634393, now seen corresponding path program 1 times [2022-07-14 06:16:46,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:46,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311200248] [2022-07-14 06:16:46,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:46,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:46,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:16:46,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:46,856 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:16:46,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:46,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311200248] [2022-07-14 06:16:46,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311200248] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:46,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:46,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:16:46,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078486276] [2022-07-14 06:16:46,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:46,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:16:46,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:46,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:16:46,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:16:46,858 INFO L87 Difference]: Start difference. First operand 646 states and 869 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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:16:47,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:47,178 INFO L93 Difference]: Finished difference Result 925 states and 1194 transitions. [2022-07-14 06:16:47,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:16:47,179 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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 31 [2022-07-14 06:16:47,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:47,181 INFO L225 Difference]: With dead ends: 925 [2022-07-14 06:16:47,181 INFO L226 Difference]: Without dead ends: 925 [2022-07-14 06:16:47,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:16:47,182 INFO L413 NwaCegarLoop]: 217 mSDtfsCounter, 573 mSDsluCounter, 542 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:47,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 759 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:16:47,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2022-07-14 06:16:47,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 646. [2022-07-14 06:16:47,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 646 states, 564 states have (on average 1.4592198581560283) internal successors, (823), 616 states have internal predecessors, (823), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 22 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-14 06:16:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 646 states to 646 states and 865 transitions. [2022-07-14 06:16:47,190 INFO L78 Accepts]: Start accepts. Automaton has 646 states and 865 transitions. Word has length 31 [2022-07-14 06:16:47,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:47,190 INFO L495 AbstractCegarLoop]: Abstraction has 646 states and 865 transitions. [2022-07-14 06:16:47,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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:16:47,190 INFO L276 IsEmpty]: Start isEmpty. Operand 646 states and 865 transitions. [2022-07-14 06:16:47,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 06:16:47,190 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:47,190 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:16:47,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-14 06:16:47,190 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:47,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:47,191 INFO L85 PathProgramCache]: Analyzing trace with hash -2007870586, now seen corresponding path program 1 times [2022-07-14 06:16:47,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:47,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200305697] [2022-07-14 06:16:47,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:47,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:47,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:47,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:16:47,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:47,312 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:16:47,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:47,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200305697] [2022-07-14 06:16:47,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200305697] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:47,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:47,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:16:47,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032777397] [2022-07-14 06:16:47,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:47,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:16:47,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:47,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:16:47,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:16:47,313 INFO L87 Difference]: Start difference. First operand 646 states and 865 transitions. Second operand has 6 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:16:47,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:47,476 INFO L93 Difference]: Finished difference Result 695 states and 913 transitions. [2022-07-14 06:16:47,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:16:47,477 INFO L78 Accepts]: Start accepts. Automaton has has 6 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:16:47,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:47,485 INFO L225 Difference]: With dead ends: 695 [2022-07-14 06:16:47,485 INFO L226 Difference]: Without dead ends: 695 [2022-07-14 06:16:47,485 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:16:47,486 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 110 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:47,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 835 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:16:47,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-07-14 06:16:47,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 625. [2022-07-14 06:16:47,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 543 states have (on average 1.4659300184162063) internal successors, (796), 597 states have internal predecessors, (796), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-14 06:16:47,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 838 transitions. [2022-07-14 06:16:47,494 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 838 transitions. Word has length 32 [2022-07-14 06:16:47,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:47,495 INFO L495 AbstractCegarLoop]: Abstraction has 625 states and 838 transitions. [2022-07-14 06:16:47,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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:16:47,495 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 838 transitions. [2022-07-14 06:16:47,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-14 06:16:47,495 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:47,495 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, 1] [2022-07-14 06:16:47,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-14 06:16:47,496 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:47,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:47,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1362637237, now seen corresponding path program 1 times [2022-07-14 06:16:47,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:47,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961597232] [2022-07-14 06:16:47,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:47,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:47,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:47,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:47,528 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:16:47,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:47,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961597232] [2022-07-14 06:16:47,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961597232] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:47,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:47,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:16:47,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869656168] [2022-07-14 06:16:47,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:47,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:16:47,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:47,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:16:47,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:16:47,532 INFO L87 Difference]: Start difference. First operand 625 states and 838 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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:16:47,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:47,671 INFO L93 Difference]: Finished difference Result 729 states and 966 transitions. [2022-07-14 06:16:47,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:16:47,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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 35 [2022-07-14 06:16:47,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:47,673 INFO L225 Difference]: With dead ends: 729 [2022-07-14 06:16:47,673 INFO L226 Difference]: Without dead ends: 729 [2022-07-14 06:16:47,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:16:47,673 INFO L413 NwaCegarLoop]: 187 mSDtfsCounter, 468 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:47,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 565 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:16:47,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2022-07-14 06:16:47,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 624. [2022-07-14 06:16:47,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 624 states, 543 states have (on average 1.4622467771639043) internal successors, (794), 596 states have internal predecessors, (794), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-14 06:16:47,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 836 transitions. [2022-07-14 06:16:47,680 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 836 transitions. Word has length 35 [2022-07-14 06:16:47,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:47,680 INFO L495 AbstractCegarLoop]: Abstraction has 624 states and 836 transitions. [2022-07-14 06:16:47,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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:16:47,680 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 836 transitions. [2022-07-14 06:16:47,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-14 06:16:47,680 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:47,680 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, 1] [2022-07-14 06:16:47,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-14 06:16:47,681 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:47,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:47,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1362637238, now seen corresponding path program 1 times [2022-07-14 06:16:47,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:47,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281870578] [2022-07-14 06:16:47,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:47,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:47,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:47,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:47,753 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:16:47,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:47,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281870578] [2022-07-14 06:16:47,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281870578] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:47,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:47,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:16:47,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525393740] [2022-07-14 06:16:47,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:47,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:16:47,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:47,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:16:47,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:16:47,755 INFO L87 Difference]: Start difference. First operand 624 states and 836 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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:16:47,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:47,890 INFO L93 Difference]: Finished difference Result 661 states and 851 transitions. [2022-07-14 06:16:47,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:16:47,890 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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 35 [2022-07-14 06:16:47,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:47,891 INFO L225 Difference]: With dead ends: 661 [2022-07-14 06:16:47,891 INFO L226 Difference]: Without dead ends: 661 [2022-07-14 06:16:47,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:16:47,892 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 496 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:47,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 618 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:16:47,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-07-14 06:16:47,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 623. [2022-07-14 06:16:47,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 543 states have (on average 1.4585635359116023) internal successors, (792), 595 states have internal predecessors, (792), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-14 06:16:47,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 834 transitions. [2022-07-14 06:16:47,898 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 834 transitions. Word has length 35 [2022-07-14 06:16:47,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:47,898 INFO L495 AbstractCegarLoop]: Abstraction has 623 states and 834 transitions. [2022-07-14 06:16:47,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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:16:47,899 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 834 transitions. [2022-07-14 06:16:47,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-14 06:16:47,899 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:47,899 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, 1, 1, 1] [2022-07-14 06:16:47,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-14 06:16:47,899 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:47,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:47,899 INFO L85 PathProgramCache]: Analyzing trace with hash -470637162, now seen corresponding path program 1 times [2022-07-14 06:16:47,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:47,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418839772] [2022-07-14 06:16:47,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:47,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:47,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:47,937 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:16:47,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:47,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418839772] [2022-07-14 06:16:47,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418839772] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:47,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:47,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:16:47,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969400735] [2022-07-14 06:16:47,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:47,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:16:47,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:47,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:16:47,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:16:47,938 INFO L87 Difference]: Start difference. First operand 623 states and 834 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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:16:48,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:48,082 INFO L93 Difference]: Finished difference Result 1070 states and 1398 transitions. [2022-07-14 06:16:48,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:16:48,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 37 [2022-07-14 06:16:48,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:48,092 INFO L225 Difference]: With dead ends: 1070 [2022-07-14 06:16:48,092 INFO L226 Difference]: Without dead ends: 1070 [2022-07-14 06:16:48,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:16:48,093 INFO L413 NwaCegarLoop]: 209 mSDtfsCounter, 619 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:48,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 513 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:16:48,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2022-07-14 06:16:48,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 620. [2022-07-14 06:16:48,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 543 states have (on average 1.4475138121546962) internal successors, (786), 592 states have internal predecessors, (786), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-14 06:16:48,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 828 transitions. [2022-07-14 06:16:48,101 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 828 transitions. Word has length 37 [2022-07-14 06:16:48,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:48,102 INFO L495 AbstractCegarLoop]: Abstraction has 620 states and 828 transitions. [2022-07-14 06:16:48,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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:16:48,102 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 828 transitions. [2022-07-14 06:16:48,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-14 06:16:48,102 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:48,102 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, 1, 1, 1] [2022-07-14 06:16:48,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-07-14 06:16:48,102 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:48,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:48,102 INFO L85 PathProgramCache]: Analyzing trace with hash -470637161, now seen corresponding path program 1 times [2022-07-14 06:16:48,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:48,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064424921] [2022-07-14 06:16:48,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:48,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:48,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:48,186 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:16:48,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:48,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064424921] [2022-07-14 06:16:48,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064424921] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:48,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:48,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:16:48,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041085314] [2022-07-14 06:16:48,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:48,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:16:48,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:48,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:16:48,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:16:48,187 INFO L87 Difference]: Start difference. First operand 620 states and 828 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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:16:48,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:48,352 INFO L93 Difference]: Finished difference Result 896 states and 1151 transitions. [2022-07-14 06:16:48,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:16:48,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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 37 [2022-07-14 06:16:48,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:48,354 INFO L225 Difference]: With dead ends: 896 [2022-07-14 06:16:48,354 INFO L226 Difference]: Without dead ends: 896 [2022-07-14 06:16:48,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:16:48,355 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 770 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:48,355 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 609 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:16:48,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 896 states. [2022-07-14 06:16:48,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 896 to 619. [2022-07-14 06:16:48,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 543 states have (on average 1.4438305709023942) internal successors, (784), 591 states have internal predecessors, (784), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-14 06:16:48,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 826 transitions. [2022-07-14 06:16:48,363 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 826 transitions. Word has length 37 [2022-07-14 06:16:48,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:48,367 INFO L495 AbstractCegarLoop]: Abstraction has 619 states and 826 transitions. [2022-07-14 06:16:48,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 6 states have internal predecessors, (35), 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:16:48,367 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 826 transitions. [2022-07-14 06:16:48,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-14 06:16:48,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:48,368 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, 1, 1, 1] [2022-07-14 06:16:48,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-14 06:16:48,368 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:48,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:48,368 INFO L85 PathProgramCache]: Analyzing trace with hash -470637000, now seen corresponding path program 1 times [2022-07-14 06:16:48,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:48,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753451632] [2022-07-14 06:16:48,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:48,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:48,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:48,456 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:16:48,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:48,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753451632] [2022-07-14 06:16:48,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753451632] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:48,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:48,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:16:48,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598247355] [2022-07-14 06:16:48,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:48,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:16:48,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:48,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:16:48,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:16:48,459 INFO L87 Difference]: Start difference. First operand 619 states and 826 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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:16:48,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:48,671 INFO L93 Difference]: Finished difference Result 787 states and 995 transitions. [2022-07-14 06:16:48,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:16:48,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 37 [2022-07-14 06:16:48,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:48,673 INFO L225 Difference]: With dead ends: 787 [2022-07-14 06:16:48,673 INFO L226 Difference]: Without dead ends: 787 [2022-07-14 06:16:48,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:16:48,674 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 375 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:48,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [377 Valid, 551 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:16:48,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2022-07-14 06:16:48,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 619. [2022-07-14 06:16:48,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 619 states, 543 states have (on average 1.4401473296500922) internal successors, (782), 591 states have internal predecessors, (782), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 20 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-14 06:16:48,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 824 transitions. [2022-07-14 06:16:48,685 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 824 transitions. Word has length 37 [2022-07-14 06:16:48,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:48,685 INFO L495 AbstractCegarLoop]: Abstraction has 619 states and 824 transitions. [2022-07-14 06:16:48,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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:16:48,686 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 824 transitions. [2022-07-14 06:16:48,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 06:16:48,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:48,686 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] [2022-07-14 06:16:48,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-14 06:16:48,687 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:48,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:48,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1641938402, now seen corresponding path program 1 times [2022-07-14 06:16:48,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:48,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358748898] [2022-07-14 06:16:48,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:48,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:48,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:16:48,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:48,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-14 06:16:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:48,750 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 06:16:48,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:48,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358748898] [2022-07-14 06:16:48,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358748898] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:16:48,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726529737] [2022-07-14 06:16:48,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:48,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:16:48,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:16:48,752 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:16:48,778 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:16:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:48,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-14 06:16:48,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:16:48,962 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:16:48,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:16:49,027 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:16:49,028 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:16:49,057 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 06:16:49,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [726529737] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:16:49,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:16:49,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-07-14 06:16:49,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008303073] [2022-07-14 06:16:49,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:16:49,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:16:49,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:49,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:16:49,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:16:49,058 INFO L87 Difference]: Start difference. First operand 619 states and 824 transitions. Second operand has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 12 states have internal predecessors, (79), 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:16:49,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:49,623 INFO L93 Difference]: Finished difference Result 1838 states and 2259 transitions. [2022-07-14 06:16:49,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 06:16:49,624 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 12 states have internal predecessors, (79), 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 43 [2022-07-14 06:16:49,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:49,626 INFO L225 Difference]: With dead ends: 1838 [2022-07-14 06:16:49,626 INFO L226 Difference]: Without dead ends: 1838 [2022-07-14 06:16:49,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 90 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:16:49,627 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 3347 mSDsluCounter, 934 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3349 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:49,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3349 Valid, 1186 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:16:49,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2022-07-14 06:16:49,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 735. [2022-07-14 06:16:49,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 653 states have (on average 1.3705972434915774) internal successors, (895), 696 states have internal predecessors, (895), 20 states have call successors, (20), 10 states have call predecessors, (20), 20 states have return successors, (40), 28 states have call predecessors, (40), 20 states have call successors, (40) [2022-07-14 06:16:49,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 955 transitions. [2022-07-14 06:16:49,639 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 955 transitions. Word has length 43 [2022-07-14 06:16:49,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:49,639 INFO L495 AbstractCegarLoop]: Abstraction has 735 states and 955 transitions. [2022-07-14 06:16:49,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 12 states have internal predecessors, (79), 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:16:49,640 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 955 transitions. [2022-07-14 06:16:49,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 06:16:49,640 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:49,640 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:16:49,660 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:16:49,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:16:49,861 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:49,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:49,861 INFO L85 PathProgramCache]: Analyzing trace with hash -974885366, now seen corresponding path program 1 times [2022-07-14 06:16:49,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:49,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013205969] [2022-07-14 06:16:49,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:49,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:49,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:16:49,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:49,900 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:16:49,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:49,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013205969] [2022-07-14 06:16:49,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013205969] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:49,900 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:49,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:16:49,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373151416] [2022-07-14 06:16:49,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:49,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:16:49,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:49,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:16:49,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:16:49,902 INFO L87 Difference]: Start difference. First operand 735 states and 955 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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:16:49,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:49,914 INFO L93 Difference]: Finished difference Result 868 states and 1111 transitions. [2022-07-14 06:16:49,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:16:49,914 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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:16:49,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:49,915 INFO L225 Difference]: With dead ends: 868 [2022-07-14 06:16:49,915 INFO L226 Difference]: Without dead ends: 868 [2022-07-14 06:16:49,916 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:16:49,920 INFO L413 NwaCegarLoop]: 275 mSDtfsCounter, 152 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 582 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:16:49,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 582 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:16:49,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2022-07-14 06:16:49,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 691. [2022-07-14 06:16:49,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 613 states have (on average 1.3800978792822185) internal successors, (846), 656 states have internal predecessors, (846), 18 states have call successors, (18), 9 states have call predecessors, (18), 18 states have return successors, (36), 25 states have call predecessors, (36), 18 states have call successors, (36) [2022-07-14 06:16:49,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 900 transitions. [2022-07-14 06:16:49,937 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 900 transitions. Word has length 45 [2022-07-14 06:16:49,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:49,937 INFO L495 AbstractCegarLoop]: Abstraction has 691 states and 900 transitions. [2022-07-14 06:16:49,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 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:16:49,938 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 900 transitions. [2022-07-14 06:16:49,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 06:16:49,938 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:49,938 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:16:49,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-14 06:16:49,939 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:49,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:49,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1845991888, now seen corresponding path program 1 times [2022-07-14 06:16:49,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:49,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889651255] [2022-07-14 06:16:49,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:49,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:49,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 06:16:50,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:50,001 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:16:50,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:50,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889651255] [2022-07-14 06:16:50,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889651255] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:16:50,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223580354] [2022-07-14 06:16:50,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:50,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:16:50,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:16:50,008 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:16:50,009 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:16:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:50,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-14 06:16:50,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:16:50,178 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:16:50,179 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:16:50,182 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:16:50,183 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:16:50,209 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:16:50,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:16:50,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223580354] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:50,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:16:50,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2022-07-14 06:16:50,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546851080] [2022-07-14 06:16:50,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:50,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:16:50,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:50,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:16:50,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:16:50,211 INFO L87 Difference]: Start difference. First operand 691 states and 900 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 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:16:50,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:50,456 INFO L93 Difference]: Finished difference Result 605 states and 758 transitions. [2022-07-14 06:16:50,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:16:50,456 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 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:16:50,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:50,457 INFO L225 Difference]: With dead ends: 605 [2022-07-14 06:16:50,457 INFO L226 Difference]: Without dead ends: 605 [2022-07-14 06:16:50,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-07-14 06:16:50,458 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 286 mSDsluCounter, 1199 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 1441 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:50,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 1441 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:16:50,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2022-07-14 06:16:50,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 438. [2022-07-14 06:16:50,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 380 states have (on average 1.4052631578947368) internal successors, (534), 418 states have internal predecessors, (534), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 15 states have call predecessors, (16), 8 states have call successors, (16) [2022-07-14 06:16:50,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 558 transitions. [2022-07-14 06:16:50,463 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 558 transitions. Word has length 45 [2022-07-14 06:16:50,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:50,463 INFO L495 AbstractCegarLoop]: Abstraction has 438 states and 558 transitions. [2022-07-14 06:16:50,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 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:16:50,463 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 558 transitions. [2022-07-14 06:16:50,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 06:16:50,464 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:50,464 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:16:50,493 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:16:50,664 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,SelfDestructingSolverStorable43 [2022-07-14 06:16:50,664 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:50,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:50,665 INFO L85 PathProgramCache]: Analyzing trace with hash -102248492, now seen corresponding path program 1 times [2022-07-14 06:16:50,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:50,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888353713] [2022-07-14 06:16:50,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:50,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:50,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:50,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:50,787 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:16:50,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:50,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888353713] [2022-07-14 06:16:50,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888353713] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:50,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:50,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:16:50,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313779266] [2022-07-14 06:16:50,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:50,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:16:50,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:50,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:16:50,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:16:50,789 INFO L87 Difference]: Start difference. First operand 438 states and 558 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 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:16:51,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:51,149 INFO L93 Difference]: Finished difference Result 836 states and 1072 transitions. [2022-07-14 06:16:51,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 06:16:51,149 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 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:16:51,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:51,151 INFO L225 Difference]: With dead ends: 836 [2022-07-14 06:16:51,151 INFO L226 Difference]: Without dead ends: 836 [2022-07-14 06:16:51,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-07-14 06:16:51,151 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 752 mSDsluCounter, 677 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 754 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:51,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [754 Valid, 853 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:16:51,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2022-07-14 06:16:51,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 439. [2022-07-14 06:16:51,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 382 states have (on average 1.4005235602094241) internal successors, (535), 419 states have internal predecessors, (535), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 15 states have call predecessors, (16), 8 states have call successors, (16) [2022-07-14 06:16:51,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 559 transitions. [2022-07-14 06:16:51,156 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 559 transitions. Word has length 48 [2022-07-14 06:16:51,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:51,156 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 559 transitions. [2022-07-14 06:16:51,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 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:16:51,156 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 559 transitions. [2022-07-14 06:16:51,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 06:16:51,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:51,156 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:16:51,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-07-14 06:16:51,157 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:51,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:51,157 INFO L85 PathProgramCache]: Analyzing trace with hash -102248430, now seen corresponding path program 1 times [2022-07-14 06:16:51,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:51,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897343357] [2022-07-14 06:16:51,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:51,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:51,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:51,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:51,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:51,216 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:16:51,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:51,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897343357] [2022-07-14 06:16:51,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897343357] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:51,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:51,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:16:51,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945857576] [2022-07-14 06:16:51,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:51,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:16:51,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:51,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:16:51,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:16:51,217 INFO L87 Difference]: Start difference. First operand 439 states and 559 transitions. Second operand has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 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:16:51,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:51,330 INFO L93 Difference]: Finished difference Result 454 states and 572 transitions. [2022-07-14 06:16:51,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:16:51,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 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:16:51,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:51,331 INFO L225 Difference]: With dead ends: 454 [2022-07-14 06:16:51,331 INFO L226 Difference]: Without dead ends: 454 [2022-07-14 06:16:51,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:16:51,332 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 393 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:51,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 318 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:16:51,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2022-07-14 06:16:51,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 436. [2022-07-14 06:16:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 380 states have (on average 1.394736842105263) internal successors, (530), 416 states have internal predecessors, (530), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 15 states have call predecessors, (16), 8 states have call successors, (16) [2022-07-14 06:16:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 554 transitions. [2022-07-14 06:16:51,336 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 554 transitions. Word has length 48 [2022-07-14 06:16:51,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:51,336 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 554 transitions. [2022-07-14 06:16:51,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.2) internal successors, (46), 6 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:16:51,337 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 554 transitions. [2022-07-14 06:16:51,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-14 06:16:51,337 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:51,337 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:16:51,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-07-14 06:16:51,337 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:51,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:51,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1483644560, now seen corresponding path program 1 times [2022-07-14 06:16:51,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:51,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746301517] [2022-07-14 06:16:51,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:51,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:51,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:51,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:51,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:51,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 06:16:51,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:51,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 06:16:51,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:51,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746301517] [2022-07-14 06:16:51,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746301517] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:51,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:51,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:16:51,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558430518] [2022-07-14 06:16:51,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:51,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:16:51,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:51,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:16:51,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:16:51,410 INFO L87 Difference]: Start difference. First operand 436 states and 554 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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:16:51,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:51,546 INFO L93 Difference]: Finished difference Result 503 states and 640 transitions. [2022-07-14 06:16:51,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:16:51,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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 50 [2022-07-14 06:16:51,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:51,547 INFO L225 Difference]: With dead ends: 503 [2022-07-14 06:16:51,547 INFO L226 Difference]: Without dead ends: 503 [2022-07-14 06:16:51,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:16:51,548 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 465 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:51,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 316 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:16:51,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2022-07-14 06:16:51,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 434. [2022-07-14 06:16:51,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 380 states have (on average 1.3631578947368421) internal successors, (518), 414 states have internal predecessors, (518), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 15 states have call predecessors, (16), 8 states have call successors, (16) [2022-07-14 06:16:51,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 542 transitions. [2022-07-14 06:16:51,552 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 542 transitions. Word has length 50 [2022-07-14 06:16:51,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:51,552 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 542 transitions. [2022-07-14 06:16:51,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 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:16:51,552 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 542 transitions. [2022-07-14 06:16:51,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-14 06:16:51,552 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:51,552 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:51,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-07-14 06:16:51,553 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:51,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:51,553 INFO L85 PathProgramCache]: Analyzing trace with hash -952792567, now seen corresponding path program 1 times [2022-07-14 06:16:51,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:51,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036995107] [2022-07-14 06:16:51,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:51,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:51,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:51,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:51,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:16:51,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:51,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036995107] [2022-07-14 06:16:51,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036995107] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:16:51,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [856226818] [2022-07-14 06:16:51,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:51,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:16:51,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:16:51,761 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:16:51,762 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:16:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:51,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-14 06:16:51,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:16:51,946 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:16:52,176 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 18 treesize of output 14 [2022-07-14 06:16:52,482 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:16:52,483 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 28 treesize of output 9 [2022-07-14 06:16:52,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:16:52,492 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:16:52,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [856226818] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:52,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:16:52,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 20 [2022-07-14 06:16:52,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441016549] [2022-07-14 06:16:52,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:52,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:16:52,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:52,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:16:52,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2022-07-14 06:16:52,493 INFO L87 Difference]: Start difference. First operand 434 states and 542 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 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:16:52,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:52,722 INFO L93 Difference]: Finished difference Result 583 states and 711 transitions. [2022-07-14 06:16:52,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 06:16:52,723 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 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:16:52,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:52,724 INFO L225 Difference]: With dead ends: 583 [2022-07-14 06:16:52,724 INFO L226 Difference]: Without dead ends: 583 [2022-07-14 06:16:52,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=543, Unknown=0, NotChecked=0, Total=650 [2022-07-14 06:16:52,725 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 283 mSDsluCounter, 859 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 175 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:52,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 1003 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 262 Invalid, 0 Unknown, 175 Unchecked, 0.1s Time] [2022-07-14 06:16:52,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2022-07-14 06:16:52,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 504. [2022-07-14 06:16:52,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 447 states have (on average 1.3512304250559284) internal successors, (604), 482 states have internal predecessors, (604), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 16 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:16:52,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 634 transitions. [2022-07-14 06:16:52,729 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 634 transitions. Word has length 51 [2022-07-14 06:16:52,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:52,730 INFO L495 AbstractCegarLoop]: Abstraction has 504 states and 634 transitions. [2022-07-14 06:16:52,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 10 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:16:52,730 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 634 transitions. [2022-07-14 06:16:52,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-14 06:16:52,730 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:52,730 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:52,753 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:16:52,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:16:52,943 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:52,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:52,944 INFO L85 PathProgramCache]: Analyzing trace with hash -952792566, now seen corresponding path program 1 times [2022-07-14 06:16:52,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:52,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77490002] [2022-07-14 06:16:52,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:52,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:52,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:53,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:16:53,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:53,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77490002] [2022-07-14 06:16:53,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77490002] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:53,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:53,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 06:16:53,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535556492] [2022-07-14 06:16:53,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:53,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:16:53,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:53,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:16:53,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:16:53,159 INFO L87 Difference]: Start difference. First operand 504 states and 634 transitions. Second operand has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 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:16:54,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:54,066 INFO L93 Difference]: Finished difference Result 1561 states and 1967 transitions. [2022-07-14 06:16:54,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 06:16:54,077 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 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:16:54,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:54,080 INFO L225 Difference]: With dead ends: 1561 [2022-07-14 06:16:54,080 INFO L226 Difference]: Without dead ends: 1561 [2022-07-14 06:16:54,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2022-07-14 06:16:54,081 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 979 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 981 SdHoareTripleChecker+Valid, 1626 SdHoareTripleChecker+Invalid, 1026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:54,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [981 Valid, 1626 Invalid, 1026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 06:16:54,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2022-07-14 06:16:54,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 752. [2022-07-14 06:16:54,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 683 states have (on average 1.357247437774524) internal successors, (927), 721 states have internal predecessors, (927), 16 states have call successors, (16), 8 states have call predecessors, (16), 16 states have return successors, (32), 22 states have call predecessors, (32), 16 states have call successors, (32) [2022-07-14 06:16:54,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 975 transitions. [2022-07-14 06:16:54,094 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 975 transitions. Word has length 51 [2022-07-14 06:16:54,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:54,095 INFO L495 AbstractCegarLoop]: Abstraction has 752 states and 975 transitions. [2022-07-14 06:16:54,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.454545454545454) internal successors, (49), 12 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:16:54,095 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 975 transitions. [2022-07-14 06:16:54,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-14 06:16:54,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:54,096 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:54,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-07-14 06:16:54,096 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:54,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:54,097 INFO L85 PathProgramCache]: Analyzing trace with hash -950945525, now seen corresponding path program 1 times [2022-07-14 06:16:54,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:54,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553602495] [2022-07-14 06:16:54,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:54,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:54,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:54,554 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:16:54,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:54,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553602495] [2022-07-14 06:16:54,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553602495] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:54,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:16:54,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 06:16:54,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936972055] [2022-07-14 06:16:54,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:54,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:16:54,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:54,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:16:54,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:16:54,556 INFO L87 Difference]: Start difference. First operand 752 states and 975 transitions. Second operand has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 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:16:55,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:55,015 INFO L93 Difference]: Finished difference Result 859 states and 1098 transitions. [2022-07-14 06:16:55,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:16:55,020 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 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:16:55,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:55,022 INFO L225 Difference]: With dead ends: 859 [2022-07-14 06:16:55,022 INFO L226 Difference]: Without dead ends: 859 [2022-07-14 06:16:55,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:16:55,023 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 243 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:55,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 1015 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:16:55,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2022-07-14 06:16:55,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 707. [2022-07-14 06:16:55,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 642 states have (on average 1.35202492211838) internal successors, (868), 678 states have internal predecessors, (868), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 21 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-14 06:16:55,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 910 transitions. [2022-07-14 06:16:55,033 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 910 transitions. Word has length 51 [2022-07-14 06:16:55,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:55,033 INFO L495 AbstractCegarLoop]: Abstraction has 707 states and 910 transitions. [2022-07-14 06:16:55,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.9) internal successors, (49), 10 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:16:55,033 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 910 transitions. [2022-07-14 06:16:55,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-14 06:16:55,034 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:55,034 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:55,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-07-14 06:16:55,034 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:55,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:55,035 INFO L85 PathProgramCache]: Analyzing trace with hash 764231220, now seen corresponding path program 1 times [2022-07-14 06:16:55,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:55,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335302222] [2022-07-14 06:16:55,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:55,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:55,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:55,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:16:55,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:55,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335302222] [2022-07-14 06:16:55,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335302222] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:16:55,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409102564] [2022-07-14 06:16:55,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:55,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:16:55,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:16:55,307 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:16:55,308 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:16:55,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:55,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-14 06:16:55,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:16:55,440 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:16:55,440 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:16:55,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-14 06:16:55,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-14 06:16:55,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:16:55,593 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 25 treesize of output 24 [2022-07-14 06:16:55,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:16:55,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-07-14 06:16:55,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:16:55,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-14 06:16:55,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-14 06:16:55,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-14 06:16:55,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:16:55,770 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:16:55,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409102564] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:16:55,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:16:55,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 23 [2022-07-14 06:16:55,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947384375] [2022-07-14 06:16:55,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:16:55,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:16:55,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:55,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:16:55,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2022-07-14 06:16:55,772 INFO L87 Difference]: Start difference. First operand 707 states and 910 transitions. Second operand has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 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:16:56,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:16:56,454 INFO L93 Difference]: Finished difference Result 1326 states and 1648 transitions. [2022-07-14 06:16:56,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 06:16:56,455 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 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:16:56,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:16:56,457 INFO L225 Difference]: With dead ends: 1326 [2022-07-14 06:16:56,457 INFO L226 Difference]: Without dead ends: 1326 [2022-07-14 06:16:56,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=150, Invalid=842, Unknown=0, NotChecked=0, Total=992 [2022-07-14 06:16:56,457 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 718 mSDsluCounter, 1618 mSDsCounter, 0 mSdLazyCounter, 798 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 722 SdHoareTripleChecker+Valid, 1823 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 798 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:16:56,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [722 Valid, 1823 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 798 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:16:56,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326 states. [2022-07-14 06:16:56,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326 to 710. [2022-07-14 06:16:56,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 645 states have (on average 1.3488372093023255) internal successors, (870), 681 states have internal predecessors, (870), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 21 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-14 06:16:56,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 912 transitions. [2022-07-14 06:16:56,467 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 912 transitions. Word has length 52 [2022-07-14 06:16:56,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:16:56,468 INFO L495 AbstractCegarLoop]: Abstraction has 710 states and 912 transitions. [2022-07-14 06:16:56,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.166666666666667) internal successors, (50), 11 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:16:56,468 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 912 transitions. [2022-07-14 06:16:56,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-14 06:16:56,469 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:16:56,469 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:56,487 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:16:56,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:16:56,680 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:16:56,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:16:56,681 INFO L85 PathProgramCache]: Analyzing trace with hash 945744203, now seen corresponding path program 1 times [2022-07-14 06:16:56,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:16:56,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866231239] [2022-07-14 06:16:56,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:56,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:16:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:56,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:16:56,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:56,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:16:56,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:16:56,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866231239] [2022-07-14 06:16:56,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866231239] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:16:56,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137483806] [2022-07-14 06:16:56,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:16:56,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:16:56,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:16:56,982 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:16:56,984 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:16:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:16:57,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-14 06:16:57,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:16:57,233 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-14 06:16:57,233 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:16:57,506 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:16:57,515 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:16:57,554 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:16:57,561 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:16:57,598 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:16:57,604 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:16:57,688 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-14 06:16:57,688 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 19 treesize of output 22 [2022-07-14 06:16:57,698 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-14 06:16:57,699 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 19 treesize of output 18 [2022-07-14 06:16:58,233 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:16:58,237 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:16:58,238 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 38 treesize of output 28 [2022-07-14 06:16:58,245 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:16:58,248 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 06:16:58,249 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 24 treesize of output 10 [2022-07-14 06:16:58,383 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:16:58,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:16:59,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137483806] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:16:59,356 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:16:59,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 21 [2022-07-14 06:16:59,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372340287] [2022-07-14 06:16:59,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:16:59,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-14 06:16:59,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:16:59,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-14 06:16:59,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=798, Unknown=8, NotChecked=0, Total=930 [2022-07-14 06:16:59,357 INFO L87 Difference]: Start difference. First operand 710 states and 912 transitions. Second operand has 22 states, 21 states have (on average 4.761904761904762) internal successors, (100), 20 states have internal predecessors, (100), 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:17:00,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:00,413 INFO L93 Difference]: Finished difference Result 840 states and 1061 transitions. [2022-07-14 06:17:00,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-14 06:17:00,413 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.761904761904762) internal successors, (100), 20 states have internal predecessors, (100), 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 52 [2022-07-14 06:17:00,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:00,415 INFO L225 Difference]: With dead ends: 840 [2022-07-14 06:17:00,415 INFO L226 Difference]: Without dead ends: 840 [2022-07-14 06:17:00,415 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=354, Invalid=1800, Unknown=8, NotChecked=0, Total=2162 [2022-07-14 06:17:00,415 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 329 mSDsluCounter, 2346 mSDsCounter, 0 mSdLazyCounter, 972 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 2529 SdHoareTripleChecker+Invalid, 1428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 972 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 409 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:00,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 2529 Invalid, 1428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 972 Invalid, 0 Unknown, 409 Unchecked, 0.5s Time] [2022-07-14 06:17:00,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 840 states. [2022-07-14 06:17:00,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 840 to 776. [2022-07-14 06:17:00,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 708 states have (on average 1.3432203389830508) internal successors, (951), 745 states have internal predecessors, (951), 15 states have call successors, (15), 8 states have call predecessors, (15), 16 states have return successors, (30), 22 states have call predecessors, (30), 15 states have call successors, (30) [2022-07-14 06:17:00,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 996 transitions. [2022-07-14 06:17:00,425 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 996 transitions. Word has length 52 [2022-07-14 06:17:00,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:00,425 INFO L495 AbstractCegarLoop]: Abstraction has 776 states and 996 transitions. [2022-07-14 06:17:00,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.761904761904762) internal successors, (100), 20 states have internal predecessors, (100), 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:17:00,425 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 996 transitions. [2022-07-14 06:17:00,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-07-14 06:17:00,425 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:00,426 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:00,467 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:17:00,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:17:00,639 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:17:00,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:00,640 INFO L85 PathProgramCache]: Analyzing trace with hash 945744204, now seen corresponding path program 1 times [2022-07-14 06:17:00,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:00,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862821106] [2022-07-14 06:17:00,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:00,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:00,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:17:00,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:00,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:17:00,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:00,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862821106] [2022-07-14 06:17:00,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862821106] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:17:00,930 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:17:00,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-14 06:17:00,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455146899] [2022-07-14 06:17:00,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:17:00,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 06:17:00,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:17:00,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 06:17:00,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:17:00,930 INFO L87 Difference]: Start difference. First operand 776 states and 996 transitions. Second operand has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 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:17:01,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:01,884 INFO L93 Difference]: Finished difference Result 1538 states and 1900 transitions. [2022-07-14 06:17:01,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 06:17:01,885 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 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:17:01,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:01,887 INFO L225 Difference]: With dead ends: 1538 [2022-07-14 06:17:01,887 INFO L226 Difference]: Without dead ends: 1538 [2022-07-14 06:17:01,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2022-07-14 06:17:01,888 INFO L413 NwaCegarLoop]: 295 mSDtfsCounter, 1013 mSDsluCounter, 2412 mSDsCounter, 0 mSdLazyCounter, 1352 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 2707 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:01,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1017 Valid, 2707 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1352 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-14 06:17:01,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1538 states. [2022-07-14 06:17:01,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1538 to 698. [2022-07-14 06:17:01,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 698 states, 633 states have (on average 1.3554502369668247) internal successors, (858), 669 states have internal predecessors, (858), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 21 states have call predecessors, (28), 14 states have call successors, (28) [2022-07-14 06:17:01,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 698 states to 698 states and 900 transitions. [2022-07-14 06:17:01,898 INFO L78 Accepts]: Start accepts. Automaton has 698 states and 900 transitions. Word has length 52 [2022-07-14 06:17:01,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:01,898 INFO L495 AbstractCegarLoop]: Abstraction has 698 states and 900 transitions. [2022-07-14 06:17:01,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.8461538461538463) internal successors, (50), 13 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:17:01,899 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 900 transitions. [2022-07-14 06:17:01,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-14 06:17:01,901 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:01,902 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:01,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-07-14 06:17:01,902 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:17:01,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:01,902 INFO L85 PathProgramCache]: Analyzing trace with hash -689191823, now seen corresponding path program 1 times [2022-07-14 06:17:01,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:01,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801453921] [2022-07-14 06:17:01,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:01,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:02,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:17:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:02,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:17:02,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:02,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801453921] [2022-07-14 06:17:02,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801453921] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:17:02,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:17:02,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-14 06:17:02,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620177302] [2022-07-14 06:17:02,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:17:02,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-14 06:17:02,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:17:02,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 06:17:02,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:17:02,246 INFO L87 Difference]: Start difference. First operand 698 states and 900 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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:17:03,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:03,998 INFO L93 Difference]: Finished difference Result 1954 states and 2517 transitions. [2022-07-14 06:17:03,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-14 06:17:03,998 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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 53 [2022-07-14 06:17:03,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:04,001 INFO L225 Difference]: With dead ends: 1954 [2022-07-14 06:17:04,002 INFO L226 Difference]: Without dead ends: 1954 [2022-07-14 06:17:04,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 468 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=480, Invalid=1682, Unknown=0, NotChecked=0, Total=2162 [2022-07-14 06:17:04,002 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 2337 mSDsluCounter, 1541 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2347 SdHoareTripleChecker+Valid, 1681 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:04,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2347 Valid, 1681 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1087 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 06:17:04,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2022-07-14 06:17:04,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 818. [2022-07-14 06:17:04,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 741 states have (on average 1.3522267206477734) internal successors, (1002), 780 states have internal predecessors, (1002), 20 states have call successors, (20), 10 states have call predecessors, (20), 20 states have return successors, (40), 27 states have call predecessors, (40), 20 states have call successors, (40) [2022-07-14 06:17:04,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1062 transitions. [2022-07-14 06:17:04,017 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1062 transitions. Word has length 53 [2022-07-14 06:17:04,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:04,017 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 1062 transitions. [2022-07-14 06:17:04,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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:17:04,017 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1062 transitions. [2022-07-14 06:17:04,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-14 06:17:04,018 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:04,018 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:04,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-07-14 06:17:04,018 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:17:04,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:04,019 INFO L85 PathProgramCache]: Analyzing trace with hash -689191822, now seen corresponding path program 1 times [2022-07-14 06:17:04,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:04,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482340862] [2022-07-14 06:17:04,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:04,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:04,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:17:04,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:04,407 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:17:04,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:04,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482340862] [2022-07-14 06:17:04,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482340862] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:17:04,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:17:04,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-14 06:17:04,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546346791] [2022-07-14 06:17:04,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:17:04,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-14 06:17:04,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:17:04,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 06:17:04,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:17:04,408 INFO L87 Difference]: Start difference. First operand 818 states and 1062 transitions. Second operand has 16 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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:17:05,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:05,573 INFO L93 Difference]: Finished difference Result 1761 states and 2266 transitions. [2022-07-14 06:17:05,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-14 06:17:05,573 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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 53 [2022-07-14 06:17:05,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:05,576 INFO L225 Difference]: With dead ends: 1761 [2022-07-14 06:17:05,576 INFO L226 Difference]: Without dead ends: 1761 [2022-07-14 06:17:05,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=360, Invalid=1122, Unknown=0, NotChecked=0, Total=1482 [2022-07-14 06:17:05,576 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 2811 mSDsluCounter, 1179 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2813 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 1004 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:05,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2813 Valid, 1316 Invalid, 1004 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:17:05,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1761 states. [2022-07-14 06:17:05,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1761 to 818. [2022-07-14 06:17:05,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 818 states, 741 states have (on average 1.3508771929824561) internal successors, (1001), 780 states have internal predecessors, (1001), 20 states have call successors, (20), 10 states have call predecessors, (20), 20 states have return successors, (40), 27 states have call predecessors, (40), 20 states have call successors, (40) [2022-07-14 06:17:05,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 818 states to 818 states and 1061 transitions. [2022-07-14 06:17:05,591 INFO L78 Accepts]: Start accepts. Automaton has 818 states and 1061 transitions. Word has length 53 [2022-07-14 06:17:05,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:05,591 INFO L495 AbstractCegarLoop]: Abstraction has 818 states and 1061 transitions. [2022-07-14 06:17:05,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.4) internal successors, (51), 15 states have internal predecessors, (51), 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:17:05,591 INFO L276 IsEmpty]: Start isEmpty. Operand 818 states and 1061 transitions. [2022-07-14 06:17:05,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-14 06:17:05,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:05,591 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:05,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-07-14 06:17:05,592 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:17:05,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:05,592 INFO L85 PathProgramCache]: Analyzing trace with hash -687344781, now seen corresponding path program 1 times [2022-07-14 06:17:05,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:05,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927492022] [2022-07-14 06:17:05,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:05,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:05,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:05,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:17:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:05,755 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:17:05,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:05,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927492022] [2022-07-14 06:17:05,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927492022] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:17:05,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:17:05,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 06:17:05,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642758294] [2022-07-14 06:17:05,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:17:05,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:17:05,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:17:05,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:17:05,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:17:05,757 INFO L87 Difference]: Start difference. First operand 818 states and 1061 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 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:17:06,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:06,216 INFO L93 Difference]: Finished difference Result 1574 states and 2047 transitions. [2022-07-14 06:17:06,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 06:17:06,217 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 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 53 [2022-07-14 06:17:06,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:06,220 INFO L225 Difference]: With dead ends: 1574 [2022-07-14 06:17:06,220 INFO L226 Difference]: Without dead ends: 1574 [2022-07-14 06:17:06,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=343, Unknown=0, NotChecked=0, Total=506 [2022-07-14 06:17:06,220 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 1305 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:06,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 1061 Invalid, 685 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:17:06,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2022-07-14 06:17:06,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1141. [2022-07-14 06:17:06,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1028 states have (on average 1.3375486381322956) internal successors, (1375), 1076 states have internal predecessors, (1375), 38 states have call successors, (38), 19 states have call predecessors, (38), 38 states have return successors, (76), 45 states have call predecessors, (76), 38 states have call successors, (76) [2022-07-14 06:17:06,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1489 transitions. [2022-07-14 06:17:06,235 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1489 transitions. Word has length 53 [2022-07-14 06:17:06,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:06,236 INFO L495 AbstractCegarLoop]: Abstraction has 1141 states and 1489 transitions. [2022-07-14 06:17:06,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 12 states have internal predecessors, (51), 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:17:06,236 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1489 transitions. [2022-07-14 06:17:06,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-14 06:17:06,238 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:06,238 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:06,238 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-07-14 06:17:06,238 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:17:06,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:06,239 INFO L85 PathProgramCache]: Analyzing trace with hash -687344780, now seen corresponding path program 1 times [2022-07-14 06:17:06,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:06,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649154793] [2022-07-14 06:17:06,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:06,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:06,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:17:06,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:06,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:17:06,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:06,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649154793] [2022-07-14 06:17:06,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649154793] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:17:06,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:17:06,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 06:17:06,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014411831] [2022-07-14 06:17:06,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:17:06,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:17:06,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:17:06,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:17:06,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:17:06,490 INFO L87 Difference]: Start difference. First operand 1141 states and 1489 transitions. Second operand has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 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:17:06,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:06,996 INFO L93 Difference]: Finished difference Result 1495 states and 1941 transitions. [2022-07-14 06:17:06,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 06:17:06,997 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 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 53 [2022-07-14 06:17:06,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:06,999 INFO L225 Difference]: With dead ends: 1495 [2022-07-14 06:17:06,999 INFO L226 Difference]: Without dead ends: 1495 [2022-07-14 06:17:06,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2022-07-14 06:17:06,999 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 1115 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1115 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:06,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1115 Valid, 873 Invalid, 535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:17:07,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2022-07-14 06:17:07,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1218. [2022-07-14 06:17:07,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 1097 states have (on average 1.3409298085688242) internal successors, (1471), 1147 states have internal predecessors, (1471), 42 states have call successors, (42), 21 states have call predecessors, (42), 42 states have return successors, (84), 49 states have call predecessors, (84), 42 states have call successors, (84) [2022-07-14 06:17:07,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 1597 transitions. [2022-07-14 06:17:07,013 INFO L78 Accepts]: Start accepts. Automaton has 1218 states and 1597 transitions. Word has length 53 [2022-07-14 06:17:07,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:07,014 INFO L495 AbstractCegarLoop]: Abstraction has 1218 states and 1597 transitions. [2022-07-14 06:17:07,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 5.1) internal successors, (51), 11 states have internal predecessors, (51), 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:17:07,014 INFO L276 IsEmpty]: Start isEmpty. Operand 1218 states and 1597 transitions. [2022-07-14 06:17:07,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-14 06:17:07,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:07,016 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:07,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-07-14 06:17:07,016 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:17:07,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:07,017 INFO L85 PathProgramCache]: Analyzing trace with hash -887259092, now seen corresponding path program 1 times [2022-07-14 06:17:07,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:07,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803701766] [2022-07-14 06:17:07,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:07,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:07,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:17:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:07,264 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:17:07,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:07,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803701766] [2022-07-14 06:17:07,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803701766] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:17:07,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:17:07,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-14 06:17:07,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395351780] [2022-07-14 06:17:07,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:17:07,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 06:17:07,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:17:07,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 06:17:07,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:17:07,266 INFO L87 Difference]: Start difference. First operand 1218 states and 1597 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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:17:08,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:08,185 INFO L93 Difference]: Finished difference Result 2637 states and 3465 transitions. [2022-07-14 06:17:08,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-14 06:17:08,185 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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 53 [2022-07-14 06:17:08,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:08,189 INFO L225 Difference]: With dead ends: 2637 [2022-07-14 06:17:08,189 INFO L226 Difference]: Without dead ends: 2637 [2022-07-14 06:17:08,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=682, Unknown=0, NotChecked=0, Total=870 [2022-07-14 06:17:08,190 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 766 mSDsluCounter, 2039 mSDsCounter, 0 mSdLazyCounter, 1364 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 2321 SdHoareTripleChecker+Invalid, 1395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:08,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 2321 Invalid, 1395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1364 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 06:17:08,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2637 states. [2022-07-14 06:17:08,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2637 to 1549. [2022-07-14 06:17:08,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1549 states, 1404 states have (on average 1.3418803418803418) internal successors, (1884), 1460 states have internal predecessors, (1884), 54 states have call successors, (54), 27 states have call predecessors, (54), 54 states have return successors, (108), 61 states have call predecessors, (108), 54 states have call successors, (108) [2022-07-14 06:17:08,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1549 states to 1549 states and 2046 transitions. [2022-07-14 06:17:08,214 INFO L78 Accepts]: Start accepts. Automaton has 1549 states and 2046 transitions. Word has length 53 [2022-07-14 06:17:08,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:08,215 INFO L495 AbstractCegarLoop]: Abstraction has 1549 states and 2046 transitions. [2022-07-14 06:17:08,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 12 states have internal predecessors, (51), 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:17:08,215 INFO L276 IsEmpty]: Start isEmpty. Operand 1549 states and 2046 transitions. [2022-07-14 06:17:08,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-14 06:17:08,215 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:08,216 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:08,216 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-07-14 06:17:08,216 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:17:08,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:08,216 INFO L85 PathProgramCache]: Analyzing trace with hash -887259091, now seen corresponding path program 1 times [2022-07-14 06:17:08,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:08,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378759270] [2022-07-14 06:17:08,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:08,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:08,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:17:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:08,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:17:08,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:08,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378759270] [2022-07-14 06:17:08,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378759270] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:17:08,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:17:08,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 06:17:08,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559434450] [2022-07-14 06:17:08,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:17:08,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:17:08,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:17:08,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:17:08,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:17:08,520 INFO L87 Difference]: Start difference. First operand 1549 states and 2046 transitions. Second operand has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 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:17:09,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:09,471 INFO L93 Difference]: Finished difference Result 2618 states and 3447 transitions. [2022-07-14 06:17:09,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 06:17:09,471 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 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 53 [2022-07-14 06:17:09,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:09,474 INFO L225 Difference]: With dead ends: 2618 [2022-07-14 06:17:09,475 INFO L226 Difference]: Without dead ends: 2618 [2022-07-14 06:17:09,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=424, Unknown=0, NotChecked=0, Total=552 [2022-07-14 06:17:09,475 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 799 mSDsluCounter, 1794 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 2134 SdHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:09,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 2134 Invalid, 1138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 06:17:09,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2618 states. [2022-07-14 06:17:09,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2618 to 1332. [2022-07-14 06:17:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1332 states, 1211 states have (on average 1.347646573080099) internal successors, (1632), 1261 states have internal predecessors, (1632), 42 states have call successors, (42), 21 states have call predecessors, (42), 42 states have return successors, (84), 49 states have call predecessors, (84), 42 states have call successors, (84) [2022-07-14 06:17:09,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 1758 transitions. [2022-07-14 06:17:09,492 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 1758 transitions. Word has length 53 [2022-07-14 06:17:09,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:09,493 INFO L495 AbstractCegarLoop]: Abstraction has 1332 states and 1758 transitions. [2022-07-14 06:17:09,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.636363636363637) internal successors, (51), 11 states have internal predecessors, (51), 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:17:09,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 1758 transitions. [2022-07-14 06:17:09,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-14 06:17:09,493 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:09,494 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:09,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-07-14 06:17:09,494 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:17:09,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:09,494 INFO L85 PathProgramCache]: Analyzing trace with hash 109888723, now seen corresponding path program 1 times [2022-07-14 06:17:09,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:09,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839225624] [2022-07-14 06:17:09,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:09,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:09,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:09,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:17:09,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:09,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:17:09,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:09,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839225624] [2022-07-14 06:17:09,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839225624] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:17:09,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:17:09,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-14 06:17:09,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824131114] [2022-07-14 06:17:09,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:17:09,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:17:09,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:17:09,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:17:09,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:17:09,705 INFO L87 Difference]: Start difference. First operand 1332 states and 1758 transitions. Second operand has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 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:17:10,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:10,041 INFO L93 Difference]: Finished difference Result 1732 states and 2277 transitions. [2022-07-14 06:17:10,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 06:17:10,041 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 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 54 [2022-07-14 06:17:10,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:10,044 INFO L225 Difference]: With dead ends: 1732 [2022-07-14 06:17:10,044 INFO L226 Difference]: Without dead ends: 1732 [2022-07-14 06:17:10,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2022-07-14 06:17:10,044 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 1323 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1323 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:10,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1323 Valid, 1002 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:17:10,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1732 states. [2022-07-14 06:17:10,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1732 to 1421. [2022-07-14 06:17:10,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1421 states, 1292 states have (on average 1.3506191950464397) internal successors, (1745), 1344 states have internal predecessors, (1745), 46 states have call successors, (46), 23 states have call predecessors, (46), 46 states have return successors, (92), 53 states have call predecessors, (92), 46 states have call successors, (92) [2022-07-14 06:17:10,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1421 states to 1421 states and 1883 transitions. [2022-07-14 06:17:10,062 INFO L78 Accepts]: Start accepts. Automaton has 1421 states and 1883 transitions. Word has length 54 [2022-07-14 06:17:10,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:10,063 INFO L495 AbstractCegarLoop]: Abstraction has 1421 states and 1883 transitions. [2022-07-14 06:17:10,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.333333333333333) internal successors, (52), 12 states have internal predecessors, (52), 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:17:10,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1421 states and 1883 transitions. [2022-07-14 06:17:10,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-14 06:17:10,064 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:10,064 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:10,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-07-14 06:17:10,064 INFO L420 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:17:10,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:10,065 INFO L85 PathProgramCache]: Analyzing trace with hash 167147025, now seen corresponding path program 1 times [2022-07-14 06:17:10,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:10,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479020228] [2022-07-14 06:17:10,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:10,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:10,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:17:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:10,242 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:17:10,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:10,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479020228] [2022-07-14 06:17:10,243 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479020228] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:17:10,243 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:17:10,243 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 06:17:10,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794678710] [2022-07-14 06:17:10,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:17:10,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:17:10,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:17:10,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:17:10,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:17:10,245 INFO L87 Difference]: Start difference. First operand 1421 states and 1883 transitions. Second operand has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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:17:10,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:10,559 INFO L93 Difference]: Finished difference Result 2036 states and 2686 transitions. [2022-07-14 06:17:10,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 06:17:10,560 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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 54 [2022-07-14 06:17:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:10,563 INFO L225 Difference]: With dead ends: 2036 [2022-07-14 06:17:10,563 INFO L226 Difference]: Without dead ends: 2036 [2022-07-14 06:17:10,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2022-07-14 06:17:10,563 INFO L413 NwaCegarLoop]: 173 mSDtfsCounter, 923 mSDsluCounter, 800 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 973 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:10,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 973 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:17:10,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2036 states. [2022-07-14 06:17:10,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2036 to 1715. [2022-07-14 06:17:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1554 states have (on average 1.3468468468468469) internal successors, (2093), 1614 states have internal predecessors, (2093), 62 states have call successors, (62), 31 states have call predecessors, (62), 62 states have return successors, (124), 69 states have call predecessors, (124), 62 states have call successors, (124) [2022-07-14 06:17:10,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2279 transitions. [2022-07-14 06:17:10,594 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2279 transitions. Word has length 54 [2022-07-14 06:17:10,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:10,594 INFO L495 AbstractCegarLoop]: Abstraction has 1715 states and 2279 transitions. [2022-07-14 06:17:10,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 11 states have internal predecessors, (52), 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:17:10,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2279 transitions. [2022-07-14 06:17:10,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-14 06:17:10,595 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:10,595 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:10,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-07-14 06:17:10,595 INFO L420 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:17:10,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:10,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1735229320, now seen corresponding path program 1 times [2022-07-14 06:17:10,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:10,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944260153] [2022-07-14 06:17:10,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:10,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:10,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:10,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:17:10,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:10,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:17:10,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:10,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944260153] [2022-07-14 06:17:10,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944260153] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:17:10,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:17:10,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-14 06:17:10,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835139942] [2022-07-14 06:17:10,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:17:10,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 06:17:10,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:17:10,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 06:17:10,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:17:10,798 INFO L87 Difference]: Start difference. First operand 1715 states and 2279 transitions. Second operand has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 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:17:11,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:11,572 INFO L93 Difference]: Finished difference Result 3043 states and 4052 transitions. [2022-07-14 06:17:11,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-14 06:17:11,579 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 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 54 [2022-07-14 06:17:11,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:11,583 INFO L225 Difference]: With dead ends: 3043 [2022-07-14 06:17:11,583 INFO L226 Difference]: Without dead ends: 3043 [2022-07-14 06:17:11,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=219, Invalid=837, Unknown=0, NotChecked=0, Total=1056 [2022-07-14 06:17:11,584 INFO L413 NwaCegarLoop]: 382 mSDtfsCounter, 744 mSDsluCounter, 2562 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 2944 SdHoareTripleChecker+Invalid, 991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:11,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 2944 Invalid, 991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:17:11,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3043 states. [2022-07-14 06:17:11,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3043 to 1497. [2022-07-14 06:17:11,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1497 states, 1360 states have (on average 1.35) internal successors, (1836), 1414 states have internal predecessors, (1836), 50 states have call successors, (50), 25 states have call predecessors, (50), 50 states have return successors, (100), 57 states have call predecessors, (100), 50 states have call successors, (100) [2022-07-14 06:17:11,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1497 states to 1497 states and 1986 transitions. [2022-07-14 06:17:11,604 INFO L78 Accepts]: Start accepts. Automaton has 1497 states and 1986 transitions. Word has length 54 [2022-07-14 06:17:11,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:11,605 INFO L495 AbstractCegarLoop]: Abstraction has 1497 states and 1986 transitions. [2022-07-14 06:17:11,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.0) internal successors, (52), 12 states have internal predecessors, (52), 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:17:11,605 INFO L276 IsEmpty]: Start isEmpty. Operand 1497 states and 1986 transitions. [2022-07-14 06:17:11,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-14 06:17:11,605 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:11,606 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:11,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-07-14 06:17:11,606 INFO L420 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:17:11,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:11,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1769661897, now seen corresponding path program 1 times [2022-07-14 06:17:11,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:11,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523740661] [2022-07-14 06:17:11,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:11,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:11,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:11,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:17:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:11,896 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:17:11,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:11,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523740661] [2022-07-14 06:17:11,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523740661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:17:11,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:17:11,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-14 06:17:11,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713744846] [2022-07-14 06:17:11,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:17:11,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-14 06:17:11,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:17:11,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-14 06:17:11,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-07-14 06:17:11,897 INFO L87 Difference]: Start difference. First operand 1497 states and 1986 transitions. Second operand has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 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:17:13,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:13,481 INFO L93 Difference]: Finished difference Result 2770 states and 3674 transitions. [2022-07-14 06:17:13,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-14 06:17:13,483 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 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 56 [2022-07-14 06:17:13,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:13,486 INFO L225 Difference]: With dead ends: 2770 [2022-07-14 06:17:13,486 INFO L226 Difference]: Without dead ends: 2770 [2022-07-14 06:17:13,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=439, Invalid=1541, Unknown=0, NotChecked=0, Total=1980 [2022-07-14 06:17:13,486 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 2587 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2589 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:13,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2589 Valid, 1449 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:17:13,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2022-07-14 06:17:13,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 1509. [2022-07-14 06:17:13,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1509 states, 1372 states have (on average 1.349125364431487) internal successors, (1851), 1426 states have internal predecessors, (1851), 50 states have call successors, (50), 25 states have call predecessors, (50), 50 states have return successors, (100), 57 states have call predecessors, (100), 50 states have call successors, (100) [2022-07-14 06:17:13,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1509 states to 1509 states and 2001 transitions. [2022-07-14 06:17:13,512 INFO L78 Accepts]: Start accepts. Automaton has 1509 states and 2001 transitions. Word has length 56 [2022-07-14 06:17:13,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:13,512 INFO L495 AbstractCegarLoop]: Abstraction has 1509 states and 2001 transitions. [2022-07-14 06:17:13,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 3.857142857142857) internal successors, (54), 14 states have internal predecessors, (54), 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:17:13,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1509 states and 2001 transitions. [2022-07-14 06:17:13,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-14 06:17:13,513 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:13,513 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:13,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2022-07-14 06:17:13,513 INFO L420 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:17:13,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:13,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1715958773, now seen corresponding path program 1 times [2022-07-14 06:17:13,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:13,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673517281] [2022-07-14 06:17:13,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:13,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:13,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:17:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:13,649 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:17:13,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:13,649 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673517281] [2022-07-14 06:17:13,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673517281] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:17:13,649 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:17:13,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:17:13,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31447491] [2022-07-14 06:17:13,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:17:13,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:17:13,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:17:13,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:17:13,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:17:13,651 INFO L87 Difference]: Start difference. First operand 1509 states and 2001 transitions. Second operand has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 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:17:13,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:13,968 INFO L93 Difference]: Finished difference Result 2126 states and 2807 transitions. [2022-07-14 06:17:13,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 06:17:13,968 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 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 56 [2022-07-14 06:17:13,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:13,971 INFO L225 Difference]: With dead ends: 2126 [2022-07-14 06:17:13,971 INFO L226 Difference]: Without dead ends: 2126 [2022-07-14 06:17:13,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2022-07-14 06:17:13,971 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 883 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:13,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 792 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:17:13,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2126 states. [2022-07-14 06:17:13,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2126 to 1803. [2022-07-14 06:17:13,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1803 states, 1634 states have (on average 1.3457772337821297) internal successors, (2199), 1696 states have internal predecessors, (2199), 66 states have call successors, (66), 33 states have call predecessors, (66), 66 states have return successors, (132), 73 states have call predecessors, (132), 66 states have call successors, (132) [2022-07-14 06:17:13,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1803 states to 1803 states and 2397 transitions. [2022-07-14 06:17:13,991 INFO L78 Accepts]: Start accepts. Automaton has 1803 states and 2397 transitions. Word has length 56 [2022-07-14 06:17:13,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:13,991 INFO L495 AbstractCegarLoop]: Abstraction has 1803 states and 2397 transitions. [2022-07-14 06:17:13,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.0) internal successors, (54), 10 states have internal predecessors, (54), 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:17:13,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1803 states and 2397 transitions. [2022-07-14 06:17:13,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-14 06:17:13,992 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:13,992 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:17:13,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2022-07-14 06:17:13,993 INFO L420 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:17:13,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:13,993 INFO L85 PathProgramCache]: Analyzing trace with hash -773838198, now seen corresponding path program 1 times [2022-07-14 06:17:13,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:13,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124817955] [2022-07-14 06:17:13,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:13,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:14,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:17:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:14,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 06:17:14,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:14,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-14 06:17:14,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:14,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124817955] [2022-07-14 06:17:14,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124817955] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:17:14,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:17:14,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:17:14,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996827936] [2022-07-14 06:17:14,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:17:14,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:17:14,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:17:14,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:17:14,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:17:14,044 INFO L87 Difference]: Start difference. First operand 1803 states and 2397 transitions. Second operand has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:17:14,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:14,110 INFO L93 Difference]: Finished difference Result 2155 states and 2840 transitions. [2022-07-14 06:17:14,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:17:14,110 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2022-07-14 06:17:14,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:14,113 INFO L225 Difference]: With dead ends: 2155 [2022-07-14 06:17:14,113 INFO L226 Difference]: Without dead ends: 2155 [2022-07-14 06:17:14,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:17:14,113 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 312 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:14,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 497 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:17:14,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2022-07-14 06:17:14,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 1802. [2022-07-14 06:17:14,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1634 states have (on average 1.3347613219094248) internal successors, (2181), 1695 states have internal predecessors, (2181), 66 states have call successors, (66), 33 states have call predecessors, (66), 66 states have return successors, (132), 73 states have call predecessors, (132), 66 states have call successors, (132) [2022-07-14 06:17:14,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2379 transitions. [2022-07-14 06:17:14,134 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2379 transitions. Word has length 57 [2022-07-14 06:17:14,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:14,135 INFO L495 AbstractCegarLoop]: Abstraction has 1802 states and 2379 transitions. [2022-07-14 06:17:14,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.8) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-14 06:17:14,135 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2379 transitions. [2022-07-14 06:17:14,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-14 06:17:14,136 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:14,136 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:14,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2022-07-14 06:17:14,136 INFO L420 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:17:14,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:14,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1106607972, now seen corresponding path program 1 times [2022-07-14 06:17:14,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:14,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603182742] [2022-07-14 06:17:14,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:14,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:14,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:17:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:14,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:17:14,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:14,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603182742] [2022-07-14 06:17:14,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603182742] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:17:14,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:17:14,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 06:17:14,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885409356] [2022-07-14 06:17:14,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:17:14,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:17:14,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:17:14,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:17:14,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:17:14,342 INFO L87 Difference]: Start difference. First operand 1802 states and 2379 transitions. Second operand has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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:17:15,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:15,048 INFO L93 Difference]: Finished difference Result 2781 states and 3648 transitions. [2022-07-14 06:17:15,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 06:17:15,048 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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 56 [2022-07-14 06:17:15,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:15,051 INFO L225 Difference]: With dead ends: 2781 [2022-07-14 06:17:15,051 INFO L226 Difference]: Without dead ends: 2781 [2022-07-14 06:17:15,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2022-07-14 06:17:15,052 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 721 mSDsluCounter, 1984 mSDsCounter, 0 mSdLazyCounter, 973 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 2276 SdHoareTripleChecker+Invalid, 1008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:15,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 2276 Invalid, 1008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 973 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:17:15,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2781 states. [2022-07-14 06:17:15,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2781 to 1500. [2022-07-14 06:17:15,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1500 states, 1364 states have (on average 1.3394428152492668) internal successors, (1827), 1417 states have internal predecessors, (1827), 50 states have call successors, (50), 25 states have call predecessors, (50), 50 states have return successors, (100), 57 states have call predecessors, (100), 50 states have call successors, (100) [2022-07-14 06:17:15,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1977 transitions. [2022-07-14 06:17:15,073 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1977 transitions. Word has length 56 [2022-07-14 06:17:15,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:15,074 INFO L495 AbstractCegarLoop]: Abstraction has 1500 states and 1977 transitions. [2022-07-14 06:17:15,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.909090909090909) internal successors, (54), 11 states have internal predecessors, (54), 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:17:15,074 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1977 transitions. [2022-07-14 06:17:15,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 06:17:15,074 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:15,074 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:17:15,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2022-07-14 06:17:15,074 INFO L420 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:17:15,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:15,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1780819851, now seen corresponding path program 1 times [2022-07-14 06:17:15,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:15,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173926329] [2022-07-14 06:17:15,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:15,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:15,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:17:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:15,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 06:17:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:15,443 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 06:17:15,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:15,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173926329] [2022-07-14 06:17:15,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173926329] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:17:15,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:17:15,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-14 06:17:15,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135274676] [2022-07-14 06:17:15,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:17:15,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-14 06:17:15,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:17:15,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-14 06:17:15,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2022-07-14 06:17:15,445 INFO L87 Difference]: Start difference. First operand 1500 states and 1977 transitions. Second operand has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 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:17:16,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:16,751 INFO L93 Difference]: Finished difference Result 3526 states and 4713 transitions. [2022-07-14 06:17:16,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-14 06:17:16,751 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 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 58 [2022-07-14 06:17:16,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:16,757 INFO L225 Difference]: With dead ends: 3526 [2022-07-14 06:17:16,757 INFO L226 Difference]: Without dead ends: 3524 [2022-07-14 06:17:16,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=329, Invalid=931, Unknown=0, NotChecked=0, Total=1260 [2022-07-14 06:17:16,758 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 1706 mSDsluCounter, 2486 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1706 SdHoareTripleChecker+Valid, 2742 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:16,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1706 Valid, 2742 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1089 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 06:17:16,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3524 states. [2022-07-14 06:17:16,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3524 to 1602. [2022-07-14 06:17:16,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1602 states, 1454 states have (on average 1.3321870701513068) internal successors, (1937), 1510 states have internal predecessors, (1937), 56 states have call successors, (56), 28 states have call predecessors, (56), 56 states have return successors, (112), 63 states have call predecessors, (112), 56 states have call successors, (112) [2022-07-14 06:17:16,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1602 states to 1602 states and 2105 transitions. [2022-07-14 06:17:16,783 INFO L78 Accepts]: Start accepts. Automaton has 1602 states and 2105 transitions. Word has length 58 [2022-07-14 06:17:16,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:16,783 INFO L495 AbstractCegarLoop]: Abstraction has 1602 states and 2105 transitions. [2022-07-14 06:17:16,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.4) internal successors, (51), 15 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:17:16,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1602 states and 2105 transitions. [2022-07-14 06:17:16,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 06:17:16,784 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:16,784 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:17:16,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2022-07-14 06:17:16,784 INFO L420 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:17:16,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:16,784 INFO L85 PathProgramCache]: Analyzing trace with hash 765562808, now seen corresponding path program 1 times [2022-07-14 06:17:16,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:16,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469036197] [2022-07-14 06:17:16,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:16,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:17,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:17:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:17,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 06:17:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:17,095 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 06:17:17,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:17,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469036197] [2022-07-14 06:17:17,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469036197] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:17:17,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432256262] [2022-07-14 06:17:17,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:17,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:17:17,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:17:17,097 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:17:17,098 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:17:17,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:17,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-14 06:17:17,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:17:17,283 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:17:17,513 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:17:17,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:17:17,554 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:17:17,663 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-14 06:17:17,664 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 21 treesize of output 29 [2022-07-14 06:17:17,719 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:17:17,721 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:17:17,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:17:17,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432256262] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:17:17,791 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:17:17,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 26 [2022-07-14 06:17:17,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080815796] [2022-07-14 06:17:17,791 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:17:17,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-14 06:17:17,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:17:17,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-14 06:17:17,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=751, Unknown=0, NotChecked=0, Total=870 [2022-07-14 06:17:17,792 INFO L87 Difference]: Start difference. First operand 1602 states and 2105 transitions. Second operand has 27 states, 26 states have (on average 4.0) internal successors, (104), 24 states have internal predecessors, (104), 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:17:19,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:19,041 INFO L93 Difference]: Finished difference Result 2802 states and 3668 transitions. [2022-07-14 06:17:19,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-14 06:17:19,041 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.0) internal successors, (104), 24 states have internal predecessors, (104), 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 58 [2022-07-14 06:17:19,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:19,047 INFO L225 Difference]: With dead ends: 2802 [2022-07-14 06:17:19,047 INFO L226 Difference]: Without dead ends: 2802 [2022-07-14 06:17:19,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=566, Invalid=2296, Unknown=0, NotChecked=0, Total=2862 [2022-07-14 06:17:19,048 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 2834 mSDsluCounter, 2080 mSDsCounter, 0 mSdLazyCounter, 1356 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2835 SdHoareTripleChecker+Valid, 2243 SdHoareTripleChecker+Invalid, 1532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 1356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:19,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2835 Valid, 2243 Invalid, 1532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 1356 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-14 06:17:19,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2802 states. [2022-07-14 06:17:19,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2802 to 1632. [2022-07-14 06:17:19,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1632 states, 1484 states have (on average 1.3335579514824798) internal successors, (1979), 1537 states have internal predecessors, (1979), 56 states have call successors, (56), 28 states have call predecessors, (56), 56 states have return successors, (112), 66 states have call predecessors, (112), 56 states have call successors, (112) [2022-07-14 06:17:19,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1632 states to 1632 states and 2147 transitions. [2022-07-14 06:17:19,076 INFO L78 Accepts]: Start accepts. Automaton has 1632 states and 2147 transitions. Word has length 58 [2022-07-14 06:17:19,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:19,077 INFO L495 AbstractCegarLoop]: Abstraction has 1632 states and 2147 transitions. [2022-07-14 06:17:19,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.0) internal successors, (104), 24 states have internal predecessors, (104), 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:17:19,077 INFO L276 IsEmpty]: Start isEmpty. Operand 1632 states and 2147 transitions. [2022-07-14 06:17:19,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 06:17:19,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:19,078 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:17:19,107 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:17:19,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:17:19,291 INFO L420 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:17:19,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:19,292 INFO L85 PathProgramCache]: Analyzing trace with hash 765562809, now seen corresponding path program 1 times [2022-07-14 06:17:19,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:19,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086259559] [2022-07-14 06:17:19,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:19,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:19,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:17:19,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:19,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 06:17:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:19,917 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:17:19,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:19,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086259559] [2022-07-14 06:17:19,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086259559] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:17:19,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021023130] [2022-07-14 06:17:19,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:19,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:17:19,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:17:19,919 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:17:19,943 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:17:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:20,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-14 06:17:20,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:17:20,137 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:17:20,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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:17:20,538 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:17:20,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:17:20,625 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 42 treesize of output 33 [2022-07-14 06:17:20,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:17:20,633 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 42 treesize of output 33 [2022-07-14 06:17:20,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:17:20,859 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 18 treesize of output 20 [2022-07-14 06:17:20,866 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-14 06:17:20,867 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 17 treesize of output 17 [2022-07-14 06:17:21,064 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:21,065 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 36 treesize of output 14 [2022-07-14 06:17:21,070 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:21,071 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 9 [2022-07-14 06:17:21,102 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:17:21,102 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:17:21,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021023130] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:17:21,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:17:21,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 32 [2022-07-14 06:17:21,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13994987] [2022-07-14 06:17:21,489 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:17:21,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-14 06:17:21,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:17:21,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-14 06:17:21,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1335, Unknown=0, NotChecked=0, Total=1482 [2022-07-14 06:17:21,490 INFO L87 Difference]: Start difference. First operand 1632 states and 2147 transitions. Second operand has 33 states, 32 states have (on average 3.34375) internal successors, (107), 30 states have internal predecessors, (107), 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:17:25,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:25,880 INFO L93 Difference]: Finished difference Result 3320 states and 4309 transitions. [2022-07-14 06:17:25,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-14 06:17:25,881 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.34375) internal successors, (107), 30 states have internal predecessors, (107), 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:17:25,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:25,887 INFO L225 Difference]: With dead ends: 3320 [2022-07-14 06:17:25,887 INFO L226 Difference]: Without dead ends: 3320 [2022-07-14 06:17:25,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1638 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1114, Invalid=5528, Unknown=0, NotChecked=0, Total=6642 [2022-07-14 06:17:25,889 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 5099 mSDsluCounter, 2302 mSDsCounter, 0 mSdLazyCounter, 2056 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5100 SdHoareTripleChecker+Valid, 2484 SdHoareTripleChecker+Invalid, 2568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 2056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:25,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5100 Valid, 2484 Invalid, 2568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 2056 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-07-14 06:17:25,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3320 states. [2022-07-14 06:17:25,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3320 to 1642. [2022-07-14 06:17:25,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1642 states, 1494 states have (on average 1.3326639892904952) internal successors, (1991), 1546 states have internal predecessors, (1991), 56 states have call successors, (56), 28 states have call predecessors, (56), 56 states have return successors, (112), 67 states have call predecessors, (112), 56 states have call successors, (112) [2022-07-14 06:17:25,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1642 states to 1642 states and 2159 transitions. [2022-07-14 06:17:25,930 INFO L78 Accepts]: Start accepts. Automaton has 1642 states and 2159 transitions. Word has length 58 [2022-07-14 06:17:25,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:25,930 INFO L495 AbstractCegarLoop]: Abstraction has 1642 states and 2159 transitions. [2022-07-14 06:17:25,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.34375) internal successors, (107), 30 states have internal predecessors, (107), 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:17:25,931 INFO L276 IsEmpty]: Start isEmpty. Operand 1642 states and 2159 transitions. [2022-07-14 06:17:25,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-14 06:17:25,931 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:25,932 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:17:25,960 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-14 06:17:26,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:17:26,153 INFO L420 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:17:26,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:26,153 INFO L85 PathProgramCache]: Analyzing trace with hash -581458318, now seen corresponding path program 1 times [2022-07-14 06:17:26,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:26,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860110433] [2022-07-14 06:17:26,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:26,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:26,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:26,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:17:26,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:26,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 06:17:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:26,586 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 06:17:26,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:26,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860110433] [2022-07-14 06:17:26,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860110433] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:17:26,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:17:26,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-14 06:17:26,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365771917] [2022-07-14 06:17:26,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:17:26,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-14 06:17:26,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:17:26,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 06:17:26,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:17:26,588 INFO L87 Difference]: Start difference. First operand 1642 states and 2159 transitions. Second operand has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 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:17:28,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:28,271 INFO L93 Difference]: Finished difference Result 3326 states and 4464 transitions. [2022-07-14 06:17:28,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-14 06:17:28,272 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 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 58 [2022-07-14 06:17:28,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:28,279 INFO L225 Difference]: With dead ends: 3326 [2022-07-14 06:17:28,279 INFO L226 Difference]: Without dead ends: 3322 [2022-07-14 06:17:28,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=373, Invalid=1109, Unknown=0, NotChecked=0, Total=1482 [2022-07-14 06:17:28,280 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 1600 mSDsluCounter, 2189 mSDsCounter, 0 mSdLazyCounter, 996 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1600 SdHoareTripleChecker+Valid, 2435 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:28,280 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1600 Valid, 2435 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 996 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-14 06:17:28,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3322 states. [2022-07-14 06:17:28,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3322 to 1448. [2022-07-14 06:17:28,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1448 states, 1320 states have (on average 1.3287878787878789) internal successors, (1754), 1368 states have internal predecessors, (1754), 46 states have call successors, (46), 23 states have call predecessors, (46), 46 states have return successors, (92), 56 states have call predecessors, (92), 46 states have call successors, (92) [2022-07-14 06:17:28,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 1892 transitions. [2022-07-14 06:17:28,306 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 1892 transitions. Word has length 58 [2022-07-14 06:17:28,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:28,307 INFO L495 AbstractCegarLoop]: Abstraction has 1448 states and 1892 transitions. [2022-07-14 06:17:28,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.25) internal successors, (52), 16 states have internal predecessors, (52), 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:17:28,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 1892 transitions. [2022-07-14 06:17:28,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-14 06:17:28,307 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:28,308 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:17:28,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable69 [2022-07-14 06:17:28,308 INFO L420 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:17:28,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:28,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1541651178, now seen corresponding path program 1 times [2022-07-14 06:17:28,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:28,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529672356] [2022-07-14 06:17:28,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:28,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:28,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:28,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:17:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:28,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 06:17:28,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:28,530 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:17:28,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:28,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529672356] [2022-07-14 06:17:28,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529672356] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:17:28,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839298933] [2022-07-14 06:17:28,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:28,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:17:28,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:17:28,544 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:17:28,545 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:17:28,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:28,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-14 06:17:28,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:17:28,720 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:17:28,989 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:17:29,177 INFO L356 Elim1Store]: treesize reduction 42, result has 38.2 percent of original size [2022-07-14 06:17:29,177 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 25 treesize of output 37 [2022-07-14 06:17:29,287 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:29,288 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 21 treesize of output 9 [2022-07-14 06:17:29,291 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:17:29,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:17:29,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839298933] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:17:29,348 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:17:29,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2022-07-14 06:17:29,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863372457] [2022-07-14 06:17:29,348 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:17:29,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-14 06:17:29,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:17:29,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-14 06:17:29,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2022-07-14 06:17:29,349 INFO L87 Difference]: Start difference. First operand 1448 states and 1892 transitions. Second operand has 22 states, 21 states have (on average 5.142857142857143) internal successors, (108), 20 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:17:30,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:30,105 INFO L93 Difference]: Finished difference Result 3724 states and 4918 transitions. [2022-07-14 06:17:30,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 06:17:30,105 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 5.142857142857143) internal successors, (108), 20 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 59 [2022-07-14 06:17:30,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:30,111 INFO L225 Difference]: With dead ends: 3724 [2022-07-14 06:17:30,111 INFO L226 Difference]: Without dead ends: 3724 [2022-07-14 06:17:30,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=220, Invalid=1112, Unknown=0, NotChecked=0, Total=1332 [2022-07-14 06:17:30,112 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 1170 mSDsluCounter, 3104 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1170 SdHoareTripleChecker+Valid, 3322 SdHoareTripleChecker+Invalid, 1441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 318 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:30,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1170 Valid, 3322 Invalid, 1441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1090 Invalid, 0 Unknown, 318 Unchecked, 0.5s Time] [2022-07-14 06:17:30,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2022-07-14 06:17:30,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3305. [2022-07-14 06:17:30,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3305 states, 3050 states have (on average 1.3432786885245902) internal successors, (4097), 3126 states have internal predecessors, (4097), 116 states have call successors, (116), 52 states have call predecessors, (116), 103 states have return successors, (231), 126 states have call predecessors, (231), 116 states have call successors, (231) [2022-07-14 06:17:30,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3305 states to 3305 states and 4444 transitions. [2022-07-14 06:17:30,153 INFO L78 Accepts]: Start accepts. Automaton has 3305 states and 4444 transitions. Word has length 59 [2022-07-14 06:17:30,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:30,154 INFO L495 AbstractCegarLoop]: Abstraction has 3305 states and 4444 transitions. [2022-07-14 06:17:30,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 5.142857142857143) internal successors, (108), 20 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:17:30,154 INFO L276 IsEmpty]: Start isEmpty. Operand 3305 states and 4444 transitions. [2022-07-14 06:17:30,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-14 06:17:30,155 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:30,155 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:17:30,176 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:17:30,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:17:30,376 INFO L420 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:17:30,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:30,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1541651179, now seen corresponding path program 1 times [2022-07-14 06:17:30,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:30,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363132715] [2022-07-14 06:17:30,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:30,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:30,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:17:30,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:30,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 06:17:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:17:30,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:30,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363132715] [2022-07-14 06:17:30,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363132715] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:17:30,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601303340] [2022-07-14 06:17:30,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:30,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:17:30,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:17:30,749 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:17:30,750 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:17:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:30,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-14 06:17:30,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:17:30,922 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:17:30,925 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:17:31,354 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:17:31,357 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:17:31,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:17:31,571 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 20 treesize of output 22 [2022-07-14 06:17:31,577 INFO L356 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2022-07-14 06:17:31,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-07-14 06:17:31,737 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:31,738 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 21 treesize of output 9 [2022-07-14 06:17:31,741 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:31,741 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 19 treesize of output 7 [2022-07-14 06:17:31,762 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:17:31,762 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:17:31,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601303340] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:17:31,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:17:31,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 26 [2022-07-14 06:17:31,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103789582] [2022-07-14 06:17:31,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:17:31,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-14 06:17:31,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:17:31,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-14 06:17:31,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=876, Unknown=0, NotChecked=0, Total=992 [2022-07-14 06:17:31,963 INFO L87 Difference]: Start difference. First operand 3305 states and 4444 transitions. Second operand has 27 states, 26 states have (on average 4.1923076923076925) internal successors, (109), 25 states have internal predecessors, (109), 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:17:33,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:33,350 INFO L93 Difference]: Finished difference Result 5034 states and 6787 transitions. [2022-07-14 06:17:33,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 06:17:33,351 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 4.1923076923076925) internal successors, (109), 25 states have internal predecessors, (109), 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:17:33,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:33,358 INFO L225 Difference]: With dead ends: 5034 [2022-07-14 06:17:33,358 INFO L226 Difference]: Without dead ends: 5034 [2022-07-14 06:17:33,359 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=348, Invalid=1814, Unknown=0, NotChecked=0, Total=2162 [2022-07-14 06:17:33,359 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 1353 mSDsluCounter, 2591 mSDsCounter, 0 mSdLazyCounter, 1401 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1353 SdHoareTripleChecker+Valid, 2791 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 254 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:33,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1353 Valid, 2791 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1401 Invalid, 0 Unknown, 254 Unchecked, 0.7s Time] [2022-07-14 06:17:33,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5034 states. [2022-07-14 06:17:33,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5034 to 4733. [2022-07-14 06:17:33,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4733 states, 4382 states have (on average 1.3539479689639433) internal successors, (5933), 4481 states have internal predecessors, (5933), 170 states have call successors, (170), 73 states have call predecessors, (170), 145 states have return successors, (339), 178 states have call predecessors, (339), 170 states have call successors, (339) [2022-07-14 06:17:33,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4733 states to 4733 states and 6442 transitions. [2022-07-14 06:17:33,419 INFO L78 Accepts]: Start accepts. Automaton has 4733 states and 6442 transitions. Word has length 59 [2022-07-14 06:17:33,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:33,419 INFO L495 AbstractCegarLoop]: Abstraction has 4733 states and 6442 transitions. [2022-07-14 06:17:33,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 4.1923076923076925) internal successors, (109), 25 states have internal predecessors, (109), 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:17:33,420 INFO L276 IsEmpty]: Start isEmpty. Operand 4733 states and 6442 transitions. [2022-07-14 06:17:33,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-14 06:17:33,420 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:33,420 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:17:33,442 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:17:33,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:17:33,634 INFO L420 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:17:33,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:33,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1325471971, now seen corresponding path program 1 times [2022-07-14 06:17:33,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:33,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880960239] [2022-07-14 06:17:33,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:33,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:33,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:33,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:17:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:33,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 06:17:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:33,957 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-14 06:17:33,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:33,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880960239] [2022-07-14 06:17:33,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880960239] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:17:33,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296160335] [2022-07-14 06:17:33,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:33,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:17:33,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:17:33,959 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:17:33,960 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:17:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:34,086 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 79 conjunts are in the unsatisfiable core [2022-07-14 06:17:34,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:17:34,177 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:17:34,415 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:17:34,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:17:34,490 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:17:34,607 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-14 06:17:34,608 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 21 treesize of output 29 [2022-07-14 06:17:34,666 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:17:34,668 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:17:34,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:17:34,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296160335] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:17:34,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:17:34,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 24 [2022-07-14 06:17:34,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870510347] [2022-07-14 06:17:34,726 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:17:34,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-14 06:17:34,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:17:34,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-14 06:17:34,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2022-07-14 06:17:34,727 INFO L87 Difference]: Start difference. First operand 4733 states and 6442 transitions. Second operand has 25 states, 24 states have (on average 4.5) internal successors, (108), 21 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:17:36,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:36,110 INFO L93 Difference]: Finished difference Result 7562 states and 10338 transitions. [2022-07-14 06:17:36,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 06:17:36,111 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.5) internal successors, (108), 21 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 59 [2022-07-14 06:17:36,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:36,124 INFO L225 Difference]: With dead ends: 7562 [2022-07-14 06:17:36,124 INFO L226 Difference]: Without dead ends: 7562 [2022-07-14 06:17:36,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 327 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=309, Invalid=1251, Unknown=0, NotChecked=0, Total=1560 [2022-07-14 06:17:36,125 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 1266 mSDsluCounter, 3502 mSDsCounter, 0 mSdLazyCounter, 2190 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1266 SdHoareTripleChecker+Valid, 3830 SdHoareTripleChecker+Invalid, 2236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:36,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1266 Valid, 3830 Invalid, 2236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2190 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-14 06:17:36,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7562 states. [2022-07-14 06:17:36,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7562 to 5149. [2022-07-14 06:17:36,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5149 states, 4756 states have (on average 1.3500841042893188) internal successors, (6421), 4857 states have internal predecessors, (6421), 184 states have call successors, (184), 87 states have call predecessors, (184), 173 states have return successors, (367), 204 states have call predecessors, (367), 184 states have call successors, (367) [2022-07-14 06:17:36,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5149 states to 5149 states and 6972 transitions. [2022-07-14 06:17:36,214 INFO L78 Accepts]: Start accepts. Automaton has 5149 states and 6972 transitions. Word has length 59 [2022-07-14 06:17:36,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:36,214 INFO L495 AbstractCegarLoop]: Abstraction has 5149 states and 6972 transitions. [2022-07-14 06:17:36,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.5) internal successors, (108), 21 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:17:36,215 INFO L276 IsEmpty]: Start isEmpty. Operand 5149 states and 6972 transitions. [2022-07-14 06:17:36,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-14 06:17:36,215 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:36,215 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:17:36,240 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:17:36,440 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,SelfDestructingSolverStorable72 [2022-07-14 06:17:36,441 INFO L420 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:17:36,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:36,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1325471972, now seen corresponding path program 1 times [2022-07-14 06:17:36,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:36,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604993386] [2022-07-14 06:17:36,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:36,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:36,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:37,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:17:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:37,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-07-14 06:17:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:37,074 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 06:17:37,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:37,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604993386] [2022-07-14 06:17:37,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604993386] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:17:37,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40182441] [2022-07-14 06:17:37,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:37,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:17:37,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:17:37,076 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:17:37,106 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:17:37,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:37,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 99 conjunts are in the unsatisfiable core [2022-07-14 06:17:37,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:17:37,325 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:17:37,334 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:17:37,681 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:17:37,690 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:17:37,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:17:37,772 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 42 treesize of output 33 [2022-07-14 06:17:37,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:17:37,780 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 27 treesize of output 26 [2022-07-14 06:17:37,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:17:37,951 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 16 treesize of output 18 [2022-07-14 06:17:37,957 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-14 06:17:37,957 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 15 treesize of output 15 [2022-07-14 06:17:38,061 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 19 treesize of output 7 [2022-07-14 06:17:38,065 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:17:38,082 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:17:38,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:17:38,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40182441] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:17:38,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:17:38,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12] total 28 [2022-07-14 06:17:38,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468116880] [2022-07-14 06:17:38,244 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:17:38,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-14 06:17:38,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:17:38,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-14 06:17:38,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=977, Unknown=0, NotChecked=0, Total=1122 [2022-07-14 06:17:38,245 INFO L87 Difference]: Start difference. First operand 5149 states and 6972 transitions. Second operand has 29 states, 28 states have (on average 3.8214285714285716) internal successors, (107), 25 states have internal predecessors, (107), 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:17:40,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:17:40,816 INFO L93 Difference]: Finished difference Result 8313 states and 11372 transitions. [2022-07-14 06:17:40,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-14 06:17:40,816 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 3.8214285714285716) internal successors, (107), 25 states have internal predecessors, (107), 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 59 [2022-07-14 06:17:40,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:17:40,831 INFO L225 Difference]: With dead ends: 8313 [2022-07-14 06:17:40,831 INFO L226 Difference]: Without dead ends: 8313 [2022-07-14 06:17:40,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 730 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=539, Invalid=2113, Unknown=0, NotChecked=0, Total=2652 [2022-07-14 06:17:40,832 INFO L413 NwaCegarLoop]: 320 mSDtfsCounter, 1986 mSDsluCounter, 3427 mSDsCounter, 0 mSdLazyCounter, 2926 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1986 SdHoareTripleChecker+Valid, 3747 SdHoareTripleChecker+Invalid, 3008 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 2926 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:17:40,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1986 Valid, 3747 Invalid, 3008 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 2926 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-14 06:17:40,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8313 states. [2022-07-14 06:17:40,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8313 to 5226. [2022-07-14 06:17:40,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5226 states, 4829 states have (on average 1.3491406088217022) internal successors, (6515), 4929 states have internal predecessors, (6515), 188 states have call successors, (188), 87 states have call predecessors, (188), 173 states have return successors, (375), 209 states have call predecessors, (375), 188 states have call successors, (375) [2022-07-14 06:17:40,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5226 states to 5226 states and 7078 transitions. [2022-07-14 06:17:40,923 INFO L78 Accepts]: Start accepts. Automaton has 5226 states and 7078 transitions. Word has length 59 [2022-07-14 06:17:40,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:17:40,923 INFO L495 AbstractCegarLoop]: Abstraction has 5226 states and 7078 transitions. [2022-07-14 06:17:40,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 3.8214285714285716) internal successors, (107), 25 states have internal predecessors, (107), 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:17:40,923 INFO L276 IsEmpty]: Start isEmpty. Operand 5226 states and 7078 transitions. [2022-07-14 06:17:40,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-14 06:17:40,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:17:40,924 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:17:40,944 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:17:41,135 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,SelfDestructingSolverStorable73 [2022-07-14 06:17:41,135 INFO L420 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:17:41,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:17:41,136 INFO L85 PathProgramCache]: Analyzing trace with hash 726312246, now seen corresponding path program 1 times [2022-07-14 06:17:41,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:17:41,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928344106] [2022-07-14 06:17:41,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:41,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:17:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:42,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:17:42,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:42,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:17:42,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:17:42,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928344106] [2022-07-14 06:17:42,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928344106] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:17:42,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495319169] [2022-07-14 06:17:42,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:17:42,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:17:42,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:17:42,048 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:17:42,049 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:17:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:17:42,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 87 conjunts are in the unsatisfiable core [2022-07-14 06:17:42,185 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:17:42,238 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:17:42,239 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:17:42,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-14 06:17:42,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-14 06:17:42,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:17:42,595 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 27 treesize of output 26 [2022-07-14 06:17:42,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:17:42,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-07-14 06:17:42,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:17:42,677 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 21 treesize of output 20 [2022-07-14 06:17:42,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:17:42,682 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 21 treesize of output 20 [2022-07-14 06:17:42,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:17:42,800 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 16 treesize of output 18 [2022-07-14 06:17:42,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:17:42,805 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 16 treesize of output 18 [2022-07-14 06:17:42,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:17:42,955 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 25 treesize of output 24 [2022-07-14 06:17:42,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:17:42,959 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 24 treesize of output 26 [2022-07-14 06:17:43,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:17:43,031 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:17:43,037 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-14 06:17:43,037 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 51 [2022-07-14 06:17:43,046 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 24 treesize of output 26 [2022-07-14 06:17:43,343 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:17:43,351 INFO L356 Elim1Store]: treesize reduction 27, result has 22.9 percent of original size [2022-07-14 06:17:43,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 42 [2022-07-14 06:17:43,358 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:43,358 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 1 case distinctions, treesize of input 21 treesize of output 21 [2022-07-14 06:17:43,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:17:43,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:17:43,624 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1684 Int) (v_ArrVal_1683 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1683) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |c_ULTIMATE.start_append_one_~list#1.offset|) v_ArrVal_1684)) |c_~#list~0.base|) (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4)))) 4) 0)) (forall ((v_ArrVal_1684 Int)) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |c_ULTIMATE.start_append_one_~list#1.offset|) v_ArrVal_1684)))) (select .cse0 (select (select .cse0 |c_~#list~0.base|) (+ |c_~#list~0.offset| (* ~unnamed1~0~LIST_BEG 4))))) 4) 0))) is different from false [2022-07-14 06:17:44,621 INFO L356 Elim1Store]: treesize reduction 90, result has 38.8 percent of original size [2022-07-14 06:17:44,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 118 treesize of output 127 [2022-07-14 06:17:44,658 INFO L356 Elim1Store]: treesize reduction 90, result has 38.8 percent of original size [2022-07-14 06:17:44,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 103 [2022-07-14 06:17:44,676 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:17:44,677 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 482 treesize of output 488 [2022-07-14 06:17:44,823 INFO L356 Elim1Store]: treesize reduction 142, result has 68.1 percent of original size [2022-07-14 06:17:44,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 2704 treesize of output 2708 [2022-07-14 06:17:44,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2376 treesize of output 2308 [2022-07-14 06:17:44,872 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2308 treesize of output 2274 [2022-07-14 06:17:44,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4698 treesize of output 4236 [2022-07-14 06:17:53,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 475 treesize of output 451 [2022-07-14 06:17:54,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 266 treesize of output 254 [2022-07-14 06:17:54,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 266 treesize of output 254 [2022-07-14 06:17:56,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 198 [2022-07-14 06:17:56,459 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 436 treesize of output 412 [2022-07-14 06:17:56,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 436 treesize of output 412 [2022-07-14 06:17:56,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 432 treesize of output 408 [2022-07-14 06:17:56,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 649 treesize of output 613 [2022-07-14 06:17:56,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 653 treesize of output 617 [2022-07-14 06:17:57,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 198 [2022-07-14 06:17:59,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 198 [2022-07-14 06:17:59,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 436 treesize of output 412 [2022-07-14 06:17:59,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 436 treesize of output 412 [2022-07-14 06:18:00,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 432 treesize of output 408 [2022-07-14 06:18:00,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 649 treesize of output 613 [2022-07-14 06:18:00,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 653 treesize of output 617 [2022-07-14 06:18:00,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 198 [2022-07-14 06:18:02,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 198 [2022-07-14 06:18:02,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 436 treesize of output 412 [2022-07-14 06:18:02,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 436 treesize of output 412 [2022-07-14 06:18:02,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 432 treesize of output 408 [2022-07-14 06:18:02,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 649 treesize of output 613 [2022-07-14 06:18:02,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 653 treesize of output 617 [2022-07-14 06:18:03,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 210 treesize of output 198 [2022-07-14 06:18:06,551 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-14 06:18:06,569 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-14 06:18:06,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:18:06,768 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:545) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:528) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:348) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.pushMinionEliminatees(QuantifierPushUtilsForSubsetPush.java:254) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForSubsetPush.sequentialSubsetPush(QuantifierPushUtilsForSubsetPush.java:151) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:348) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:176) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:265) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:251) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:90) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:266) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:147) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:248) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:409) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:300) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:260) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:173) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:152) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-07-14 06:18:06,773 INFO L158 Benchmark]: Toolchain (without parser) took 90591.14ms. Allocated memory was 107.0MB in the beginning and 474.0MB in the end (delta: 367.0MB). Free memory was 69.1MB in the beginning and 228.2MB in the end (delta: -159.1MB). Peak memory consumption was 293.5MB. Max. memory is 16.1GB. [2022-07-14 06:18:06,773 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 107.0MB. Free memory was 79.6MB in the beginning and 79.6MB in the end (delta: 21.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:18:06,773 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.57ms. Allocated memory is still 107.0MB. Free memory was 68.8MB in the beginning and 69.1MB in the end (delta: -238.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 06:18:06,773 INFO L158 Benchmark]: Boogie Procedure Inliner took 78.91ms. Allocated memory is still 107.0MB. Free memory was 68.6MB in the beginning and 66.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-14 06:18:06,773 INFO L158 Benchmark]: Boogie Preprocessor took 49.21ms. Allocated memory is still 107.0MB. Free memory was 66.0MB in the beginning and 63.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 06:18:06,773 INFO L158 Benchmark]: RCFGBuilder took 635.97ms. Allocated memory is still 107.0MB. Free memory was 63.9MB in the beginning and 79.8MB in the end (delta: -15.9MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2022-07-14 06:18:06,773 INFO L158 Benchmark]: TraceAbstraction took 89407.07ms. Allocated memory was 130.0MB in the beginning and 474.0MB in the end (delta: 343.9MB). Free memory was 104.3MB in the beginning and 228.2MB in the end (delta: -123.8MB). Peak memory consumption was 305.6MB. Max. memory is 16.1GB. [2022-07-14 06:18:06,775 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 107.0MB. Free memory was 79.6MB in the beginning and 79.6MB in the end (delta: 21.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.57ms. Allocated memory is still 107.0MB. Free memory was 68.8MB in the beginning and 69.1MB in the end (delta: -238.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 78.91ms. Allocated memory is still 107.0MB. Free memory was 68.6MB in the beginning and 66.0MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.21ms. Allocated memory is still 107.0MB. Free memory was 66.0MB in the beginning and 63.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 635.97ms. Allocated memory is still 107.0MB. Free memory was 63.9MB in the beginning and 79.8MB in the end (delta: -15.9MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. * TraceAbstraction took 89407.07ms. Allocated memory was 130.0MB in the beginning and 474.0MB in the end (delta: 343.9MB). Free memory was 104.3MB in the beginning and 228.2MB in the end (delta: -123.8MB). Peak memory consumption was 305.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-14 06:18:06,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0217.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 163bc3b45d6f21a8e478003f84571178259b289b3d9717ecadbc4595fc507bec --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:18:08,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:18:08,673 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:18:08,706 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:18:08,706 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:18:08,707 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:18:08,710 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:18:08,712 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:18:08,714 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:18:08,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:18:08,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:18:08,719 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:18:08,719 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:18:08,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:18:08,722 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:18:08,727 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:18:08,728 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:18:08,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:18:08,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:18:08,738 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:18:08,740 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:18:08,741 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:18:08,743 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:18:08,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:18:08,745 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:18:08,748 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:18:08,749 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:18:08,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:18:08,750 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:18:08,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:18:08,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:18:08,752 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:18:08,753 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:18:08,754 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:18:08,755 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:18:08,756 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:18:08,757 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:18:08,757 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:18:08,757 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:18:08,758 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:18:08,758 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:18:08,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:18:08,768 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-14 06:18:08,802 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:18:08,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:18:08,803 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:18:08,803 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:18:08,804 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:18:08,804 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:18:08,805 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:18:08,805 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:18:08,806 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:18:08,806 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:18:08,807 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:18:08,807 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:18:08,816 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:18:08,816 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:18:08,816 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:18:08,816 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:18:08,817 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:18:08,817 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:18:08,817 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:18:08,817 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:18:08,817 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 06:18:08,817 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 06:18:08,817 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:18:08,817 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:18:08,818 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:18:08,818 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:18:08,818 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:18:08,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:18:08,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:18:08,818 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:18:08,818 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 06:18:08,819 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 06:18:08,819 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 06:18:08,819 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> 163bc3b45d6f21a8e478003f84571178259b289b3d9717ecadbc4595fc507bec [2022-07-14 06:18:09,147 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:18:09,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:18:09,179 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:18:09,180 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:18:09,180 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:18:09,182 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0217.i [2022-07-14 06:18:09,243 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b32cd6b4d/c30272c25fe64bea9b53e689e17e2b64/FLAG936006439 [2022-07-14 06:18:09,720 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:18:09,720 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0217.i [2022-07-14 06:18:09,743 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b32cd6b4d/c30272c25fe64bea9b53e689e17e2b64/FLAG936006439 [2022-07-14 06:18:10,220 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b32cd6b4d/c30272c25fe64bea9b53e689e17e2b64 [2022-07-14 06:18:10,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:18:10,223 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:18:10,225 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:18:10,225 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:18:10,228 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:18:10,228 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:18:10" (1/1) ... [2022-07-14 06:18:10,229 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c0a3ffd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:18:10, skipping insertion in model container [2022-07-14 06:18:10,232 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:18:10" (1/1) ... [2022-07-14 06:18:10,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:18:10,280 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:18:10,585 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:18:10,595 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:18:10,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:18:10,685 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:18:10,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:18:10 WrapperNode [2022-07-14 06:18:10,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:18:10,688 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:18:10,688 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:18:10,688 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:18:10,693 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:18:10" (1/1) ... [2022-07-14 06:18:10,722 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:18:10" (1/1) ... [2022-07-14 06:18:10,764 INFO L137 Inliner]: procedures = 182, calls = 47, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 206 [2022-07-14 06:18:10,764 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:18:10,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:18:10,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:18:10,766 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:18:10,772 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:18:10" (1/1) ... [2022-07-14 06:18:10,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:18:10" (1/1) ... [2022-07-14 06:18:10,789 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:18:10" (1/1) ... [2022-07-14 06:18:10,790 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:18:10" (1/1) ... [2022-07-14 06:18:10,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:18:10" (1/1) ... [2022-07-14 06:18:10,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:18:10" (1/1) ... [2022-07-14 06:18:10,809 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:18:10" (1/1) ... [2022-07-14 06:18:10,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:18:10,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:18:10,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:18:10,822 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:18:10,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:18:10" (1/1) ... [2022-07-14 06:18:10,833 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:18:10,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:18:10,861 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:18:10,885 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:18:10,899 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2022-07-14 06:18:10,900 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2022-07-14 06:18:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:18:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:18:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:18:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:18:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-14 06:18:10,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:18:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 06:18:10,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-14 06:18:10,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:18:10,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:18:11,051 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:18:11,052 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:18:11,672 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:18:11,677 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:18:11,677 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-07-14 06:18:11,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:18:11 BoogieIcfgContainer [2022-07-14 06:18:11,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:18:11,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:18:11,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:18:11,682 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:18:11,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:18:10" (1/3) ... [2022-07-14 06:18:11,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a4e5e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:18:11, skipping insertion in model container [2022-07-14 06:18:11,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:18:10" (2/3) ... [2022-07-14 06:18:11,684 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a4e5e9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:18:11, skipping insertion in model container [2022-07-14 06:18:11,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:18:11" (3/3) ... [2022-07-14 06:18:11,685 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0217.i [2022-07-14 06:18:11,695 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:18:11,695 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2022-07-14 06:18:11,728 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:18:11,732 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@2b35e9ca, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@36f3e13b [2022-07-14 06:18:11,733 INFO L358 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2022-07-14 06:18:11,736 INFO L276 IsEmpty]: Start isEmpty. Operand has 165 states, 94 states have (on average 1.9893617021276595) internal successors, (187), 161 states have internal predecessors, (187), 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:18:11,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 06:18:11,743 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:11,744 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 06:18:11,744 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:11,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:11,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1045058442, now seen corresponding path program 1 times [2022-07-14 06:18:11,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:11,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816268215] [2022-07-14 06:18:11,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:11,759 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:11,759 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:11,761 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:11,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-14 06:18:11,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:11,871 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-14 06:18:11,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:11,886 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:18:11,886 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:11,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:11,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816268215] [2022-07-14 06:18:11,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816268215] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:11,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:11,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:18:11,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846199427] [2022-07-14 06:18:11,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:11,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-14 06:18:11,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:11,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-14 06:18:11,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-14 06:18:11,948 INFO L87 Difference]: Start difference. First operand has 165 states, 94 states have (on average 1.9893617021276595) internal successors, (187), 161 states have internal predecessors, (187), 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:18:11,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:11,965 INFO L93 Difference]: Finished difference Result 165 states and 185 transitions. [2022-07-14 06:18:11,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-14 06:18:11,967 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:18:11,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:11,975 INFO L225 Difference]: With dead ends: 165 [2022-07-14 06:18:11,975 INFO L226 Difference]: Without dead ends: 163 [2022-07-14 06:18:11,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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:18:11,979 INFO L413 NwaCegarLoop]: 185 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, 185 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:18:11,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:18:11,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-14 06:18:12,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2022-07-14 06:18:12,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 93 states have (on average 1.924731182795699) internal successors, (179), 159 states have internal predecessors, (179), 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:18:12,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 183 transitions. [2022-07-14 06:18:12,013 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 183 transitions. Word has length 6 [2022-07-14 06:18:12,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:12,014 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 183 transitions. [2022-07-14 06:18:12,014 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:18:12,014 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 183 transitions. [2022-07-14 06:18:12,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 06:18:12,015 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:12,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 06:18:12,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:12,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:12,225 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:12,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:12,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1037789438, now seen corresponding path program 1 times [2022-07-14 06:18:12,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:12,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458540786] [2022-07-14 06:18:12,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:12,227 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:12,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:12,228 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:12,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-14 06:18:12,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:12,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 06:18:12,276 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:12,328 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:18:12,328 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:12,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:12,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458540786] [2022-07-14 06:18:12,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458540786] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:12,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:12,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-07-14 06:18:12,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814193781] [2022-07-14 06:18:12,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:12,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:18:12,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:12,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:18:12,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:18:12,333 INFO L87 Difference]: Start difference. First operand 163 states and 183 transitions. Second operand has 3 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:18:12,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:12,782 INFO L93 Difference]: Finished difference Result 317 states and 356 transitions. [2022-07-14 06:18:12,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:18:12,784 INFO L78 Accepts]: Start accepts. Automaton has has 3 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:18:12,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:12,786 INFO L225 Difference]: With dead ends: 317 [2022-07-14 06:18:12,787 INFO L226 Difference]: Without dead ends: 317 [2022-07-14 06:18:12,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:18:12,788 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 165 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:12,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 235 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:18:12,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-07-14 06:18:12,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 221. [2022-07-14 06:18:12,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 148 states have (on average 1.9189189189189189) internal successors, (284), 214 states have internal predecessors, (284), 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:18:12,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 292 transitions. [2022-07-14 06:18:12,822 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 292 transitions. Word has length 6 [2022-07-14 06:18:12,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:12,822 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 292 transitions. [2022-07-14 06:18:12,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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:18:12,823 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 292 transitions. [2022-07-14 06:18:12,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 06:18:12,823 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:12,823 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 06:18:12,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:13,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:13,024 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:13,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:13,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1037789439, now seen corresponding path program 1 times [2022-07-14 06:18:13,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:13,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2118343539] [2022-07-14 06:18:13,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:13,026 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:13,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:13,027 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:13,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-14 06:18:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:13,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:18:13,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:13,165 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:18:13,165 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:13,166 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:13,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2118343539] [2022-07-14 06:18:13,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2118343539] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:13,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:13,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:18:13,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913278489] [2022-07-14 06:18:13,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:13,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:18:13,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:13,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:18:13,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:18:13,172 INFO L87 Difference]: Start difference. First operand 221 states and 292 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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:18:13,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:13,572 INFO L93 Difference]: Finished difference Result 356 states and 452 transitions. [2022-07-14 06:18:13,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:18:13,573 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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:18:13,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:13,576 INFO L225 Difference]: With dead ends: 356 [2022-07-14 06:18:13,576 INFO L226 Difference]: Without dead ends: 356 [2022-07-14 06:18:13,576 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:18:13,577 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 138 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:13,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 355 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:18:13,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-07-14 06:18:13,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 290. [2022-07-14 06:18:13,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 211 states have (on average 1.8909952606635072) internal successors, (399), 279 states have internal predecessors, (399), 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:18:13,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 415 transitions. [2022-07-14 06:18:13,597 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 415 transitions. Word has length 6 [2022-07-14 06:18:13,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:13,597 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 415 transitions. [2022-07-14 06:18:13,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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:18:13,598 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 415 transitions. [2022-07-14 06:18:13,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-14 06:18:13,598 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:13,598 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-14 06:18:13,608 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-14 06:18:13,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:13,806 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:13,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:13,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1037789501, now seen corresponding path program 1 times [2022-07-14 06:18:13,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:13,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1379644474] [2022-07-14 06:18:13,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:13,808 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:13,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:13,809 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:13,811 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-14 06:18:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:13,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:18:13,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:13,889 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:18:13,890 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:13,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:13,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1379644474] [2022-07-14 06:18:13,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1379644474] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:13,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:13,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:18:13,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016594995] [2022-07-14 06:18:13,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:13,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:18:13,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:13,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:18:13,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:18:13,892 INFO L87 Difference]: Start difference. First operand 290 states and 415 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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:18:14,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:14,313 INFO L93 Difference]: Finished difference Result 355 states and 450 transitions. [2022-07-14 06:18:14,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:18:14,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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:18:14,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:14,315 INFO L225 Difference]: With dead ends: 355 [2022-07-14 06:18:14,315 INFO L226 Difference]: Without dead ends: 355 [2022-07-14 06:18:14,316 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:18:14,316 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 120 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:14,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 415 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:18:14,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2022-07-14 06:18:14,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 290. [2022-07-14 06:18:14,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 211 states have (on average 1.8909952606635072) internal successors, (399), 279 states have internal predecessors, (399), 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:18:14,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 415 transitions. [2022-07-14 06:18:14,331 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 415 transitions. Word has length 6 [2022-07-14 06:18:14,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:14,332 INFO L495 AbstractCegarLoop]: Abstraction has 290 states and 415 transitions. [2022-07-14 06:18:14,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 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:18:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 415 transitions. [2022-07-14 06:18:14,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-14 06:18:14,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:14,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:18:14,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:14,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:14,540 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:14,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:14,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1610789459, now seen corresponding path program 1 times [2022-07-14 06:18:14,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:14,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [778531575] [2022-07-14 06:18:14,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:14,541 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:14,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:14,542 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:14,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-14 06:18:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:14,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 06:18:14,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:14,694 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:14,703 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:18:14,720 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:14,722 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:14,723 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 17 treesize of output 10 [2022-07-14 06:18:14,754 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:18:14,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:14,755 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:14,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [778531575] [2022-07-14 06:18:14,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [778531575] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:14,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:14,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:18:14,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497920650] [2022-07-14 06:18:14,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:14,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:18:14,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:14,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:18:14,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:18:14,759 INFO L87 Difference]: Start difference. First operand 290 states and 415 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:18:15,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:15,179 INFO L93 Difference]: Finished difference Result 433 states and 589 transitions. [2022-07-14 06:18:15,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:18:15,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-14 06:18:15,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:15,184 INFO L225 Difference]: With dead ends: 433 [2022-07-14 06:18:15,184 INFO L226 Difference]: Without dead ends: 433 [2022-07-14 06:18:15,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:18:15,185 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 139 mSDsluCounter, 606 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:15,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 768 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:18:15,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-07-14 06:18:15,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 328. [2022-07-14 06:18:15,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 246 states have (on average 1.8780487804878048) internal successors, (462), 315 states have internal predecessors, (462), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-14 06:18:15,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 482 transitions. [2022-07-14 06:18:15,201 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 482 transitions. Word has length 9 [2022-07-14 06:18:15,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:15,201 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 482 transitions. [2022-07-14 06:18:15,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:18:15,201 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 482 transitions. [2022-07-14 06:18:15,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-14 06:18:15,202 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:15,202 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:18:15,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:15,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:15,411 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:15,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:15,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1612636501, now seen corresponding path program 1 times [2022-07-14 06:18:15,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:15,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [343756539] [2022-07-14 06:18:15,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:15,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:15,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:15,414 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:15,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-14 06:18:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:15,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 06:18:15,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:15,526 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:15,527 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:18:15,530 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:15,532 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:15,532 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 17 treesize of output 10 [2022-07-14 06:18:15,556 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:18:15,556 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:15,556 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:15,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [343756539] [2022-07-14 06:18:15,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [343756539] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:15,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:15,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:18:15,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842207843] [2022-07-14 06:18:15,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:15,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:18:15,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:15,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:18:15,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:18:15,558 INFO L87 Difference]: Start difference. First operand 328 states and 482 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:18:15,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:15,981 INFO L93 Difference]: Finished difference Result 423 states and 578 transitions. [2022-07-14 06:18:15,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:18:15,983 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-14 06:18:15,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:15,984 INFO L225 Difference]: With dead ends: 423 [2022-07-14 06:18:15,984 INFO L226 Difference]: Without dead ends: 423 [2022-07-14 06:18:15,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:18:15,985 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 125 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:15,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 727 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:18:15,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2022-07-14 06:18:15,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 327. [2022-07-14 06:18:15,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 245 states have (on average 1.8816326530612244) internal successors, (461), 314 states have internal predecessors, (461), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-14 06:18:15,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 481 transitions. [2022-07-14 06:18:15,995 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 481 transitions. Word has length 9 [2022-07-14 06:18:15,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:15,995 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 481 transitions. [2022-07-14 06:18:15,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:18:15,995 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 481 transitions. [2022-07-14 06:18:15,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 06:18:15,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:15,996 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:18:16,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:16,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:16,200 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:16,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:16,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1059285971, now seen corresponding path program 1 times [2022-07-14 06:18:16,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:16,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729178817] [2022-07-14 06:18:16,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:16,201 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:16,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:16,202 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:16,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-14 06:18:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:16,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 06:18:16,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:16,321 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:18:16,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:16,321 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:16,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729178817] [2022-07-14 06:18:16,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729178817] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:16,322 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:16,322 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:18:16,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771482401] [2022-07-14 06:18:16,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:16,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:18:16,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:16,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:18:16,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:18:16,323 INFO L87 Difference]: Start difference. First operand 327 states and 481 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:18:16,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:16,754 INFO L93 Difference]: Finished difference Result 386 states and 510 transitions. [2022-07-14 06:18:16,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:18:16,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 11 [2022-07-14 06:18:16,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:16,757 INFO L225 Difference]: With dead ends: 386 [2022-07-14 06:18:16,758 INFO L226 Difference]: Without dead ends: 386 [2022-07-14 06:18:16,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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:18:16,758 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 190 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:16,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 409 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:18:16,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-07-14 06:18:16,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 327. [2022-07-14 06:18:16,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 245 states have (on average 1.8489795918367347) internal successors, (453), 314 states have internal predecessors, (453), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-14 06:18:16,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 473 transitions. [2022-07-14 06:18:16,776 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 473 transitions. Word has length 11 [2022-07-14 06:18:16,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:16,776 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 473 transitions. [2022-07-14 06:18:16,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:18:16,777 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 473 transitions. [2022-07-14 06:18:16,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 06:18:16,777 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:16,777 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:18:16,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:16,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:16,984 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:16,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:16,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1059285970, now seen corresponding path program 1 times [2022-07-14 06:18:16,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:16,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1647331627] [2022-07-14 06:18:16,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:16,985 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:16,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:16,987 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:16,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-14 06:18:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:17,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 06:18:17,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:17,079 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:18:17,080 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:17,080 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:17,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1647331627] [2022-07-14 06:18:17,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1647331627] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:17,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:17,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:18:17,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081133082] [2022-07-14 06:18:17,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:17,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:18:17,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:17,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:18:17,082 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:18:17,082 INFO L87 Difference]: Start difference. First operand 327 states and 473 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:18:17,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:17,607 INFO L93 Difference]: Finished difference Result 548 states and 704 transitions. [2022-07-14 06:18:17,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:18:17,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 11 [2022-07-14 06:18:17,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:17,609 INFO L225 Difference]: With dead ends: 548 [2022-07-14 06:18:17,609 INFO L226 Difference]: Without dead ends: 548 [2022-07-14 06:18:17,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 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:18:17,610 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 316 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:17,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 425 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:18:17,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2022-07-14 06:18:17,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 333. [2022-07-14 06:18:17,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 251 states have (on average 1.8247011952191234) internal successors, (458), 320 states have internal predecessors, (458), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-14 06:18:17,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 478 transitions. [2022-07-14 06:18:17,624 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 478 transitions. Word has length 11 [2022-07-14 06:18:17,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:17,624 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 478 transitions. [2022-07-14 06:18:17,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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:18:17,624 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 478 transitions. [2022-07-14 06:18:17,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 06:18:17,625 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:17,625 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:18:17,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:17,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:17,826 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:17,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:17,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1605135578, now seen corresponding path program 1 times [2022-07-14 06:18:17,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:17,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1273974820] [2022-07-14 06:18:17,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:17,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:17,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:17,828 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:17,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-14 06:18:17,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:17,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 06:18:17,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:17,883 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:18:17,883 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:17,883 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:17,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1273974820] [2022-07-14 06:18:17,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1273974820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:17,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:17,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:18:17,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471790285] [2022-07-14 06:18:17,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:17,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:18:17,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:17,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:18:17,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:18:17,886 INFO L87 Difference]: Start difference. First operand 333 states and 478 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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:18:18,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:18,096 INFO L93 Difference]: Finished difference Result 379 states and 525 transitions. [2022-07-14 06:18:18,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:18:18,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-07-14 06:18:18,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:18,098 INFO L225 Difference]: With dead ends: 379 [2022-07-14 06:18:18,098 INFO L226 Difference]: Without dead ends: 372 [2022-07-14 06:18:18,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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:18:18,103 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 62 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:18,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 276 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:18:18,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2022-07-14 06:18:18,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 330. [2022-07-14 06:18:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 248 states have (on average 1.8266129032258065) internal successors, (453), 317 states have internal predecessors, (453), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-14 06:18:18,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 473 transitions. [2022-07-14 06:18:18,113 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 473 transitions. Word has length 10 [2022-07-14 06:18:18,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:18,113 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 473 transitions. [2022-07-14 06:18:18,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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:18:18,113 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 473 transitions. [2022-07-14 06:18:18,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 06:18:18,116 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:18,116 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:18:18,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:18,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:18,327 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:18,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:18,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1821218137, now seen corresponding path program 1 times [2022-07-14 06:18:18,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:18,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474428136] [2022-07-14 06:18:18,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:18,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:18,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:18,329 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:18,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-14 06:18:18,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:18,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 06:18:18,386 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:18,435 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 06:18:18,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-14 06:18:18,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:18:18,468 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:18,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:18,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474428136] [2022-07-14 06:18:18,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [474428136] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:18,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:18,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:18:18,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113579060] [2022-07-14 06:18:18,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:18,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:18:18,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:18,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:18:18,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:18:18,470 INFO L87 Difference]: Start difference. First operand 330 states and 473 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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:18:19,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:19,051 INFO L93 Difference]: Finished difference Result 578 states and 729 transitions. [2022-07-14 06:18:19,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:18:19,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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:18:19,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:19,053 INFO L225 Difference]: With dead ends: 578 [2022-07-14 06:18:19,053 INFO L226 Difference]: Without dead ends: 578 [2022-07-14 06:18:19,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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:18:19,054 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 393 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:19,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 420 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:18:19,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2022-07-14 06:18:19,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 351. [2022-07-14 06:18:19,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 269 states have (on average 1.8401486988847584) internal successors, (495), 338 states have internal predecessors, (495), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-14 06:18:19,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 515 transitions. [2022-07-14 06:18:19,065 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 515 transitions. Word has length 14 [2022-07-14 06:18:19,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:19,065 INFO L495 AbstractCegarLoop]: Abstraction has 351 states and 515 transitions. [2022-07-14 06:18:19,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 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:18:19,066 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 515 transitions. [2022-07-14 06:18:19,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 06:18:19,067 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:19,067 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:18:19,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:19,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:19,275 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:19,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:19,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1821218138, now seen corresponding path program 1 times [2022-07-14 06:18:19,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:19,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1645244503] [2022-07-14 06:18:19,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:19,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:19,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:19,277 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:19,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-14 06:18:19,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:19,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-14 06:18:19,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:19,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:18:19,450 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:18:19,485 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:18:19,485 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:19,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:19,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1645244503] [2022-07-14 06:18:19,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1645244503] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:19,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:19,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:18:19,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120516472] [2022-07-14 06:18:19,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:19,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:18:19,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:19,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:18:19,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:18:19,487 INFO L87 Difference]: Start difference. First operand 351 states and 515 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:18:20,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:20,855 INFO L93 Difference]: Finished difference Result 758 states and 954 transitions. [2022-07-14 06:18:20,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:18:20,856 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:18:20,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:20,858 INFO L225 Difference]: With dead ends: 758 [2022-07-14 06:18:20,859 INFO L226 Difference]: Without dead ends: 758 [2022-07-14 06:18:20,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:18:20,859 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 560 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 682 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 564 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:20,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [564 Valid, 685 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 682 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-14 06:18:20,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2022-07-14 06:18:20,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 382. [2022-07-14 06:18:20,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 298 states have (on average 1.8187919463087248) internal successors, (542), 368 states have internal predecessors, (542), 10 states have call successors, (10), 5 states have call predecessors, (10), 7 states have return successors, (14), 8 states have call predecessors, (14), 10 states have call successors, (14) [2022-07-14 06:18:20,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 566 transitions. [2022-07-14 06:18:20,869 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 566 transitions. Word has length 14 [2022-07-14 06:18:20,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:20,869 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 566 transitions. [2022-07-14 06:18:20,870 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:18:20,870 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 566 transitions. [2022-07-14 06:18:20,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 06:18:20,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:20,872 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:18:20,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:21,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:21,081 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:21,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:21,082 INFO L85 PathProgramCache]: Analyzing trace with hash 13763675, now seen corresponding path program 1 times [2022-07-14 06:18:21,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:21,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202211908] [2022-07-14 06:18:21,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:21,083 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:21,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:21,092 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:21,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-14 06:18:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:21,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 06:18:21,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:21,169 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:18:21,170 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:21,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:21,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202211908] [2022-07-14 06:18:21,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202211908] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:21,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:21,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:18:21,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980804493] [2022-07-14 06:18:21,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:21,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:18:21,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:21,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:18:21,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:18:21,172 INFO L87 Difference]: Start difference. First operand 382 states and 566 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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:18:21,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:21,237 INFO L93 Difference]: Finished difference Result 606 states and 864 transitions. [2022-07-14 06:18:21,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:18:21,238 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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:18:21,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:21,242 INFO L225 Difference]: With dead ends: 606 [2022-07-14 06:18:21,243 INFO L226 Difference]: Without dead ends: 606 [2022-07-14 06:18:21,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:18:21,243 INFO L413 NwaCegarLoop]: 360 mSDtfsCounter, 242 mSDsluCounter, 1173 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 1533 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:21,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 1533 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:18:21,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-07-14 06:18:21,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 392. [2022-07-14 06:18:21,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 305 states have (on average 1.79672131147541) internal successors, (548), 377 states have internal predecessors, (548), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:18:21,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 578 transitions. [2022-07-14 06:18:21,276 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 578 transitions. Word has length 14 [2022-07-14 06:18:21,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:21,276 INFO L495 AbstractCegarLoop]: Abstraction has 392 states and 578 transitions. [2022-07-14 06:18:21,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 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:18:21,277 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 578 transitions. [2022-07-14 06:18:21,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 06:18:21,277 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:21,277 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:18:21,298 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:21,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:21,487 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:21,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:21,487 INFO L85 PathProgramCache]: Analyzing trace with hash 426729499, now seen corresponding path program 1 times [2022-07-14 06:18:21,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:21,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17792466] [2022-07-14 06:18:21,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:21,488 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:21,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:21,490 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:21,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-14 06:18:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:21,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-14 06:18:21,543 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:21,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:18:21,668 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:18:21,716 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:18:21,717 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:21,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:21,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17792466] [2022-07-14 06:18:21,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17792466] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:21,717 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:21,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:18:21,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559053229] [2022-07-14 06:18:21,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:21,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:18:21,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:21,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:18:21,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:18:21,719 INFO L87 Difference]: Start difference. First operand 392 states and 578 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:18:23,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:23,138 INFO L93 Difference]: Finished difference Result 769 states and 964 transitions. [2022-07-14 06:18:23,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:18:23,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2022-07-14 06:18:23,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:23,146 INFO L225 Difference]: With dead ends: 769 [2022-07-14 06:18:23,147 INFO L226 Difference]: Without dead ends: 769 [2022-07-14 06:18:23,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:18:23,148 INFO L413 NwaCegarLoop]: 212 mSDtfsCounter, 532 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 783 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 783 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:23,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 768 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 783 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-14 06:18:23,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2022-07-14 06:18:23,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 369. [2022-07-14 06:18:23,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 282 states have (on average 1.7836879432624113) internal successors, (503), 354 states have internal predecessors, (503), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:18:23,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 533 transitions. [2022-07-14 06:18:23,161 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 533 transitions. Word has length 15 [2022-07-14 06:18:23,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:23,161 INFO L495 AbstractCegarLoop]: Abstraction has 369 states and 533 transitions. [2022-07-14 06:18:23,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 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:18:23,161 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 533 transitions. [2022-07-14 06:18:23,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:18:23,162 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:23,162 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:18:23,171 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:23,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:23,379 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:23,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:23,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1617808426, now seen corresponding path program 1 times [2022-07-14 06:18:23,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:23,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997118963] [2022-07-14 06:18:23,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:23,380 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:23,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:23,381 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:23,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-14 06:18:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:23,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-14 06:18:23,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:23,693 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:23,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2022-07-14 06:18:23,699 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:23,701 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:23,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 24 treesize of output 13 [2022-07-14 06:18:23,743 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:18:23,743 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:23,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:23,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997118963] [2022-07-14 06:18:23,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997118963] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:23,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:23,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:18:23,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523746831] [2022-07-14 06:18:23,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:23,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:18:23,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:23,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:18:23,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:18:23,745 INFO L87 Difference]: Start difference. First operand 369 states and 533 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:18:24,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:24,931 INFO L93 Difference]: Finished difference Result 702 states and 979 transitions. [2022-07-14 06:18:24,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:18:24,933 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:18:24,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:24,936 INFO L225 Difference]: With dead ends: 702 [2022-07-14 06:18:24,936 INFO L226 Difference]: Without dead ends: 702 [2022-07-14 06:18:24,936 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:18:24,937 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 407 mSDsluCounter, 1230 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 1467 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:24,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 1467 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-14 06:18:24,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 702 states. [2022-07-14 06:18:24,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 702 to 363. [2022-07-14 06:18:24,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 276 states have (on average 1.7826086956521738) internal successors, (492), 348 states have internal predecessors, (492), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 9 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:18:24,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 522 transitions. [2022-07-14 06:18:24,952 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 522 transitions. Word has length 17 [2022-07-14 06:18:24,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:24,953 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 522 transitions. [2022-07-14 06:18:24,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 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:18:24,953 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 522 transitions. [2022-07-14 06:18:24,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 06:18:24,954 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:24,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:18:24,966 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:25,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:25,164 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:25,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:25,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1767075169, now seen corresponding path program 1 times [2022-07-14 06:18:25,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:25,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1017258019] [2022-07-14 06:18:25,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:25,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:25,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:25,166 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:25,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-14 06:18:25,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:25,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-14 06:18:25,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:25,343 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:25,344 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:18:25,348 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:25,350 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:25,350 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 17 treesize of output 10 [2022-07-14 06:18:25,368 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:18:25,368 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:25,368 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:25,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1017258019] [2022-07-14 06:18:25,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1017258019] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:25,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:25,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:18:25,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111546955] [2022-07-14 06:18:25,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:25,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:18:25,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:25,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:18:25,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:18:25,369 INFO L87 Difference]: Start difference. First operand 363 states and 522 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 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:18:25,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:25,862 INFO L93 Difference]: Finished difference Result 495 states and 671 transitions. [2022-07-14 06:18:25,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:18:25,863 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 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 18 [2022-07-14 06:18:25,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:25,864 INFO L225 Difference]: With dead ends: 495 [2022-07-14 06:18:25,864 INFO L226 Difference]: Without dead ends: 495 [2022-07-14 06:18:25,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:18:25,867 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 157 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:25,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 942 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:18:25,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2022-07-14 06:18:25,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 384. [2022-07-14 06:18:25,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 297 states have (on average 1.7474747474747474) internal successors, (519), 367 states have internal predecessors, (519), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:18:25,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 549 transitions. [2022-07-14 06:18:25,876 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 549 transitions. Word has length 18 [2022-07-14 06:18:25,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:25,876 INFO L495 AbstractCegarLoop]: Abstraction has 384 states and 549 transitions. [2022-07-14 06:18:25,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 6 states have internal predecessors, (16), 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:18:25,877 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 549 transitions. [2022-07-14 06:18:25,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 06:18:25,878 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:25,878 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:18:25,893 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:26,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:26,087 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:26,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:26,088 INFO L85 PathProgramCache]: Analyzing trace with hash 71904833, now seen corresponding path program 1 times [2022-07-14 06:18:26,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:26,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1239081898] [2022-07-14 06:18:26,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:26,088 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:26,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:26,090 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:26,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-14 06:18:26,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:26,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:18:26,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:26,193 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:18:26,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:26,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:26,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1239081898] [2022-07-14 06:18:26,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1239081898] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:26,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:26,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:18:26,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471581886] [2022-07-14 06:18:26,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:26,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:18:26,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:26,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:18:26,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:18:26,195 INFO L87 Difference]: Start difference. First operand 384 states and 549 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:18:26,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:26,663 INFO L93 Difference]: Finished difference Result 623 states and 814 transitions. [2022-07-14 06:18:26,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:18:26,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2022-07-14 06:18:26,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:26,665 INFO L225 Difference]: With dead ends: 623 [2022-07-14 06:18:26,665 INFO L226 Difference]: Without dead ends: 623 [2022-07-14 06:18:26,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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:18:26,666 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 298 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:26,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 449 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:18:26,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2022-07-14 06:18:26,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 412. [2022-07-14 06:18:26,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 325 states have (on average 1.756923076923077) internal successors, (571), 395 states have internal predecessors, (571), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:18:26,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 601 transitions. [2022-07-14 06:18:26,674 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 601 transitions. Word has length 19 [2022-07-14 06:18:26,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:26,675 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 601 transitions. [2022-07-14 06:18:26,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:18:26,675 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 601 transitions. [2022-07-14 06:18:26,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 06:18:26,675 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:26,675 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:18:26,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-07-14 06:18:26,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:26,882 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:26,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:26,883 INFO L85 PathProgramCache]: Analyzing trace with hash 71904834, now seen corresponding path program 1 times [2022-07-14 06:18:26,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:26,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2107197061] [2022-07-14 06:18:26,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:26,883 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:26,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:26,884 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:26,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-14 06:18:26,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:26,928 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 06:18:26,929 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:27,024 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:18:27,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:27,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:27,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2107197061] [2022-07-14 06:18:27,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2107197061] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:27,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:27,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:18:27,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544927927] [2022-07-14 06:18:27,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:27,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:18:27,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:27,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:18:27,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:18:27,027 INFO L87 Difference]: Start difference. First operand 412 states and 601 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:18:27,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:27,421 INFO L93 Difference]: Finished difference Result 462 states and 624 transitions. [2022-07-14 06:18:27,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:18:27,422 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2022-07-14 06:18:27,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:27,424 INFO L225 Difference]: With dead ends: 462 [2022-07-14 06:18:27,424 INFO L226 Difference]: Without dead ends: 462 [2022-07-14 06:18:27,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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:18:27,425 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 176 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:27,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 407 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:18:27,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2022-07-14 06:18:27,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 412. [2022-07-14 06:18:27,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 325 states have (on average 1.7292307692307691) internal successors, (562), 395 states have internal predecessors, (562), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:18:27,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 592 transitions. [2022-07-14 06:18:27,436 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 592 transitions. Word has length 19 [2022-07-14 06:18:27,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:27,437 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 592 transitions. [2022-07-14 06:18:27,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:18:27,437 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 592 transitions. [2022-07-14 06:18:27,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 06:18:27,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:27,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:18:27,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:27,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:27,646 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:27,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:27,646 INFO L85 PathProgramCache]: Analyzing trace with hash 339285216, now seen corresponding path program 1 times [2022-07-14 06:18:27,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:27,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003906406] [2022-07-14 06:18:27,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:27,647 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:27,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:27,648 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:27,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-14 06:18:27,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:27,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-14 06:18:27,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:27,845 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:27,846 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:18:27,849 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:27,851 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:27,851 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 17 treesize of output 10 [2022-07-14 06:18:27,870 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:18:27,871 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:27,871 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:27,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003906406] [2022-07-14 06:18:27,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003906406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:27,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:27,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:18:27,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576561850] [2022-07-14 06:18:27,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:27,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:18:27,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:27,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:18:27,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:18:27,873 INFO L87 Difference]: Start difference. First operand 412 states and 592 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 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:18:28,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:28,427 INFO L93 Difference]: Finished difference Result 490 states and 664 transitions. [2022-07-14 06:18:28,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:18:28,428 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 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 19 [2022-07-14 06:18:28,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:28,429 INFO L225 Difference]: With dead ends: 490 [2022-07-14 06:18:28,429 INFO L226 Difference]: Without dead ends: 490 [2022-07-14 06:18:28,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:18:28,430 INFO L413 NwaCegarLoop]: 183 mSDtfsCounter, 121 mSDsluCounter, 881 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:28,430 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1064 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:18:28,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-07-14 06:18:28,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 420. [2022-07-14 06:18:28,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 333 states have (on average 1.7117117117117118) internal successors, (570), 401 states have internal predecessors, (570), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:18:28,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 600 transitions. [2022-07-14 06:18:28,438 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 600 transitions. Word has length 19 [2022-07-14 06:18:28,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:28,440 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 600 transitions. [2022-07-14 06:18:28,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 6 states have internal predecessors, (17), 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:18:28,440 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 600 transitions. [2022-07-14 06:18:28,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 06:18:28,440 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:28,441 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:18:28,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:28,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:28,648 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:28,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:28,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1638466352, now seen corresponding path program 1 times [2022-07-14 06:18:28,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:28,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1498181209] [2022-07-14 06:18:28,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:28,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:28,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:28,650 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:28,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-14 06:18:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:28,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 06:18:28,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:28,714 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:18:28,730 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:18:28,730 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:28,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:28,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1498181209] [2022-07-14 06:18:28,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1498181209] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:28,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:28,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:18:28,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488550576] [2022-07-14 06:18:28,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:28,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:18:28,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:28,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:18:28,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:18:28,733 INFO L87 Difference]: Start difference. First operand 420 states and 600 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:18:28,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:28,940 INFO L93 Difference]: Finished difference Result 504 states and 691 transitions. [2022-07-14 06:18:28,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:18:28,941 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:18:28,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:28,942 INFO L225 Difference]: With dead ends: 504 [2022-07-14 06:18:28,942 INFO L226 Difference]: Without dead ends: 504 [2022-07-14 06:18:28,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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:18:28,943 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 149 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:28,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 278 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:18:28,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-07-14 06:18:28,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 417. [2022-07-14 06:18:28,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 333 states have (on average 1.6846846846846846) internal successors, (561), 398 states have internal predecessors, (561), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:18:28,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 591 transitions. [2022-07-14 06:18:28,949 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 591 transitions. Word has length 20 [2022-07-14 06:18:28,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:28,949 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 591 transitions. [2022-07-14 06:18:28,949 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:18:28,949 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 591 transitions. [2022-07-14 06:18:28,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 06:18:28,949 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:28,949 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:18:28,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Ended with exit code 0 [2022-07-14 06:18:29,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:29,151 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:29,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:29,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1638466351, now seen corresponding path program 1 times [2022-07-14 06:18:29,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:29,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1453420911] [2022-07-14 06:18:29,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:29,152 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:29,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:29,154 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:29,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-14 06:18:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:29,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:18:29,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:29,213 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:18:29,269 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:18:29,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:29,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:29,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1453420911] [2022-07-14 06:18:29,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1453420911] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:29,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:29,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:18:29,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446150779] [2022-07-14 06:18:29,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:29,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:18:29,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:29,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:18:29,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:18:29,273 INFO L87 Difference]: Start difference. First operand 417 states and 591 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:18:29,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:29,741 INFO L93 Difference]: Finished difference Result 708 states and 947 transitions. [2022-07-14 06:18:29,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:18:29,742 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:18:29,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:29,744 INFO L225 Difference]: With dead ends: 708 [2022-07-14 06:18:29,744 INFO L226 Difference]: Without dead ends: 708 [2022-07-14 06:18:29,744 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 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:18:29,745 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 484 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 413 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.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:29,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 413 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:18:29,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2022-07-14 06:18:29,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 464. [2022-07-14 06:18:29,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 381 states have (on average 1.669291338582677) internal successors, (636), 445 states have internal predecessors, (636), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:18:29,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 666 transitions. [2022-07-14 06:18:29,752 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 666 transitions. Word has length 20 [2022-07-14 06:18:29,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:29,753 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 666 transitions. [2022-07-14 06:18:29,753 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:18:29,753 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 666 transitions. [2022-07-14 06:18:29,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:18:29,753 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:29,753 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:18:29,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-07-14 06:18:29,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:29,972 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:29,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:29,972 INFO L85 PathProgramCache]: Analyzing trace with hash 154801395, now seen corresponding path program 1 times [2022-07-14 06:18:29,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:29,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [394013608] [2022-07-14 06:18:29,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:29,973 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:29,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:29,974 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:29,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-14 06:18:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:30,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 06:18:30,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:30,064 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:18:30,065 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:30,065 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:30,065 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [394013608] [2022-07-14 06:18:30,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [394013608] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:30,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:30,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:18:30,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846417489] [2022-07-14 06:18:30,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:30,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:18:30,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:30,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:18:30,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:18:30,067 INFO L87 Difference]: Start difference. First operand 464 states and 666 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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:18:30,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:30,108 INFO L93 Difference]: Finished difference Result 671 states and 930 transitions. [2022-07-14 06:18:30,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:18:30,109 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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:18:30,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:30,111 INFO L225 Difference]: With dead ends: 671 [2022-07-14 06:18:30,111 INFO L226 Difference]: Without dead ends: 671 [2022-07-14 06:18:30,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:18:30,111 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 231 mSDsluCounter, 982 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:30,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1254 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:18:30,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2022-07-14 06:18:30,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 464. [2022-07-14 06:18:30,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 381 states have (on average 1.6587926509186353) internal successors, (632), 445 states have internal predecessors, (632), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:18:30,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 662 transitions. [2022-07-14 06:18:30,119 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 662 transitions. Word has length 21 [2022-07-14 06:18:30,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:30,120 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 662 transitions. [2022-07-14 06:18:30,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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:18:30,120 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 662 transitions. [2022-07-14 06:18:30,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:18:30,120 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:30,121 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:18:30,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-07-14 06:18:30,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:30,327 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:30,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:30,328 INFO L85 PathProgramCache]: Analyzing trace with hash -355732782, now seen corresponding path program 1 times [2022-07-14 06:18:30,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:30,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803431171] [2022-07-14 06:18:30,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:30,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:30,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:30,329 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:30,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-14 06:18:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:30,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:18:30,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:30,393 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:18:30,448 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:18:30,449 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:30,449 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:30,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803431171] [2022-07-14 06:18:30,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803431171] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:30,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:30,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:18:30,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218049088] [2022-07-14 06:18:30,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:30,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:18:30,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:30,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:18:30,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:18:30,451 INFO L87 Difference]: Start difference. First operand 464 states and 662 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:18:31,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:31,007 INFO L93 Difference]: Finished difference Result 756 states and 1021 transitions. [2022-07-14 06:18:31,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:18:31,009 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:18:31,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:31,011 INFO L225 Difference]: With dead ends: 756 [2022-07-14 06:18:31,011 INFO L226 Difference]: Without dead ends: 756 [2022-07-14 06:18:31,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 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:18:31,012 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 321 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:31,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 606 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:18:31,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2022-07-14 06:18:31,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 464. [2022-07-14 06:18:31,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 381 states have (on average 1.6587926509186353) internal successors, (632), 445 states have internal predecessors, (632), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:18:31,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 662 transitions. [2022-07-14 06:18:31,020 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 662 transitions. Word has length 21 [2022-07-14 06:18:31,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:31,020 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 662 transitions. [2022-07-14 06:18:31,020 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:18:31,021 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 662 transitions. [2022-07-14 06:18:31,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:18:31,021 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:31,021 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:18:31,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:31,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:31,231 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:31,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:31,231 INFO L85 PathProgramCache]: Analyzing trace with hash 324325588, now seen corresponding path program 1 times [2022-07-14 06:18:31,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:31,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947432201] [2022-07-14 06:18:31,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:31,232 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:31,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:31,233 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:31,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-14 06:18:31,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:31,292 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 06:18:31,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:31,317 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:18:31,318 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:31,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:31,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947432201] [2022-07-14 06:18:31,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947432201] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:31,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:31,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:18:31,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100949642] [2022-07-14 06:18:31,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:31,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:18:31,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:31,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:18:31,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:18:31,320 INFO L87 Difference]: Start difference. First operand 464 states and 662 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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:18:31,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:31,365 INFO L93 Difference]: Finished difference Result 666 states and 919 transitions. [2022-07-14 06:18:31,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:18:31,366 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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:18:31,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:31,368 INFO L225 Difference]: With dead ends: 666 [2022-07-14 06:18:31,368 INFO L226 Difference]: Without dead ends: 666 [2022-07-14 06:18:31,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:18:31,373 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 232 mSDsluCounter, 1139 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:31,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1487 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:18:31,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-07-14 06:18:31,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 415. [2022-07-14 06:18:31,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 333 states have (on average 1.6426426426426426) internal successors, (547), 396 states have internal predecessors, (547), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:18:31,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 577 transitions. [2022-07-14 06:18:31,382 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 577 transitions. Word has length 21 [2022-07-14 06:18:31,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:31,383 INFO L495 AbstractCegarLoop]: Abstraction has 415 states and 577 transitions. [2022-07-14 06:18:31,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 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:18:31,384 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 577 transitions. [2022-07-14 06:18:31,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:18:31,384 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:31,384 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] [2022-07-14 06:18:31,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:31,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:31,592 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:31,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:31,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1686835249, now seen corresponding path program 1 times [2022-07-14 06:18:31,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:31,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965579063] [2022-07-14 06:18:31,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:31,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:31,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:31,594 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:31,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-14 06:18:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:31,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 06:18:31,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:31,713 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 15 treesize of output 7 [2022-07-14 06:18:31,716 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 15 treesize of output 7 [2022-07-14 06:18:31,743 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:18:31,744 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:31,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:31,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965579063] [2022-07-14 06:18:31,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965579063] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:31,744 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:31,744 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:18:31,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597913543] [2022-07-14 06:18:31,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:31,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:18:31,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:31,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:18:31,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:18:31,746 INFO L87 Difference]: Start difference. First operand 415 states and 577 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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:18:32,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:32,275 INFO L93 Difference]: Finished difference Result 610 states and 833 transitions. [2022-07-14 06:18:32,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:18:32,275 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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 22 [2022-07-14 06:18:32,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:32,277 INFO L225 Difference]: With dead ends: 610 [2022-07-14 06:18:32,277 INFO L226 Difference]: Without dead ends: 610 [2022-07-14 06:18:32,277 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:18:32,277 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 152 mSDsluCounter, 1048 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:32,278 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 1306 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:18:32,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-07-14 06:18:32,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 442. [2022-07-14 06:18:32,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 360 states have (on average 1.613888888888889) internal successors, (581), 423 states have internal predecessors, (581), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:18:32,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 611 transitions. [2022-07-14 06:18:32,283 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 611 transitions. Word has length 22 [2022-07-14 06:18:32,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:32,284 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 611 transitions. [2022-07-14 06:18:32,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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:18:32,284 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 611 transitions. [2022-07-14 06:18:32,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:18:32,284 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:32,285 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] [2022-07-14 06:18:32,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-07-14 06:18:32,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:32,493 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:32,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:32,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1686835443, now seen corresponding path program 1 times [2022-07-14 06:18:32,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:32,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954727965] [2022-07-14 06:18:32,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:32,493 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:32,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:32,496 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:32,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-14 06:18:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:32,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:18:32,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:32,565 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:18:32,627 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:18:32,627 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:32,627 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:32,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954727965] [2022-07-14 06:18:32,628 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954727965] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:32,628 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:32,628 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:18:32,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754169287] [2022-07-14 06:18:32,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:32,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:18:32,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:32,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:18:32,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:18:32,629 INFO L87 Difference]: Start difference. First operand 442 states and 611 transitions. Second operand has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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:18:33,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:33,107 INFO L93 Difference]: Finished difference Result 760 states and 998 transitions. [2022-07-14 06:18:33,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:18:33,108 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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 22 [2022-07-14 06:18:33,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:33,109 INFO L225 Difference]: With dead ends: 760 [2022-07-14 06:18:33,110 INFO L226 Difference]: Without dead ends: 760 [2022-07-14 06:18:33,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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:18:33,110 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 326 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:33,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 495 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:18:33,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2022-07-14 06:18:33,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 517. [2022-07-14 06:18:33,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 435 states have (on average 1.606896551724138) internal successors, (699), 498 states have internal predecessors, (699), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:18:33,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 729 transitions. [2022-07-14 06:18:33,118 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 729 transitions. Word has length 22 [2022-07-14 06:18:33,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:33,118 INFO L495 AbstractCegarLoop]: Abstraction has 517 states and 729 transitions. [2022-07-14 06:18:33,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.666666666666667) internal successors, (20), 4 states have internal predecessors, (20), 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:18:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 729 transitions. [2022-07-14 06:18:33,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 06:18:33,119 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:33,119 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:18:33,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:33,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:33,332 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:33,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:33,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1138813192, now seen corresponding path program 1 times [2022-07-14 06:18:33,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:33,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060613090] [2022-07-14 06:18:33,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:33,333 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:33,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:33,334 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:33,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-14 06:18:33,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:33,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 06:18:33,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:33,468 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:33,470 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:18:33,473 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:33,475 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:33,475 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 17 treesize of output 10 [2022-07-14 06:18:33,509 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:18:33,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:33,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:33,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060613090] [2022-07-14 06:18:33,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060613090] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:33,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:33,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:18:33,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266392569] [2022-07-14 06:18:33,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:33,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:18:33,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:33,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:18:33,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:18:33,511 INFO L87 Difference]: Start difference. First operand 517 states and 729 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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:18:34,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:34,058 INFO L93 Difference]: Finished difference Result 615 states and 814 transitions. [2022-07-14 06:18:34,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:18:34,060 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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:18:34,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:34,061 INFO L225 Difference]: With dead ends: 615 [2022-07-14 06:18:34,061 INFO L226 Difference]: Without dead ends: 615 [2022-07-14 06:18:34,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:18:34,062 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 283 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:34,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 1565 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:18:34,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-07-14 06:18:34,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 400. [2022-07-14 06:18:34,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 326 states have (on average 1.6012269938650308) internal successors, (522), 387 states have internal predecessors, (522), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-14 06:18:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 540 transitions. [2022-07-14 06:18:34,068 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 540 transitions. Word has length 23 [2022-07-14 06:18:34,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:34,069 INFO L495 AbstractCegarLoop]: Abstraction has 400 states and 540 transitions. [2022-07-14 06:18:34,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 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:18:34,069 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 540 transitions. [2022-07-14 06:18:34,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 06:18:34,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:34,069 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:18:34,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:34,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:34,279 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:34,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:34,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1738181300, now seen corresponding path program 1 times [2022-07-14 06:18:34,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:34,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696259623] [2022-07-14 06:18:34,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:34,279 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:34,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:34,280 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:34,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-14 06:18:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:34,334 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:18:34,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:34,340 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:18:34,409 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:18:34,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:34,409 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:34,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696259623] [2022-07-14 06:18:34,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696259623] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:34,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:34,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:18:34,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691469854] [2022-07-14 06:18:34,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:34,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:18:34,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:34,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:18:34,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:18:34,411 INFO L87 Difference]: Start difference. First operand 400 states and 540 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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:18:34,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:34,834 INFO L93 Difference]: Finished difference Result 601 states and 786 transitions. [2022-07-14 06:18:34,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:18:34,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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:18:34,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:34,836 INFO L225 Difference]: With dead ends: 601 [2022-07-14 06:18:34,836 INFO L226 Difference]: Without dead ends: 601 [2022-07-14 06:18:34,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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:18:34,837 INFO L413 NwaCegarLoop]: 255 mSDtfsCounter, 315 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:34,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 386 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:18:34,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2022-07-14 06:18:34,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 328. [2022-07-14 06:18:34,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 255 states have (on average 1.584313725490196) internal successors, (404), 315 states have internal predecessors, (404), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-14 06:18:34,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 422 transitions. [2022-07-14 06:18:34,842 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 422 transitions. Word has length 23 [2022-07-14 06:18:34,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:34,842 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 422 transitions. [2022-07-14 06:18:34,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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:18:34,842 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 422 transitions. [2022-07-14 06:18:34,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 06:18:34,842 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:34,843 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:18:34,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:35,049 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:35,049 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:35,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:35,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1349887713, now seen corresponding path program 1 times [2022-07-14 06:18:35,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:35,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [724420720] [2022-07-14 06:18:35,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:35,050 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:35,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:35,051 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:35,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-14 06:18:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:35,127 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 06:18:35,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:35,133 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:18:35,169 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:18:35,169 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:35,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:35,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [724420720] [2022-07-14 06:18:35,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [724420720] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:35,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:35,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:18:35,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286213987] [2022-07-14 06:18:35,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:35,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:18:35,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:35,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:18:35,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:18:35,171 INFO L87 Difference]: Start difference. First operand 328 states and 422 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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:18:35,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:35,577 INFO L93 Difference]: Finished difference Result 414 states and 520 transitions. [2022-07-14 06:18:35,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:18:35,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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:18:35,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:35,579 INFO L225 Difference]: With dead ends: 414 [2022-07-14 06:18:35,579 INFO L226 Difference]: Without dead ends: 414 [2022-07-14 06:18:35,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:18:35,579 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 460 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 460 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:35,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [460 Valid, 506 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:18:35,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-07-14 06:18:35,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 327. [2022-07-14 06:18:35,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 255 states have (on average 1.576470588235294) internal successors, (402), 314 states have internal predecessors, (402), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-14 06:18:35,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 420 transitions. [2022-07-14 06:18:35,585 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 420 transitions. Word has length 30 [2022-07-14 06:18:35,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:35,586 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 420 transitions. [2022-07-14 06:18:35,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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:18:35,586 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 420 transitions. [2022-07-14 06:18:35,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 06:18:35,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:35,586 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:18:35,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:35,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:35,794 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:35,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:35,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1349887712, now seen corresponding path program 1 times [2022-07-14 06:18:35,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:35,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953255315] [2022-07-14 06:18:35,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:35,795 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:35,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:35,796 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:35,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-14 06:18:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:35,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-14 06:18:35,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:35,875 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:18:35,958 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:18:35,958 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:35,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:35,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1953255315] [2022-07-14 06:18:35,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1953255315] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:35,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:35,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:18:35,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483245615] [2022-07-14 06:18:35,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:35,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:18:35,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:35,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:18:35,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:18:35,959 INFO L87 Difference]: Start difference. First operand 327 states and 420 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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:18:36,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:36,282 INFO L93 Difference]: Finished difference Result 326 states and 418 transitions. [2022-07-14 06:18:36,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:18:36,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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:18:36,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:36,283 INFO L225 Difference]: With dead ends: 326 [2022-07-14 06:18:36,283 INFO L226 Difference]: Without dead ends: 326 [2022-07-14 06:18:36,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 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:18:36,284 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 500 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:36,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 300 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:18:36,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2022-07-14 06:18:36,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 326. [2022-07-14 06:18:36,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 255 states have (on average 1.5686274509803921) internal successors, (400), 313 states have internal predecessors, (400), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-14 06:18:36,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 418 transitions. [2022-07-14 06:18:36,291 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 418 transitions. Word has length 30 [2022-07-14 06:18:36,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:36,291 INFO L495 AbstractCegarLoop]: Abstraction has 326 states and 418 transitions. [2022-07-14 06:18:36,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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:18:36,291 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 418 transitions. [2022-07-14 06:18:36,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 06:18:36,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:36,291 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:18:36,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Ended with exit code 0 [2022-07-14 06:18:36,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:36,500 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:36,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:36,500 INFO L85 PathProgramCache]: Analyzing trace with hash -161965599, now seen corresponding path program 1 times [2022-07-14 06:18:36,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:36,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148404574] [2022-07-14 06:18:36,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:36,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:36,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:36,502 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:36,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-14 06:18:36,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:36,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:18:36,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:36,609 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:18:36,609 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:36,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:36,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148404574] [2022-07-14 06:18:36,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148404574] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:36,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:36,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:18:36,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031619546] [2022-07-14 06:18:36,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:36,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:18:36,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:36,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:18:36,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:18:36,610 INFO L87 Difference]: Start difference. First operand 326 states and 418 transitions. Second operand has 4 states, 3 states have (on average 10.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:18:36,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:36,995 INFO L93 Difference]: Finished difference Result 693 states and 861 transitions. [2022-07-14 06:18:36,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:18:36,995 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.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:18:36,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:36,997 INFO L225 Difference]: With dead ends: 693 [2022-07-14 06:18:36,997 INFO L226 Difference]: Without dead ends: 693 [2022-07-14 06:18:36,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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:18:36,998 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 474 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 478 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:36,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [478 Valid, 364 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:18:36,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2022-07-14 06:18:37,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 354. [2022-07-14 06:18:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 286 states have (on average 1.5454545454545454) internal successors, (442), 341 states have internal predecessors, (442), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-14 06:18:37,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 460 transitions. [2022-07-14 06:18:37,004 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 460 transitions. Word has length 32 [2022-07-14 06:18:37,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:37,005 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 460 transitions. [2022-07-14 06:18:37,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.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:18:37,005 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 460 transitions. [2022-07-14 06:18:37,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 06:18:37,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:37,005 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:18:37,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Ended with exit code 0 [2022-07-14 06:18:37,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:37,213 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:37,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:37,213 INFO L85 PathProgramCache]: Analyzing trace with hash -161965598, now seen corresponding path program 1 times [2022-07-14 06:18:37,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:37,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1715575521] [2022-07-14 06:18:37,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:37,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:37,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:37,215 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:37,216 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-14 06:18:37,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:37,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-14 06:18:37,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:37,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:18:37,381 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:18:37,467 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:18:37,468 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:37,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:37,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1715575521] [2022-07-14 06:18:37,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1715575521] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:37,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:37,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:18:37,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177527295] [2022-07-14 06:18:37,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:37,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:18:37,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:37,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:18:37,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:18:37,469 INFO L87 Difference]: Start difference. First operand 354 states and 460 transitions. Second operand has 4 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:18:38,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:38,045 INFO L93 Difference]: Finished difference Result 504 states and 591 transitions. [2022-07-14 06:18:38,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:18:38,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 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 32 [2022-07-14 06:18:38,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:38,047 INFO L225 Difference]: With dead ends: 504 [2022-07-14 06:18:38,047 INFO L226 Difference]: Without dead ends: 504 [2022-07-14 06:18:38,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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:18:38,047 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 355 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:38,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 320 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-14 06:18:38,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2022-07-14 06:18:38,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 354. [2022-07-14 06:18:38,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 286 states have (on average 1.534965034965035) internal successors, (439), 341 states have internal predecessors, (439), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-14 06:18:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 457 transitions. [2022-07-14 06:18:38,068 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 457 transitions. Word has length 32 [2022-07-14 06:18:38,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:38,068 INFO L495 AbstractCegarLoop]: Abstraction has 354 states and 457 transitions. [2022-07-14 06:18:38,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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:18:38,068 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 457 transitions. [2022-07-14 06:18:38,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-14 06:18:38,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:38,069 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, 1, 1, 1, 1, 1, 1] [2022-07-14 06:18:38,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Ended with exit code 0 [2022-07-14 06:18:38,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:38,277 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:38,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:38,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1353630368, now seen corresponding path program 1 times [2022-07-14 06:18:38,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:38,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [265797827] [2022-07-14 06:18:38,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:38,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:38,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:38,279 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:38,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-14 06:18:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:38,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 06:18:38,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:38,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:18:38,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:38,549 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:38,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [265797827] [2022-07-14 06:18:38,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [265797827] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:38,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:38,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:18:38,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102150507] [2022-07-14 06:18:38,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:38,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:18:38,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:38,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:18:38,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:18:38,550 INFO L87 Difference]: Start difference. First operand 354 states and 457 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:18:38,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:38,923 INFO L93 Difference]: Finished difference Result 369 states and 472 transitions. [2022-07-14 06:18:38,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:18:38,924 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 40 [2022-07-14 06:18:38,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:38,925 INFO L225 Difference]: With dead ends: 369 [2022-07-14 06:18:38,925 INFO L226 Difference]: Without dead ends: 369 [2022-07-14 06:18:38,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:18:38,925 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 505 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:38,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 269 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:18:38,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2022-07-14 06:18:38,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 353. [2022-07-14 06:18:38,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 288 states have (on average 1.5243055555555556) internal successors, (439), 340 states have internal predecessors, (439), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-14 06:18:38,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 457 transitions. [2022-07-14 06:18:38,930 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 457 transitions. Word has length 40 [2022-07-14 06:18:38,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:38,930 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 457 transitions. [2022-07-14 06:18:38,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:18:38,930 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 457 transitions. [2022-07-14 06:18:38,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-14 06:18:38,931 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:38,931 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, 1, 1, 1, 1, 1, 1] [2022-07-14 06:18:38,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:39,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:39,139 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:39,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:39,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1353630430, now seen corresponding path program 1 times [2022-07-14 06:18:39,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:39,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194117952] [2022-07-14 06:18:39,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:39,140 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:39,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:39,151 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:39,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-07-14 06:18:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:39,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 06:18:39,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:18:39,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:39,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:39,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194117952] [2022-07-14 06:18:39,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194117952] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:39,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:39,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:18:39,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934316739] [2022-07-14 06:18:39,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:39,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:18:39,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:39,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:18:39,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:18:39,447 INFO L87 Difference]: Start difference. First operand 353 states and 457 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:18:39,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:39,834 INFO L93 Difference]: Finished difference Result 368 states and 470 transitions. [2022-07-14 06:18:39,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:18:39,835 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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 40 [2022-07-14 06:18:39,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:39,836 INFO L225 Difference]: With dead ends: 368 [2022-07-14 06:18:39,836 INFO L226 Difference]: Without dead ends: 368 [2022-07-14 06:18:39,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:18:39,837 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 468 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:39,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 282 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:18:39,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-07-14 06:18:39,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 350. [2022-07-14 06:18:39,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 286 states have (on average 1.5174825174825175) internal successors, (434), 337 states have internal predecessors, (434), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-14 06:18:39,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 452 transitions. [2022-07-14 06:18:39,842 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 452 transitions. Word has length 40 [2022-07-14 06:18:39,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:39,842 INFO L495 AbstractCegarLoop]: Abstraction has 350 states and 452 transitions. [2022-07-14 06:18:39,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 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:18:39,843 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 452 transitions. [2022-07-14 06:18:39,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-14 06:18:39,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:39,843 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:18:39,859 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:40,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:40,055 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:40,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:40,055 INFO L85 PathProgramCache]: Analyzing trace with hash 590754408, now seen corresponding path program 1 times [2022-07-14 06:18:40,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:40,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318514591] [2022-07-14 06:18:40,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:40,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:40,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:40,056 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:40,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-07-14 06:18:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:40,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-14 06:18:40,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:18:40,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:18:40,609 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:18:40,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2022-07-14 06:18:40,859 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:18:40,859 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:40,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [318514591] [2022-07-14 06:18:40,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [318514591] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:18:40,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:18:40,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 13 [2022-07-14 06:18:40,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124850960] [2022-07-14 06:18:40,860 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:18:40,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 06:18:40,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:40,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 06:18:40,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:18:40,861 INFO L87 Difference]: Start difference. First operand 350 states and 452 transitions. Second operand has 14 states, 13 states have (on average 5.846153846153846) internal successors, (76), 12 states have internal predecessors, (76), 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:18:43,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:43,060 INFO L93 Difference]: Finished difference Result 1145 states and 1421 transitions. [2022-07-14 06:18:43,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 06:18:43,060 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.846153846153846) internal successors, (76), 12 states have internal predecessors, (76), 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 42 [2022-07-14 06:18:43,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:43,063 INFO L225 Difference]: With dead ends: 1145 [2022-07-14 06:18:43,063 INFO L226 Difference]: Without dead ends: 1145 [2022-07-14 06:18:43,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=287, Invalid=769, Unknown=0, NotChecked=0, Total=1056 [2022-07-14 06:18:43,064 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 2397 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2399 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:43,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2399 Valid, 962 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-14 06:18:43,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2022-07-14 06:18:43,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 380. [2022-07-14 06:18:43,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 318 states have (on average 1.4874213836477987) internal successors, (473), 367 states have internal predecessors, (473), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (12), 9 states have call predecessors, (12), 6 states have call successors, (12) [2022-07-14 06:18:43,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 491 transitions. [2022-07-14 06:18:43,070 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 491 transitions. Word has length 42 [2022-07-14 06:18:43,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:43,070 INFO L495 AbstractCegarLoop]: Abstraction has 380 states and 491 transitions. [2022-07-14 06:18:43,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.846153846153846) internal successors, (76), 12 states have internal predecessors, (76), 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:18:43,070 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 491 transitions. [2022-07-14 06:18:43,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 06:18:43,071 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:43,071 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:18:43,079 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:43,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:43,276 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:43,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:43,276 INFO L85 PathProgramCache]: Analyzing trace with hash 554559762, now seen corresponding path program 1 times [2022-07-14 06:18:43,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:43,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836561715] [2022-07-14 06:18:43,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:43,276 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:43,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:43,277 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:43,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2022-07-14 06:18:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:43,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-14 06:18:43,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:43,392 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:18:43,510 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:18:43,558 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 9 [2022-07-14 06:18:43,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:18:43,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:43,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:43,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1836561715] [2022-07-14 06:18:43,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1836561715] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:43,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:43,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:18:43,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937143137] [2022-07-14 06:18:43,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:43,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:18:43,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:43,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:18:43,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:18:43,585 INFO L87 Difference]: Start difference. First operand 380 states and 491 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 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:18:44,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:44,899 INFO L93 Difference]: Finished difference Result 971 states and 1250 transitions. [2022-07-14 06:18:44,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 06:18:44,900 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 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 43 [2022-07-14 06:18:44,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:44,902 INFO L225 Difference]: With dead ends: 971 [2022-07-14 06:18:44,902 INFO L226 Difference]: Without dead ends: 971 [2022-07-14 06:18:44,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2022-07-14 06:18:44,903 INFO L413 NwaCegarLoop]: 141 mSDtfsCounter, 711 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 752 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:44,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 1141 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 752 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-14 06:18:44,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2022-07-14 06:18:44,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 477. [2022-07-14 06:18:44,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 408 states have (on average 1.463235294117647) internal successors, (597), 460 states have internal predecessors, (597), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 11 states have call predecessors, (20), 10 states have call successors, (20) [2022-07-14 06:18:44,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 627 transitions. [2022-07-14 06:18:44,909 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 627 transitions. Word has length 43 [2022-07-14 06:18:44,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:44,909 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 627 transitions. [2022-07-14 06:18:44,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 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:18:44,909 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 627 transitions. [2022-07-14 06:18:44,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 06:18:44,910 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:44,910 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18:44,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (36)] Ended with exit code 0 [2022-07-14 06:18:45,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:45,114 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:45,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:45,114 INFO L85 PathProgramCache]: Analyzing trace with hash 554559763, now seen corresponding path program 1 times [2022-07-14 06:18:45,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:45,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [266031992] [2022-07-14 06:18:45,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:45,115 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:45,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:45,116 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:45,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-07-14 06:18:45,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:45,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-14 06:18:45,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:45,223 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:18:45,374 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:18:45,379 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:18:45,469 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 9 [2022-07-14 06:18:45,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-07-14 06:18:45,511 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:18:45,511 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:45,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:45,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [266031992] [2022-07-14 06:18:45,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [266031992] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:45,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:45,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:18:45,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404185460] [2022-07-14 06:18:45,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:45,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:18:45,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:45,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:18:45,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:18:45,512 INFO L87 Difference]: Start difference. First operand 477 states and 627 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 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:18:46,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:46,998 INFO L93 Difference]: Finished difference Result 1021 states and 1316 transitions. [2022-07-14 06:18:46,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 06:18:46,999 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 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 43 [2022-07-14 06:18:46,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:47,001 INFO L225 Difference]: With dead ends: 1021 [2022-07-14 06:18:47,001 INFO L226 Difference]: Without dead ends: 1021 [2022-07-14 06:18:47,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-07-14 06:18:47,002 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 763 mSDsluCounter, 1019 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:47,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 1158 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-14 06:18:47,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1021 states. [2022-07-14 06:18:47,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1021 to 526. [2022-07-14 06:18:47,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 453 states have (on average 1.4878587196467992) internal successors, (674), 507 states have internal predecessors, (674), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2022-07-14 06:18:47,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 710 transitions. [2022-07-14 06:18:47,012 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 710 transitions. Word has length 43 [2022-07-14 06:18:47,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:47,012 INFO L495 AbstractCegarLoop]: Abstraction has 526 states and 710 transitions. [2022-07-14 06:18:47,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 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:18:47,012 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 710 transitions. [2022-07-14 06:18:47,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-07-14 06:18:47,013 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:47,013 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:18:47,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Ended with exit code 0 [2022-07-14 06:18:47,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:47,220 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:47,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:47,220 INFO L85 PathProgramCache]: Analyzing trace with hash 556406804, now seen corresponding path program 1 times [2022-07-14 06:18:47,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:47,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1021219506] [2022-07-14 06:18:47,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:47,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:47,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:47,222 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:47,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2022-07-14 06:18:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:47,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-14 06:18:47,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:47,423 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:18:47,423 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:18:47,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-14 06:18:47,546 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-14 06:18:47,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:18:47,587 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 25 treesize of output 24 [2022-07-14 06:18:47,593 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:18:47,593 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 25 treesize of output 24 [2022-07-14 06:18:47,632 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 16 treesize of output 18 [2022-07-14 06:18:47,639 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 16 treesize of output 18 [2022-07-14 06:18:47,707 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-14 06:18:47,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-14 06:18:47,726 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:18:47,726 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:47,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:47,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1021219506] [2022-07-14 06:18:47,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1021219506] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:47,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:47,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-14 06:18:47,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638005493] [2022-07-14 06:18:47,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:47,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 06:18:47,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:47,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 06:18:47,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:18:47,727 INFO L87 Difference]: Start difference. First operand 526 states and 710 transitions. Second operand has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 12 states have internal predecessors, (41), 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:18:49,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:49,366 INFO L93 Difference]: Finished difference Result 1042 states and 1287 transitions. [2022-07-14 06:18:49,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 06:18:49,367 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 12 states have internal predecessors, (41), 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 43 [2022-07-14 06:18:49,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:49,369 INFO L225 Difference]: With dead ends: 1042 [2022-07-14 06:18:49,369 INFO L226 Difference]: Without dead ends: 1042 [2022-07-14 06:18:49,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2022-07-14 06:18:49,370 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 911 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 917 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:49,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [917 Valid, 1612 Invalid, 937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-14 06:18:49,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2022-07-14 06:18:49,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 531. [2022-07-14 06:18:49,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 458 states have (on average 1.482532751091703) internal successors, (679), 512 states have internal predecessors, (679), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2022-07-14 06:18:49,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 715 transitions. [2022-07-14 06:18:49,378 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 715 transitions. Word has length 43 [2022-07-14 06:18:49,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:49,378 INFO L495 AbstractCegarLoop]: Abstraction has 531 states and 715 transitions. [2022-07-14 06:18:49,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.9285714285714284) internal successors, (41), 12 states have internal predecessors, (41), 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:18:49,378 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 715 transitions. [2022-07-14 06:18:49,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 06:18:49,379 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:49,379 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:18:49,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (38)] Ended with exit code 0 [2022-07-14 06:18:49,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:49,587 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:49,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:49,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1110599341, now seen corresponding path program 1 times [2022-07-14 06:18:49,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:49,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134855338] [2022-07-14 06:18:49,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:49,588 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:49,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:49,589 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:49,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Waiting until timeout for monitored process [2022-07-14 06:18:49,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:49,690 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-14 06:18:49,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:49,706 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:18:49,851 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:18:49,889 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 9 [2022-07-14 06:18:49,923 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:18:49,923 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:49,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:49,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134855338] [2022-07-14 06:18:49,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1134855338] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:49,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:49,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 06:18:49,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111235768] [2022-07-14 06:18:49,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:49,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:18:49,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:49,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:18:49,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:18:49,925 INFO L87 Difference]: Start difference. First operand 531 states and 715 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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:18:51,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:51,299 INFO L93 Difference]: Finished difference Result 1039 states and 1377 transitions. [2022-07-14 06:18:51,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-14 06:18:51,300 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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 44 [2022-07-14 06:18:51,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:51,303 INFO L225 Difference]: With dead ends: 1039 [2022-07-14 06:18:51,303 INFO L226 Difference]: Without dead ends: 1039 [2022-07-14 06:18:51,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=625, Unknown=0, NotChecked=0, Total=812 [2022-07-14 06:18:51,304 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 1094 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 816 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1094 SdHoareTripleChecker+Valid, 1210 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 816 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:51,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1094 Valid, 1210 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 816 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-14 06:18:51,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1039 states. [2022-07-14 06:18:51,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1039 to 588. [2022-07-14 06:18:51,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 507 states have (on average 1.4812623274161736) internal successors, (751), 565 states have internal predecessors, (751), 16 states have call successors, (16), 8 states have call predecessors, (16), 16 states have return successors, (32), 14 states have call predecessors, (32), 16 states have call successors, (32) [2022-07-14 06:18:51,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 799 transitions. [2022-07-14 06:18:51,313 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 799 transitions. Word has length 44 [2022-07-14 06:18:51,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:51,314 INFO L495 AbstractCegarLoop]: Abstraction has 588 states and 799 transitions. [2022-07-14 06:18:51,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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:18:51,314 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 799 transitions. [2022-07-14 06:18:51,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 06:18:51,315 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:51,315 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:18:51,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (39)] Ended with exit code 0 [2022-07-14 06:18:51,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:51,519 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:51,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:51,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1110599342, now seen corresponding path program 1 times [2022-07-14 06:18:51,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:51,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2099641722] [2022-07-14 06:18:51,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:51,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:51,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:51,521 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:51,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Waiting until timeout for monitored process [2022-07-14 06:18:51,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:51,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-14 06:18:51,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:51,653 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:18:51,863 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:18:51,867 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:18:51,938 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 9 [2022-07-14 06:18:51,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-07-14 06:18:51,984 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:18:51,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:51,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:51,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2099641722] [2022-07-14 06:18:51,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2099641722] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:51,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:51,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 06:18:51,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271100212] [2022-07-14 06:18:51,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:51,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:18:51,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:51,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:18:51,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:18:51,986 INFO L87 Difference]: Start difference. First operand 588 states and 799 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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:18:53,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:53,540 INFO L93 Difference]: Finished difference Result 988 states and 1316 transitions. [2022-07-14 06:18:53,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 06:18:53,541 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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 44 [2022-07-14 06:18:53,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:53,544 INFO L225 Difference]: With dead ends: 988 [2022-07-14 06:18:53,544 INFO L226 Difference]: Without dead ends: 988 [2022-07-14 06:18:53,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=161, Invalid=541, Unknown=0, NotChecked=0, Total=702 [2022-07-14 06:18:53,544 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 1204 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:53,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 1062 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-14 06:18:53,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states. [2022-07-14 06:18:53,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 537. [2022-07-14 06:18:53,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 464 states have (on average 1.480603448275862) internal successors, (687), 518 states have internal predecessors, (687), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2022-07-14 06:18:53,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 723 transitions. [2022-07-14 06:18:53,552 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 723 transitions. Word has length 44 [2022-07-14 06:18:53,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:53,553 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 723 transitions. [2022-07-14 06:18:53,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 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:18:53,553 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 723 transitions. [2022-07-14 06:18:53,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 06:18:53,554 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:53,554 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:18:53,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (40)] Ended with exit code 0 [2022-07-14 06:18:53,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:53,764 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:53,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:53,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1112446383, now seen corresponding path program 1 times [2022-07-14 06:18:53,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:53,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [23245730] [2022-07-14 06:18:53,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:53,765 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:53,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:53,766 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:53,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Waiting until timeout for monitored process [2022-07-14 06:18:53,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:53,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-14 06:18:53,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:54,032 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:18:54,033 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:18:54,206 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:18:54,217 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:18:54,245 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:18:54,252 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:18:54,285 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:18:54,290 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:18:54,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:18:54,343 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 23 treesize of output 22 [2022-07-14 06:18:54,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:18:54,354 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 23 treesize of output 22 [2022-07-14 06:18:54,398 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:18:54,398 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 23 treesize of output 22 [2022-07-14 06:18:54,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:18:54,403 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 23 treesize of output 22 [2022-07-14 06:18:54,419 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:54,419 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:18:54,423 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:54,424 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:18:54,435 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:18:54,436 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:54,436 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:54,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [23245730] [2022-07-14 06:18:54,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [23245730] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:54,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:54,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:18:54,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558333845] [2022-07-14 06:18:54,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:54,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:18:54,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:54,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:18:54,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:18:54,438 INFO L87 Difference]: Start difference. First operand 537 states and 723 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 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:18:54,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:54,970 INFO L93 Difference]: Finished difference Result 560 states and 746 transitions. [2022-07-14 06:18:54,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:18:54,971 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 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 44 [2022-07-14 06:18:54,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:54,972 INFO L225 Difference]: With dead ends: 560 [2022-07-14 06:18:54,972 INFO L226 Difference]: Without dead ends: 560 [2022-07-14 06:18:54,973 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:18:54,973 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 114 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:54,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 598 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:18:54,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-07-14 06:18:54,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 555. [2022-07-14 06:18:54,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 482 states have (on average 1.462655601659751) internal successors, (705), 536 states have internal predecessors, (705), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2022-07-14 06:18:54,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 741 transitions. [2022-07-14 06:18:54,978 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 741 transitions. Word has length 44 [2022-07-14 06:18:54,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:54,979 INFO L495 AbstractCegarLoop]: Abstraction has 555 states and 741 transitions. [2022-07-14 06:18:54,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 7 states have internal predecessors, (42), 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:18:54,979 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 741 transitions. [2022-07-14 06:18:54,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-14 06:18:54,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:54,979 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:18:54,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (41)] Forceful destruction successful, exit code 0 [2022-07-14 06:18:55,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:55,180 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:55,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:55,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1922711055, now seen corresponding path program 1 times [2022-07-14 06:18:55,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:55,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [199838778] [2022-07-14 06:18:55,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:55,181 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:55,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:55,182 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:55,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Waiting until timeout for monitored process [2022-07-14 06:18:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:55,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-14 06:18:55,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:55,421 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:18:55,421 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:18:55,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:55,678 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-07-14 06:18:55,699 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:18:55,701 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 24 [2022-07-14 06:18:55,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:18:55,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 38 [2022-07-14 06:18:55,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:18:55,763 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2022-07-14 06:18:55,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:18:55,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2022-07-14 06:18:55,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:18:55,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2022-07-14 06:18:55,892 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 31 treesize of output 29 [2022-07-14 06:18:55,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2022-07-14 06:18:55,900 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 25 treesize of output 25 [2022-07-14 06:18:55,903 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-07-14 06:18:55,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-14 06:18:55,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-14 06:18:56,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:18:56,013 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:56,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:56,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [199838778] [2022-07-14 06:18:56,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [199838778] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:56,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:56,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-14 06:18:56,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505531063] [2022-07-14 06:18:56,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:56,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-14 06:18:56,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:56,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 06:18:56,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:18:56,015 INFO L87 Difference]: Start difference. First operand 555 states and 741 transitions. Second operand has 16 states, 16 states have (on average 2.625) internal successors, (42), 14 states have internal predecessors, (42), 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:18:57,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:57,650 INFO L93 Difference]: Finished difference Result 571 states and 757 transitions. [2022-07-14 06:18:57,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 06:18:57,651 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 14 states have internal predecessors, (42), 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 44 [2022-07-14 06:18:57,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:57,652 INFO L225 Difference]: With dead ends: 571 [2022-07-14 06:18:57,652 INFO L226 Difference]: Without dead ends: 571 [2022-07-14 06:18:57,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2022-07-14 06:18:57,653 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 82 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:57,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1568 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-14 06:18:57,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2022-07-14 06:18:57,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 555. [2022-07-14 06:18:57,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 555 states, 482 states have (on average 1.462655601659751) internal successors, (705), 536 states have internal predecessors, (705), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 12 states have call predecessors, (24), 12 states have call successors, (24) [2022-07-14 06:18:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 741 transitions. [2022-07-14 06:18:57,658 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 741 transitions. Word has length 44 [2022-07-14 06:18:57,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:57,658 INFO L495 AbstractCegarLoop]: Abstraction has 555 states and 741 transitions. [2022-07-14 06:18:57,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.625) internal successors, (42), 14 states have internal predecessors, (42), 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:18:57,659 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 741 transitions. [2022-07-14 06:18:57,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 06:18:57,659 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:57,659 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:18:57,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (42)] Ended with exit code 0 [2022-07-14 06:18:57,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:57,864 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:57,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:57,865 INFO L85 PathProgramCache]: Analyzing trace with hash 419844716, now seen corresponding path program 1 times [2022-07-14 06:18:57,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:57,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621326827] [2022-07-14 06:18:57,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:57,865 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:57,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:57,866 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:57,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Waiting until timeout for monitored process [2022-07-14 06:18:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:57,977 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-14 06:18:57,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:57,985 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:18:58,135 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:18:58,174 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 9 [2022-07-14 06:18:58,196 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:18:58,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:18:58,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:18:58,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621326827] [2022-07-14 06:18:58,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [621326827] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:18:58,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:18:58,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:18:58,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896273083] [2022-07-14 06:18:58,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:18:58,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:18:58,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:18:58,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:18:58,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:18:58,197 INFO L87 Difference]: Start difference. First operand 555 states and 741 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 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:18:59,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:18:59,324 INFO L93 Difference]: Finished difference Result 977 states and 1304 transitions. [2022-07-14 06:18:59,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 06:18:59,324 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 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:18:59,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:18:59,327 INFO L225 Difference]: With dead ends: 977 [2022-07-14 06:18:59,327 INFO L226 Difference]: Without dead ends: 977 [2022-07-14 06:18:59,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=260, Unknown=0, NotChecked=0, Total=380 [2022-07-14 06:18:59,327 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 835 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 944 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 06:18:59,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 944 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-14 06:18:59,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2022-07-14 06:18:59,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 652. [2022-07-14 06:18:59,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 652 states, 563 states have (on average 1.4653641207815276) internal successors, (825), 625 states have internal predecessors, (825), 20 states have call successors, (20), 10 states have call predecessors, (20), 20 states have return successors, (40), 16 states have call predecessors, (40), 20 states have call successors, (40) [2022-07-14 06:18:59,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 885 transitions. [2022-07-14 06:18:59,336 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 885 transitions. Word has length 45 [2022-07-14 06:18:59,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:18:59,336 INFO L495 AbstractCegarLoop]: Abstraction has 652 states and 885 transitions. [2022-07-14 06:18:59,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 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:18:59,337 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 885 transitions. [2022-07-14 06:18:59,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 06:18:59,337 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:18:59,337 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:18:59,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (43)] Ended with exit code 0 [2022-07-14 06:18:59,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:18:59,545 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:18:59,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:18:59,545 INFO L85 PathProgramCache]: Analyzing trace with hash 419844717, now seen corresponding path program 1 times [2022-07-14 06:18:59,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:18:59,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851106623] [2022-07-14 06:18:59,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:18:59,546 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:18:59,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:18:59,547 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:18:59,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (44)] Waiting until timeout for monitored process [2022-07-14 06:18:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:18:59,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-14 06:18:59,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:18:59,681 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:18:59,894 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:18:59,899 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:18:59,968 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 9 [2022-07-14 06:18:59,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-07-14 06:19:00,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:00,011 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:19:00,011 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:19:00,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [851106623] [2022-07-14 06:19:00,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [851106623] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:00,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:00,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:19:00,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369756404] [2022-07-14 06:19:00,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:00,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:19:00,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:19:00,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:19:00,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:19:00,013 INFO L87 Difference]: Start difference. First operand 652 states and 885 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 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:19:01,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:01,163 INFO L93 Difference]: Finished difference Result 956 states and 1291 transitions. [2022-07-14 06:19:01,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 06:19:01,164 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 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:19:01,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:01,166 INFO L225 Difference]: With dead ends: 956 [2022-07-14 06:19:01,166 INFO L226 Difference]: Without dead ends: 956 [2022-07-14 06:19:01,166 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2022-07-14 06:19:01,167 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 947 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:01,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [947 Valid, 812 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-14 06:19:01,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2022-07-14 06:19:01,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 733. [2022-07-14 06:19:01,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 733 states, 636 states have (on average 1.501572327044025) internal successors, (955), 702 states have internal predecessors, (955), 24 states have call successors, (24), 12 states have call predecessors, (24), 24 states have return successors, (48), 18 states have call predecessors, (48), 24 states have call successors, (48) [2022-07-14 06:19:01,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1027 transitions. [2022-07-14 06:19:01,176 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1027 transitions. Word has length 45 [2022-07-14 06:19:01,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:01,177 INFO L495 AbstractCegarLoop]: Abstraction has 733 states and 1027 transitions. [2022-07-14 06:19:01,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 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:19:01,177 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1027 transitions. [2022-07-14 06:19:01,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 06:19:01,178 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:01,178 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:01,192 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (44)] Forceful destruction successful, exit code 0 [2022-07-14 06:19:01,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:19:01,386 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:19:01,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:01,386 INFO L85 PathProgramCache]: Analyzing trace with hash 840848817, now seen corresponding path program 1 times [2022-07-14 06:19:01,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:19:01,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619433697] [2022-07-14 06:19:01,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:01,387 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:19:01,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:19:01,388 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:19:01,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (45)] Waiting until timeout for monitored process [2022-07-14 06:19:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:01,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-14 06:19:01,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:01,659 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:01,659 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:19:01,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:19:01,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619433697] [2022-07-14 06:19:01,659 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619433697] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:01,659 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:01,659 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:19:01,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417635842] [2022-07-14 06:19:01,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:01,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:19:01,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:19:01,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:19:01,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:19:01,660 INFO L87 Difference]: Start difference. First operand 733 states and 1027 transitions. Second operand has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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:19:02,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:02,057 INFO L93 Difference]: Finished difference Result 972 states and 1326 transitions. [2022-07-14 06:19:02,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:19:02,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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 46 [2022-07-14 06:19:02,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:02,059 INFO L225 Difference]: With dead ends: 972 [2022-07-14 06:19:02,059 INFO L226 Difference]: Without dead ends: 972 [2022-07-14 06:19:02,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:19:02,060 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 436 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:02,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 276 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:19:02,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2022-07-14 06:19:02,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 732. [2022-07-14 06:19:02,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 732 states, 636 states have (on average 1.4842767295597483) internal successors, (944), 701 states have internal predecessors, (944), 24 states have call successors, (24), 12 states have call predecessors, (24), 24 states have return successors, (48), 18 states have call predecessors, (48), 24 states have call successors, (48) [2022-07-14 06:19:02,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 732 states to 732 states and 1016 transitions. [2022-07-14 06:19:02,077 INFO L78 Accepts]: Start accepts. Automaton has 732 states and 1016 transitions. Word has length 46 [2022-07-14 06:19:02,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:02,077 INFO L495 AbstractCegarLoop]: Abstraction has 732 states and 1016 transitions. [2022-07-14 06:19:02,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 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:19:02,077 INFO L276 IsEmpty]: Start isEmpty. Operand 732 states and 1016 transitions. [2022-07-14 06:19:02,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 06:19:02,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:02,078 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:02,087 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (45)] Forceful destruction successful, exit code 0 [2022-07-14 06:19:02,285 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:19:02,286 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:19:02,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:02,286 INFO L85 PathProgramCache]: Analyzing trace with hash 1626462384, now seen corresponding path program 1 times [2022-07-14 06:19:02,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:19:02,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [48514805] [2022-07-14 06:19:02,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:02,287 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:19:02,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:19:02,288 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:19:02,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (46)] Waiting until timeout for monitored process [2022-07-14 06:19:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:02,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-14 06:19:02,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:02,452 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:19:02,686 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:19:02,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:02,733 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:19:02,790 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:19:02,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:02,807 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:19:02,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:19:02,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [48514805] [2022-07-14 06:19:02,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [48514805] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:02,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:02,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 06:19:02,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308319620] [2022-07-14 06:19:02,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:02,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:19:02,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:19:02,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:19:02,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:19:02,808 INFO L87 Difference]: Start difference. First operand 732 states and 1016 transitions. Second operand has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 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:19:04,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:04,868 INFO L93 Difference]: Finished difference Result 1453 states and 1966 transitions. [2022-07-14 06:19:04,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 06:19:04,869 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 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:19:04,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:04,871 INFO L225 Difference]: With dead ends: 1453 [2022-07-14 06:19:04,871 INFO L226 Difference]: Without dead ends: 1453 [2022-07-14 06:19:04,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=499, Unknown=0, NotChecked=0, Total=650 [2022-07-14 06:19:04,872 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 765 mSDsluCounter, 1783 mSDsCounter, 0 mSdLazyCounter, 1455 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 2070 SdHoareTripleChecker+Invalid, 1481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:04,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [765 Valid, 2070 Invalid, 1481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1455 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-14 06:19:04,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2022-07-14 06:19:04,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 862. [2022-07-14 06:19:04,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 750 states have (on average 1.4653333333333334) internal successors, (1099), 823 states have internal predecessors, (1099), 32 states have call successors, (32), 16 states have call predecessors, (32), 32 states have return successors, (64), 22 states have call predecessors, (64), 32 states have call successors, (64) [2022-07-14 06:19:04,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1195 transitions. [2022-07-14 06:19:04,882 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1195 transitions. Word has length 45 [2022-07-14 06:19:04,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:04,882 INFO L495 AbstractCegarLoop]: Abstraction has 862 states and 1195 transitions. [2022-07-14 06:19:04,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 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:19:04,882 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1195 transitions. [2022-07-14 06:19:04,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-14 06:19:04,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:04,883 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:04,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (46)] Ended with exit code 0 [2022-07-14 06:19:05,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:19:05,091 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:19:05,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:05,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1626462385, now seen corresponding path program 1 times [2022-07-14 06:19:05,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:19:05,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183018908] [2022-07-14 06:19:05,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:05,092 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:19:05,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:19:05,112 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:19:05,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (47)] Waiting until timeout for monitored process [2022-07-14 06:19:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:05,250 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-14 06:19:05,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:05,311 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:19:05,593 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:19:05,600 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:19:05,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:05,676 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:19:05,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:05,680 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 27 treesize of output 26 [2022-07-14 06:19:05,763 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:19:05,765 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 19 treesize of output 7 [2022-07-14 06:19:05,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:05,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:19:05,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:19:05,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183018908] [2022-07-14 06:19:05,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [183018908] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:05,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:05,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 06:19:05,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660878262] [2022-07-14 06:19:05,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:05,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:19:05,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:19:05,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:19:05,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:19:05,799 INFO L87 Difference]: Start difference. First operand 862 states and 1195 transitions. Second operand has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 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:19:07,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:07,892 INFO L93 Difference]: Finished difference Result 1606 states and 2208 transitions. [2022-07-14 06:19:07,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 06:19:07,893 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 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:19:07,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:07,895 INFO L225 Difference]: With dead ends: 1606 [2022-07-14 06:19:07,895 INFO L226 Difference]: Without dead ends: 1606 [2022-07-14 06:19:07,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2022-07-14 06:19:07,896 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 935 mSDsluCounter, 1652 mSDsCounter, 0 mSdLazyCounter, 1088 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 935 SdHoareTripleChecker+Valid, 1963 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 1088 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:07,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [935 Valid, 1963 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 1088 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-14 06:19:07,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2022-07-14 06:19:07,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 765. [2022-07-14 06:19:07,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 765 states, 669 states have (on average 1.4693572496263079) internal successors, (983), 734 states have internal predecessors, (983), 24 states have call successors, (24), 12 states have call predecessors, (24), 24 states have return successors, (48), 18 states have call predecessors, (48), 24 states have call successors, (48) [2022-07-14 06:19:07,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1055 transitions. [2022-07-14 06:19:07,906 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1055 transitions. Word has length 45 [2022-07-14 06:19:07,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:07,906 INFO L495 AbstractCegarLoop]: Abstraction has 765 states and 1055 transitions. [2022-07-14 06:19:07,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.909090909090909) internal successors, (43), 10 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:19:07,906 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1055 transitions. [2022-07-14 06:19:07,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 06:19:07,907 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:07,907 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:07,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (47)] Ended with exit code 0 [2022-07-14 06:19:08,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:19:08,115 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:19:08,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:08,115 INFO L85 PathProgramCache]: Analyzing trace with hash 73024751, now seen corresponding path program 1 times [2022-07-14 06:19:08,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:19:08,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037300372] [2022-07-14 06:19:08,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:08,116 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:19:08,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:19:08,117 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:19:08,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (48)] Waiting until timeout for monitored process [2022-07-14 06:19:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:08,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-14 06:19:08,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:08,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-14 06:19:08,440 INFO L356 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-07-14 06:19:08,440 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 28 treesize of output 27 [2022-07-14 06:19:08,475 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 24 treesize of output 8 [2022-07-14 06:19:08,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:08,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:19:08,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:19:08,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2037300372] [2022-07-14 06:19:08,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2037300372] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:08,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:08,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-14 06:19:08,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004880850] [2022-07-14 06:19:08,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:08,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 06:19:08,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:19:08,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 06:19:08,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:19:08,500 INFO L87 Difference]: Start difference. First operand 765 states and 1055 transitions. Second operand has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 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:19:09,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:09,537 INFO L93 Difference]: Finished difference Result 1227 states and 1661 transitions. [2022-07-14 06:19:09,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 06:19:09,538 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 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 46 [2022-07-14 06:19:09,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:09,540 INFO L225 Difference]: With dead ends: 1227 [2022-07-14 06:19:09,540 INFO L226 Difference]: Without dead ends: 1227 [2022-07-14 06:19:09,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=585, Unknown=0, NotChecked=0, Total=756 [2022-07-14 06:19:09,541 INFO L413 NwaCegarLoop]: 164 mSDtfsCounter, 1209 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1209 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:09,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1209 Valid, 1427 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-14 06:19:09,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2022-07-14 06:19:09,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 861. [2022-07-14 06:19:09,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 753 states have (on average 1.4794156706507304) internal successors, (1114), 824 states have internal predecessors, (1114), 30 states have call successors, (30), 15 states have call predecessors, (30), 30 states have return successors, (60), 21 states have call predecessors, (60), 30 states have call successors, (60) [2022-07-14 06:19:09,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1204 transitions. [2022-07-14 06:19:09,552 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1204 transitions. Word has length 46 [2022-07-14 06:19:09,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:09,553 INFO L495 AbstractCegarLoop]: Abstraction has 861 states and 1204 transitions. [2022-07-14 06:19:09,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3846153846153846) internal successors, (44), 12 states have internal predecessors, (44), 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:19:09,553 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1204 transitions. [2022-07-14 06:19:09,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 06:19:09,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:09,553 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:09,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (48)] Forceful destruction successful, exit code 0 [2022-07-14 06:19:09,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:19:09,761 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:19:09,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:09,762 INFO L85 PathProgramCache]: Analyzing trace with hash 130283053, now seen corresponding path program 1 times [2022-07-14 06:19:09,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:19:09,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111230389] [2022-07-14 06:19:09,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:09,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:19:09,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:19:09,763 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:19:09,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (49)] Waiting until timeout for monitored process [2022-07-14 06:19:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:09,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-14 06:19:09,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:10,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:19:10,089 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 24 treesize of output 8 [2022-07-14 06:19:10,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:10,109 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:19:10,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:19:10,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111230389] [2022-07-14 06:19:10,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111230389] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:10,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:10,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 06:19:10,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025305836] [2022-07-14 06:19:10,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:10,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:19:10,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:19:10,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:19:10,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:19:10,110 INFO L87 Difference]: Start difference. First operand 861 states and 1204 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 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:19:10,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:10,799 INFO L93 Difference]: Finished difference Result 1258 states and 1742 transitions. [2022-07-14 06:19:10,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 06:19:10,800 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 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 46 [2022-07-14 06:19:10,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:10,802 INFO L225 Difference]: With dead ends: 1258 [2022-07-14 06:19:10,802 INFO L226 Difference]: Without dead ends: 1258 [2022-07-14 06:19:10,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2022-07-14 06:19:10,803 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 933 mSDsluCounter, 863 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 933 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 334 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:10,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [933 Valid, 1039 Invalid, 334 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:19:10,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2022-07-14 06:19:10,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 1039. [2022-07-14 06:19:10,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 907 states have (on average 1.4972436604189636) internal successors, (1358), 990 states have internal predecessors, (1358), 42 states have call successors, (42), 21 states have call predecessors, (42), 42 states have return successors, (84), 27 states have call predecessors, (84), 42 states have call successors, (84) [2022-07-14 06:19:10,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1484 transitions. [2022-07-14 06:19:10,813 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1484 transitions. Word has length 46 [2022-07-14 06:19:10,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:10,813 INFO L495 AbstractCegarLoop]: Abstraction has 1039 states and 1484 transitions. [2022-07-14 06:19:10,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 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:19:10,814 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1484 transitions. [2022-07-14 06:19:10,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-14 06:19:10,814 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:10,814 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:10,829 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (49)] Forceful destruction successful, exit code 0 [2022-07-14 06:19:11,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:19:11,022 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:19:11,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:11,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1119274903, now seen corresponding path program 1 times [2022-07-14 06:19:11,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:19:11,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71123842] [2022-07-14 06:19:11,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:11,023 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:19:11,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:19:11,024 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:19:11,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (50)] Waiting until timeout for monitored process [2022-07-14 06:19:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:11,148 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-14 06:19:11,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:11,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:19:11,306 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 37 treesize of output 21 [2022-07-14 06:19:11,312 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-07-14 06:19:11,312 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 29 treesize of output 16 [2022-07-14 06:19:11,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:11,337 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:19:11,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:19:11,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71123842] [2022-07-14 06:19:11,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [71123842] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:11,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:11,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 06:19:11,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691823989] [2022-07-14 06:19:11,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:11,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:19:11,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:19:11,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:19:11,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:19:11,338 INFO L87 Difference]: Start difference. First operand 1039 states and 1484 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 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:19:12,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:12,519 INFO L93 Difference]: Finished difference Result 1448 states and 2012 transitions. [2022-07-14 06:19:12,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 06:19:12,520 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 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 46 [2022-07-14 06:19:12,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:12,522 INFO L225 Difference]: With dead ends: 1448 [2022-07-14 06:19:12,522 INFO L226 Difference]: Without dead ends: 1448 [2022-07-14 06:19:12,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2022-07-14 06:19:12,523 INFO L413 NwaCegarLoop]: 341 mSDtfsCounter, 318 mSDsluCounter, 2042 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 2383 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:12,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 2383 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-14 06:19:12,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2022-07-14 06:19:12,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 901. [2022-07-14 06:19:12,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 789 states have (on average 1.4892268694550064) internal successors, (1175), 862 states have internal predecessors, (1175), 32 states have call successors, (32), 16 states have call predecessors, (32), 32 states have return successors, (64), 22 states have call predecessors, (64), 32 states have call successors, (64) [2022-07-14 06:19:12,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1271 transitions. [2022-07-14 06:19:12,533 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1271 transitions. Word has length 46 [2022-07-14 06:19:12,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:12,534 INFO L495 AbstractCegarLoop]: Abstraction has 901 states and 1271 transitions. [2022-07-14 06:19:12,534 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 9 states have internal predecessors, (44), 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:19:12,534 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1271 transitions. [2022-07-14 06:19:12,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 06:19:12,534 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:12,534 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:12,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (50)] Forceful destruction successful, exit code 0 [2022-07-14 06:19:12,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:19:12,736 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:19:12,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:12,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1458766323, now seen corresponding path program 1 times [2022-07-14 06:19:12,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:19:12,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1414625886] [2022-07-14 06:19:12,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:12,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:19:12,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:19:12,738 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:19:12,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (51)] Waiting until timeout for monitored process [2022-07-14 06:19:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:12,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-14 06:19:12,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:12,990 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:19:12,991 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:19:13,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-14 06:19:13,289 INFO L356 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-07-14 06:19:13,289 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 39 treesize of output 30 [2022-07-14 06:19:13,361 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 35 treesize of output 11 [2022-07-14 06:19:13,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:13,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:19:15,634 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 122 treesize of output 114 [2022-07-14 06:19:16,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:16,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:19:16,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1414625886] [2022-07-14 06:19:16,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1414625886] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-14 06:19:16,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:19:16,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 22 [2022-07-14 06:19:16,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172769530] [2022-07-14 06:19:16,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:16,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:19:16,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:19:16,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:19:16,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=447, Unknown=1, NotChecked=0, Total=506 [2022-07-14 06:19:16,141 INFO L87 Difference]: Start difference. First operand 901 states and 1271 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 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:19:17,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:17,696 INFO L93 Difference]: Finished difference Result 1295 states and 1818 transitions. [2022-07-14 06:19:17,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 06:19:17,697 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 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:19:17,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:17,698 INFO L225 Difference]: With dead ends: 1295 [2022-07-14 06:19:17,698 INFO L226 Difference]: Without dead ends: 1295 [2022-07-14 06:19:17,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=115, Invalid=876, Unknown=1, NotChecked=0, Total=992 [2022-07-14 06:19:17,699 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 276 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:17,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 1202 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 412 Invalid, 0 Unknown, 119 Unchecked, 1.0s Time] [2022-07-14 06:19:17,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2022-07-14 06:19:17,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1044. [2022-07-14 06:19:17,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1044 states, 916 states have (on average 1.505458515283843) internal successors, (1379), 997 states have internal predecessors, (1379), 40 states have call successors, (40), 20 states have call predecessors, (40), 40 states have return successors, (80), 26 states have call predecessors, (80), 40 states have call successors, (80) [2022-07-14 06:19:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1044 states to 1044 states and 1499 transitions. [2022-07-14 06:19:17,710 INFO L78 Accepts]: Start accepts. Automaton has 1044 states and 1499 transitions. Word has length 48 [2022-07-14 06:19:17,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:17,710 INFO L495 AbstractCegarLoop]: Abstraction has 1044 states and 1499 transitions. [2022-07-14 06:19:17,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 11 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:19:17,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1044 states and 1499 transitions. [2022-07-14 06:19:17,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 06:19:17,711 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:17,711 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:17,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (51)] Forceful destruction successful, exit code 0 [2022-07-14 06:19:17,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:19:17,919 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:19:17,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:17,920 INFO L85 PathProgramCache]: Analyzing trace with hash 649419697, now seen corresponding path program 1 times [2022-07-14 06:19:17,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:19:17,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360894320] [2022-07-14 06:19:17,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:17,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:19:17,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:19:17,922 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:19:17,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (52)] Waiting until timeout for monitored process [2022-07-14 06:19:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:18,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 06:19:18,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:18,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, 1 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:19:18,475 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 35 treesize of output 11 [2022-07-14 06:19:18,540 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:18,540 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:19:18,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:19:18,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360894320] [2022-07-14 06:19:18,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360894320] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:18,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:18,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:19:18,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917245738] [2022-07-14 06:19:18,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:18,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:19:18,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:19:18,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:19:18,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:19:18,541 INFO L87 Difference]: Start difference. First operand 1044 states and 1499 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 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:19:19,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:19,898 INFO L93 Difference]: Finished difference Result 1341 states and 1883 transitions. [2022-07-14 06:19:19,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 06:19:19,899 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 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:19:19,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:19,901 INFO L225 Difference]: With dead ends: 1341 [2022-07-14 06:19:19,901 INFO L226 Difference]: Without dead ends: 1341 [2022-07-14 06:19:19,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2022-07-14 06:19:19,902 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 1176 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:19,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 897 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-14 06:19:19,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2022-07-14 06:19:19,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 1133. [2022-07-14 06:19:19,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 993 states have (on average 1.5115810674723063) internal successors, (1501), 1080 states have internal predecessors, (1501), 46 states have call successors, (46), 23 states have call predecessors, (46), 46 states have return successors, (92), 29 states have call predecessors, (92), 46 states have call successors, (92) [2022-07-14 06:19:19,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1639 transitions. [2022-07-14 06:19:19,913 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1639 transitions. Word has length 48 [2022-07-14 06:19:19,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:19,913 INFO L495 AbstractCegarLoop]: Abstraction has 1133 states and 1639 transitions. [2022-07-14 06:19:19,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 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:19:19,913 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1639 transitions. [2022-07-14 06:19:19,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 06:19:19,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:19,914 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:19,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (52)] Forceful destruction successful, exit code 0 [2022-07-14 06:19:20,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:19:20,123 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:19:20,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:20,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1070553809, now seen corresponding path program 1 times [2022-07-14 06:19:20,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:19:20,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1161314537] [2022-07-14 06:19:20,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:20,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:19:20,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:19:20,125 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:19:20,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (53)] Waiting until timeout for monitored process [2022-07-14 06:19:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:20,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-14 06:19:20,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:20,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-14 06:19:20,768 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 29 treesize of output 11 [2022-07-14 06:19:20,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:20,824 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:19:20,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:19:20,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1161314537] [2022-07-14 06:19:20,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1161314537] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:19:20,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:19:20,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:19:20,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235157125] [2022-07-14 06:19:20,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:20,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:19:20,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:19:20,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:19:20,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:19:20,826 INFO L87 Difference]: Start difference. First operand 1133 states and 1639 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 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:19:22,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:22,155 INFO L93 Difference]: Finished difference Result 1376 states and 1927 transitions. [2022-07-14 06:19:22,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 06:19:22,157 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 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:19:22,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:22,159 INFO L225 Difference]: With dead ends: 1376 [2022-07-14 06:19:22,159 INFO L226 Difference]: Without dead ends: 1376 [2022-07-14 06:19:22,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=110, Invalid=232, Unknown=0, NotChecked=0, Total=342 [2022-07-14 06:19:22,159 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 1078 mSDsluCounter, 722 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1078 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:22,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1078 Valid, 872 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-14 06:19:22,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2022-07-14 06:19:22,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 1133. [2022-07-14 06:19:22,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 993 states have (on average 1.5115810674723063) internal successors, (1501), 1080 states have internal predecessors, (1501), 46 states have call successors, (46), 23 states have call predecessors, (46), 46 states have return successors, (92), 29 states have call predecessors, (92), 46 states have call successors, (92) [2022-07-14 06:19:22,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1639 transitions. [2022-07-14 06:19:22,170 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1639 transitions. Word has length 48 [2022-07-14 06:19:22,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:22,170 INFO L495 AbstractCegarLoop]: Abstraction has 1133 states and 1639 transitions. [2022-07-14 06:19:22,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 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:19:22,171 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1639 transitions. [2022-07-14 06:19:22,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-14 06:19:22,171 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:22,171 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:19:22,190 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (53)] Forceful destruction successful, exit code 0 [2022-07-14 06:19:22,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:19:22,379 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:19:22,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:22,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1879900435, now seen corresponding path program 1 times [2022-07-14 06:19:22,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:19:22,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679478917] [2022-07-14 06:19:22,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:22,380 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:19:22,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:19:22,381 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:19:22,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (54)] Waiting until timeout for monitored process [2022-07-14 06:19:22,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:22,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-14 06:19:22,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:22,648 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:19:22,648 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:19:23,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-07-14 06:19:23,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:23,278 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 39 treesize of output 30 [2022-07-14 06:19:23,409 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 29 treesize of output 11 [2022-07-14 06:19:23,478 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:23,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:19:23,842 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 114 treesize of output 106 [2022-07-14 06:19:24,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:24,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:19:24,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679478917] [2022-07-14 06:19:24,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1679478917] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-14 06:19:24,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:19:24,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 20 [2022-07-14 06:19:24,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860247560] [2022-07-14 06:19:24,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:19:24,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:19:24,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:19:24,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:19:24,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2022-07-14 06:19:24,791 INFO L87 Difference]: Start difference. First operand 1133 states and 1639 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 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:19:31,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:31,043 INFO L93 Difference]: Finished difference Result 1520 states and 2108 transitions. [2022-07-14 06:19:31,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 06:19:31,045 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 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:19:31,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:31,047 INFO L225 Difference]: With dead ends: 1520 [2022-07-14 06:19:31,047 INFO L226 Difference]: Without dead ends: 1520 [2022-07-14 06:19:31,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=134, Invalid=988, Unknown=0, NotChecked=0, Total=1122 [2022-07-14 06:19:31,048 INFO L413 NwaCegarLoop]: 308 mSDtfsCounter, 248 mSDsluCounter, 2027 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 2335 SdHoareTripleChecker+Invalid, 1246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 644 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:31,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 2335 Invalid, 1246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 593 Invalid, 0 Unknown, 644 Unchecked, 1.6s Time] [2022-07-14 06:19:31,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2022-07-14 06:19:31,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1169. [2022-07-14 06:19:31,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1169 states, 1025 states have (on average 1.5219512195121951) internal successors, (1560), 1114 states have internal predecessors, (1560), 48 states have call successors, (48), 24 states have call predecessors, (48), 48 states have return successors, (96), 30 states have call predecessors, (96), 48 states have call successors, (96) [2022-07-14 06:19:31,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1169 states to 1169 states and 1704 transitions. [2022-07-14 06:19:31,062 INFO L78 Accepts]: Start accepts. Automaton has 1169 states and 1704 transitions. Word has length 48 [2022-07-14 06:19:31,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:31,062 INFO L495 AbstractCegarLoop]: Abstraction has 1169 states and 1704 transitions. [2022-07-14 06:19:31,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 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:19:31,063 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1704 transitions. [2022-07-14 06:19:31,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-14 06:19:31,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:31,063 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:31,076 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (54)] Forceful destruction successful, exit code 0 [2022-07-14 06:19:31,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:19:31,274 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:19:31,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:31,275 INFO L85 PathProgramCache]: Analyzing trace with hash -1428458669, now seen corresponding path program 1 times [2022-07-14 06:19:31,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:19:31,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693637841] [2022-07-14 06:19:31,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:31,275 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:19:31,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:19:31,277 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:19:31,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (55)] Waiting until timeout for monitored process [2022-07-14 06:19:31,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:31,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 06:19:31,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:31,668 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 06:19:31,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 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:19:32,763 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:32,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:19:33,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:19:33,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1693637841] [2022-07-14 06:19:33,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1693637841] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:19:33,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1701731202] [2022-07-14 06:19:33,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:33,104 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:19:33,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:19:33,106 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:19:33,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (56)] Waiting until timeout for monitored process [2022-07-14 06:19:33,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:33,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-14 06:19:33,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:33,569 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 06:19:33,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 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:19:34,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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:19:35,360 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 40 treesize of output 16 [2022-07-14 06:19:35,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:35,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:19:35,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1701731202] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:19:35,764 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:19:35,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 8] total 10 [2022-07-14 06:19:35,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847338110] [2022-07-14 06:19:35,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:19:35,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-14 06:19:35,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:19:35,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-14 06:19:35,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:19:35,765 INFO L87 Difference]: Start difference. First operand 1169 states and 1704 transitions. Second operand has 12 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 4 states have call successors, (4), 4 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:19:40,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:40,542 INFO L93 Difference]: Finished difference Result 3594 states and 5121 transitions. [2022-07-14 06:19:40,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 06:19:40,542 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 4 states have call successors, (4), 4 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 50 [2022-07-14 06:19:40,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:40,547 INFO L225 Difference]: With dead ends: 3594 [2022-07-14 06:19:40,547 INFO L226 Difference]: Without dead ends: 3594 [2022-07-14 06:19:40,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=324, Invalid=866, Unknown=0, NotChecked=0, Total=1190 [2022-07-14 06:19:40,548 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 2033 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2034 SdHoareTripleChecker+Valid, 1956 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 385 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:40,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2034 Valid, 1956 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 680 Invalid, 0 Unknown, 385 Unchecked, 2.1s Time] [2022-07-14 06:19:40,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3594 states. [2022-07-14 06:19:40,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3594 to 2455. [2022-07-14 06:19:40,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2455 states, 2236 states have (on average 1.5572450805008944) internal successors, (3482), 2334 states have internal predecessors, (3482), 90 states have call successors, (90), 55 states have call predecessors, (90), 81 states have return successors, (151), 65 states have call predecessors, (151), 90 states have call successors, (151) [2022-07-14 06:19:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2455 states to 2455 states and 3723 transitions. [2022-07-14 06:19:40,586 INFO L78 Accepts]: Start accepts. Automaton has 2455 states and 3723 transitions. Word has length 50 [2022-07-14 06:19:40,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:40,586 INFO L495 AbstractCegarLoop]: Abstraction has 2455 states and 3723 transitions. [2022-07-14 06:19:40,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 4 states have call successors, (4), 4 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:19:40,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2455 states and 3723 transitions. [2022-07-14 06:19:40,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-14 06:19:40,587 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:40,587 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 06:19:40,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (55)] Forceful destruction successful, exit code 0 [2022-07-14 06:19:40,791 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (56)] Forceful destruction successful, exit code 0 [2022-07-14 06:19:40,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-14 06:19:40,987 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:19:40,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:40,988 INFO L85 PathProgramCache]: Analyzing trace with hash -192199998, now seen corresponding path program 1 times [2022-07-14 06:19:40,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:19:40,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [767950139] [2022-07-14 06:19:40,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:40,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:19:40,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:19:40,989 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:19:40,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (57)] Waiting until timeout for monitored process [2022-07-14 06:19:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:41,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-14 06:19:41,171 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:41,191 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:19:41,428 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:19:41,488 INFO L356 Elim1Store]: treesize reduction 37, result has 22.9 percent of original size [2022-07-14 06:19:41,488 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 29 treesize of output 28 [2022-07-14 06:19:41,594 INFO L356 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2022-07-14 06:19:41,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 21 [2022-07-14 06:19:41,658 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 19 treesize of output 11 [2022-07-14 06:19:41,682 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:41,683 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:19:44,022 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 130 treesize of output 122 [2022-07-14 06:19:44,956 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:19:44,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:19:44,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [767950139] [2022-07-14 06:19:44,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [767950139] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:19:44,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:19:44,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2022-07-14 06:19:44,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199786195] [2022-07-14 06:19:44,957 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:19:44,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-14 06:19:44,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:19:44,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-14 06:19:44,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=367, Unknown=1, NotChecked=0, Total=420 [2022-07-14 06:19:44,958 INFO L87 Difference]: Start difference. First operand 2455 states and 3723 transitions. Second operand has 21 states, 20 states have (on average 3.95) internal successors, (79), 18 states have internal predecessors, (79), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:19:47,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:47,824 INFO L93 Difference]: Finished difference Result 3630 states and 5494 transitions. [2022-07-14 06:19:47,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-14 06:19:47,824 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.95) internal successors, (79), 18 states have internal predecessors, (79), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 51 [2022-07-14 06:19:47,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:47,830 INFO L225 Difference]: With dead ends: 3630 [2022-07-14 06:19:47,830 INFO L226 Difference]: Without dead ends: 3630 [2022-07-14 06:19:47,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 82 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=333, Invalid=1472, Unknown=1, NotChecked=0, Total=1806 [2022-07-14 06:19:47,831 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 1270 mSDsluCounter, 2069 mSDsCounter, 0 mSdLazyCounter, 864 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1270 SdHoareTripleChecker+Valid, 2249 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 728 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:47,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1270 Valid, 2249 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 864 Invalid, 0 Unknown, 728 Unchecked, 1.9s Time] [2022-07-14 06:19:47,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3630 states. [2022-07-14 06:19:47,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3630 to 2517. [2022-07-14 06:19:47,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2517 states, 2292 states have (on average 1.550174520069808) internal successors, (3553), 2389 states have internal predecessors, (3553), 92 states have call successors, (92), 57 states have call predecessors, (92), 85 states have return successors, (155), 70 states have call predecessors, (155), 92 states have call successors, (155) [2022-07-14 06:19:47,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2517 states to 2517 states and 3800 transitions. [2022-07-14 06:19:47,866 INFO L78 Accepts]: Start accepts. Automaton has 2517 states and 3800 transitions. Word has length 51 [2022-07-14 06:19:47,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:47,866 INFO L495 AbstractCegarLoop]: Abstraction has 2517 states and 3800 transitions. [2022-07-14 06:19:47,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.95) internal successors, (79), 18 states have internal predecessors, (79), 2 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2022-07-14 06:19:47,866 INFO L276 IsEmpty]: Start isEmpty. Operand 2517 states and 3800 transitions. [2022-07-14 06:19:47,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-14 06:19:47,867 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:47,867 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 06:19:47,886 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (57)] Forceful destruction successful, exit code 0 [2022-07-14 06:19:48,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:19:48,079 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:19:48,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:48,080 INFO L85 PathProgramCache]: Analyzing trace with hash -192199997, now seen corresponding path program 1 times [2022-07-14 06:19:48,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:19:48,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065687145] [2022-07-14 06:19:48,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:48,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:19:48,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:19:48,081 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:19:48,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (58)] Waiting until timeout for monitored process [2022-07-14 06:19:48,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:48,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-14 06:19:48,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:48,352 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:19:48,368 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:19:48,863 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:19:48,877 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:19:48,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:48,962 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 27 treesize of output 26 [2022-07-14 06:19:48,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:48,972 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 42 treesize of output 33 [2022-07-14 06:19:49,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:49,190 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 18 treesize of output 20 [2022-07-14 06:19:49,202 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-14 06:19:49,203 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 17 treesize of output 17 [2022-07-14 06:19:49,332 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:19:49,336 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 19 treesize of output 7 [2022-07-14 06:19:49,379 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:49,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:19:50,667 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:19:50,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065687145] [2022-07-14 06:19:50,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2065687145] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:19:50,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1008046280] [2022-07-14 06:19:50,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:50,669 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:19:50,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:19:50,670 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:19:50,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (59)] Waiting until timeout for monitored process [2022-07-14 06:19:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:51,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-14 06:19:51,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:51,143 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:19:51,164 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:19:51,894 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:19:51,911 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:19:52,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:52,015 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 42 treesize of output 33 [2022-07-14 06:19:52,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:52,027 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 27 treesize of output 26 [2022-07-14 06:19:52,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:52,303 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 18 treesize of output 20 [2022-07-14 06:19:52,312 INFO L356 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-07-14 06:19:52,312 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 17 treesize of output 17 [2022-07-14 06:19:52,502 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 19 treesize of output 7 [2022-07-14 06:19:52,508 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:19:52,511 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:52,511 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:19:52,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1008046280] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:19:52,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:19:52,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 25 [2022-07-14 06:19:52,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677940256] [2022-07-14 06:19:52,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:19:52,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-14 06:19:52,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:19:52,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-14 06:19:52,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=861, Unknown=0, NotChecked=0, Total=992 [2022-07-14 06:19:52,983 INFO L87 Difference]: Start difference. First operand 2517 states and 3800 transitions. Second operand has 27 states, 26 states have (on average 3.576923076923077) internal successors, (93), 23 states have internal predecessors, (93), 4 states have call successors, (4), 4 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:19:56,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:19:56,772 INFO L93 Difference]: Finished difference Result 3581 states and 5392 transitions. [2022-07-14 06:19:56,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 06:19:56,773 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.576923076923077) internal successors, (93), 23 states have internal predecessors, (93), 4 states have call successors, (4), 4 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 51 [2022-07-14 06:19:56,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:19:56,778 INFO L225 Difference]: With dead ends: 3581 [2022-07-14 06:19:56,778 INFO L226 Difference]: Without dead ends: 3581 [2022-07-14 06:19:56,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 90 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=391, Invalid=1865, Unknown=0, NotChecked=0, Total=2256 [2022-07-14 06:19:56,779 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 1697 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 1310 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1698 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 1417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:19:56,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1698 Valid, 1336 Invalid, 1417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1310 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-14 06:19:56,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3581 states. [2022-07-14 06:19:56,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3581 to 2517. [2022-07-14 06:19:56,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2517 states, 2292 states have (on average 1.5479930191972078) internal successors, (3548), 2389 states have internal predecessors, (3548), 92 states have call successors, (92), 57 states have call predecessors, (92), 85 states have return successors, (155), 70 states have call predecessors, (155), 92 states have call successors, (155) [2022-07-14 06:19:56,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2517 states to 2517 states and 3795 transitions. [2022-07-14 06:19:56,810 INFO L78 Accepts]: Start accepts. Automaton has 2517 states and 3795 transitions. Word has length 51 [2022-07-14 06:19:56,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:19:56,810 INFO L495 AbstractCegarLoop]: Abstraction has 2517 states and 3795 transitions. [2022-07-14 06:19:56,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.576923076923077) internal successors, (93), 23 states have internal predecessors, (93), 4 states have call successors, (4), 4 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:19:56,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2517 states and 3795 transitions. [2022-07-14 06:19:56,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-14 06:19:56,811 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:19:56,811 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:19:56,833 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (58)] Forceful destruction successful, exit code 0 [2022-07-14 06:19:57,023 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (59)] Ended with exit code 0 [2022-07-14 06:19:57,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-14 06:19:57,220 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 64 more)] === [2022-07-14 06:19:57,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:19:57,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1628744015, now seen corresponding path program 1 times [2022-07-14 06:19:57,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:19:57,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2137876256] [2022-07-14 06:19:57,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:19:57,220 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:19:57,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:19:57,221 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:19:57,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (60)] Waiting until timeout for monitored process [2022-07-14 06:19:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:19:57,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-14 06:19:57,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:19:57,595 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:19:57,596 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:19:58,170 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:19:58,171 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-07-14 06:19:58,198 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:19:58,198 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-07-14 06:19:58,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:58,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:58,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2022-07-14 06:19:58,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:58,351 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:58,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 40 [2022-07-14 06:19:58,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:58,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:58,462 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-14 06:19:58,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:58,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:58,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2022-07-14 06:19:58,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:58,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-07-14 06:19:58,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-14 06:19:58,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:58,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2022-07-14 06:19:58,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-07-14 06:19:58,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:58,923 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 25 treesize of output 24 [2022-07-14 06:19:58,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:58,928 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 24 treesize of output 26 [2022-07-14 06:19:59,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:59,030 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:19:59,043 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-14 06:19:59,043 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 51 [2022-07-14 06:19:59,049 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 24 treesize of output 26 [2022-07-14 06:19:59,403 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:19:59,403 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 1 case distinctions, treesize of input 33 treesize of output 21 [2022-07-14 06:19:59,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:19:59,430 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-07-14 06:19:59,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 22 [2022-07-14 06:19:59,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:19:59,685 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:20:00,066 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1244 (_ BitVec 32))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1244)))) (select .cse0 (select (select .cse0 |c_~#list~0.base|) (bvadd |c_~#list~0.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32))) (forall ((v_ArrVal_1245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1244 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1245) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1244)) |c_~#list~0.base|) (bvadd |c_~#list~0.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG)))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32)))) is different from false [2022-07-14 06:20:00,118 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1244 (_ BitVec 32))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1245) (let ((.cse0 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (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|) (bvadd .cse0 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_append_one_~item~1#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1244)) |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse0)))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)))) (forall ((v_ArrVal_1244 (_ BitVec 32))) (= (select (let ((.cse2 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse1 (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|) (bvadd .cse2 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_append_one_~item~1#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1244)))) (select .cse1 (select (select .cse1 |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse2))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32)))) is different from false [2022-07-14 06:20:00,164 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1244 (_ BitVec 32))) (= (select (let ((.cse1 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse0 (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|) (bvadd .cse1 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_#res#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1244)))) (select .cse0 (select (select .cse0 |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse1))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32))) (forall ((v_ArrVal_1245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1244 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1245) (let ((.cse2 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (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|) (bvadd .cse2 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_#res#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1244)) |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse2)))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32)))) is different from false [2022-07-14 06:20:00,195 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1244 (_ BitVec 32))) (= (select (let ((.cse1 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse0 (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|) (bvadd .cse1 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~head~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1244)))) (select .cse0 (select (select .cse0 |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse1))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32))) (forall ((v_ArrVal_1245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1244 (_ BitVec 32))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1245) (let ((.cse2 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (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|) (bvadd .cse2 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~head~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1244)) |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse2)))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32)))) is different from false [2022-07-14 06:20:00,231 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1244 (_ BitVec 32))) (= (select (let ((.cse1 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1240))) (store .cse2 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse2 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse1 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~head~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1244))))) (select .cse0 (select (select .cse0 |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse1))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32))) (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1244 (_ BitVec 32)) (v_ArrVal_1239 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1239) |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1245) (let ((.cse4 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1240))) (store .cse3 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse3 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse4 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~head~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1244))) |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse4)))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32)))) is different from false [2022-07-14 06:20:00,308 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1244 (_ BitVec 32))) (= (_ bv0 32) (select (let ((.cse1 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1240))) (store .cse2 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse2 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse1 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1244))))) (select .cse0 (select (select .cse0 |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse1))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)))) (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1244 (_ BitVec 32)) (v_ArrVal_1239 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1239) |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1245) (let ((.cse4 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1240))) (store .cse3 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse3 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse4 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1244))) |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse4)))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT))))) is different from false [2022-07-14 06:20:00,406 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1235 (_ BitVec 32)) (v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1236 (_ BitVec 32)) (v_ArrVal_1245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1244 (_ BitVec 32)) (v_ArrVal_1239 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (let ((.cse0 (bvadd (_ bv8 32) |c_ULTIMATE.start_create_item_~item~0#1.offset|))) (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse0 v_ArrVal_1236)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1239) |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1245) (let ((.cse2 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse0 v_ArrVal_1235)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1240))) (store .cse1 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse1 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse2 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1244))) |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse2))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32))) (forall ((v_ArrVal_1235 (_ BitVec 32)) (v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1244 (_ BitVec 32))) (= (select (let ((.cse4 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse3 (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_create_item_~item~0#1.offset|) v_ArrVal_1235)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1240))) (store .cse5 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse5 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse4 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1244))))) (select .cse3 (select (select .cse3 |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse4))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32)))) is different from false [2022-07-14 06:20:00,571 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1235 (_ BitVec 32)) (v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1233 (_ BitVec 32)) (v_ArrVal_1244 (_ BitVec 32))) (= (select (let ((.cse1 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse0 (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~term_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|) v_ArrVal_1233) (bvadd (_ bv8 32) |c_ULTIMATE.start_create_item_~item~0#1.offset|) v_ArrVal_1235)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1240))) (store .cse2 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse2 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse1 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1244))))) (select .cse0 (select (select .cse0 |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse1))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32))) (forall ((v_ArrVal_1235 (_ BitVec 32)) (v_ArrVal_1234 (_ BitVec 32)) (v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1236 (_ BitVec 32)) (v_ArrVal_1245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1233 (_ BitVec 32)) (v_ArrVal_1244 (_ BitVec 32)) (v_ArrVal_1239 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (let ((.cse3 (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~term_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|)) (.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_create_item_~item~0#1.offset|))) (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse3 v_ArrVal_1234) .cse4 v_ArrVal_1236)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1239) |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1245) (let ((.cse6 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse3 v_ArrVal_1233) .cse4 v_ArrVal_1235)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1240))) (store .cse5 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse5 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse6 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1244))) |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse6))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32)))) is different from false [2022-07-14 06:20:00,813 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1235 (_ BitVec 32)) (v_ArrVal_1234 (_ BitVec 32)) (v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1236 (_ BitVec 32)) (v_ArrVal_1245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1233 (_ BitVec 32)) (v_ArrVal_1244 (_ BitVec 32)) (v_ArrVal_1239 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (let ((.cse0 (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~link_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|)) (.cse1 (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~term_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_create_item_~item~0#1.offset|))) (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse0 |c_ULTIMATE.start_create_item_~link~0#1.offset|) .cse1 v_ArrVal_1234) .cse2 v_ArrVal_1236)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1239) |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1245) (let ((.cse4 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse0 |c_ULTIMATE.start_create_item_~link~0#1.base|) .cse1 v_ArrVal_1233) .cse2 v_ArrVal_1235)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1240))) (store .cse3 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse3 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse4 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1244))) |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse4))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32))) (forall ((v_ArrVal_1235 (_ BitVec 32)) (v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1233 (_ BitVec 32)) (v_ArrVal_1244 (_ BitVec 32))) (= (select (let ((.cse6 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse5 (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~link_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|) |c_ULTIMATE.start_create_item_~link~0#1.base|) (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~term_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|) v_ArrVal_1233) (bvadd (_ bv8 32) |c_ULTIMATE.start_create_item_~item~0#1.offset|) v_ArrVal_1235)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1240))) (store .cse7 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse7 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse6 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1244))))) (select .cse5 (select (select .cse5 |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse6))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32)))) is different from false [2022-07-14 06:20:01,026 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1235 (_ BitVec 32)) (v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1233 (_ BitVec 32)) (v_ArrVal_1244 (_ BitVec 32))) (= (_ bv0 32) (select (let ((.cse1 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse0 (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~link_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|) |c_ULTIMATE.start_create_item_#t~mem13#1.base|) (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~term_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|) v_ArrVal_1233) (bvadd (_ bv8 32) |c_ULTIMATE.start_create_item_~item~0#1.offset|) v_ArrVal_1235)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1240))) (store .cse2 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse2 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse1 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1244))))) (select .cse0 (select (select .cse0 |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse1))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)))) (forall ((v_ArrVal_1235 (_ BitVec 32)) (v_ArrVal_1234 (_ BitVec 32)) (v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1236 (_ BitVec 32)) (v_ArrVal_1245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1233 (_ BitVec 32)) (v_ArrVal_1244 (_ BitVec 32)) (v_ArrVal_1239 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (let ((.cse3 (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~link_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|)) (.cse4 (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~term_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|)) (.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_create_item_~item~0#1.offset|))) (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse3 |c_ULTIMATE.start_create_item_#t~mem13#1.offset|) .cse4 v_ArrVal_1234) .cse5 v_ArrVal_1236)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1239) |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1245) (let ((.cse7 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse3 |c_ULTIMATE.start_create_item_#t~mem13#1.base|) .cse4 v_ArrVal_1233) .cse5 v_ArrVal_1235)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1240))) (store .cse6 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse6 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse7 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1244))) |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse7))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32)))) is different from false [2022-07-14 06:20:01,237 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1235 (_ BitVec 32)) (v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1233 (_ BitVec 32)) (v_ArrVal_1244 (_ BitVec 32))) (= (select (let ((.cse1 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse0 (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~link_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset|)) (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~term_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|) v_ArrVal_1233) (bvadd (_ bv8 32) |c_ULTIMATE.start_create_item_~item~0#1.offset|) v_ArrVal_1235)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1240))) (store .cse2 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse2 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse1 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1244))))) (select .cse0 (select (select .cse0 |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse1))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32))) (forall ((v_ArrVal_1235 (_ BitVec 32)) (v_ArrVal_1234 (_ BitVec 32)) (v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1236 (_ BitVec 32)) (v_ArrVal_1245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1233 (_ BitVec 32)) (v_ArrVal_1244 (_ BitVec 32)) (v_ArrVal_1239 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (let ((.cse3 (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~link_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|)) (.cse4 (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~term_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|)) (.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_create_item_~item~0#1.offset|))) (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse3 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset|)) .cse4 v_ArrVal_1234) .cse5 v_ArrVal_1236)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1239) |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1245) (let ((.cse7 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset|)) .cse4 v_ArrVal_1233) .cse5 v_ArrVal_1235)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1240))) (store .cse6 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse6 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse7 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1244))) |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse7))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32)))) is different from false [2022-07-14 06:20:01,906 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1235 (_ BitVec 32)) (v_ArrVal_1234 (_ BitVec 32)) (v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1236 (_ BitVec 32)) (v_ArrVal_1245 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1233 (_ BitVec 32)) (v_ArrVal_1244 (_ BitVec 32)) (v_ArrVal_1239 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (let ((.cse5 (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT))) (select (let ((.cse0 (bvadd |c_ULTIMATE.start_create_item_~item~0#1.offset| .cse5)) (.cse1 (bvadd (bvmul (_ bv4 32) ~unnamed2~0~ITEM_PREV) |c_ULTIMATE.start_create_item_~item~0#1.offset|)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_create_item_~item~0#1.offset|))) (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset|)) .cse1 v_ArrVal_1234) .cse2 v_ArrVal_1236)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1239) |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1245) (let ((.cse4 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset|)) .cse1 v_ArrVal_1233) .cse2 v_ArrVal_1235)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1240))) (store .cse3 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse3 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse4 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1244))) |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse4))))) .cse5)))) (forall ((v_ArrVal_1235 (_ BitVec 32)) (v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1233 (_ BitVec 32)) (v_ArrVal_1244 (_ BitVec 32))) (= (_ bv0 32) (let ((.cse9 (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT))) (select (let ((.cse7 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse6 (let ((.cse8 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_create_item_~item~0#1.offset| .cse9) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset|)) (bvadd (bvmul (_ bv4 32) ~unnamed2~0~ITEM_PREV) |c_ULTIMATE.start_create_item_~item~0#1.offset|) v_ArrVal_1233) (bvadd (_ bv8 32) |c_ULTIMATE.start_create_item_~item~0#1.offset|) v_ArrVal_1235)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1240))) (store .cse8 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse8 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse7 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1244))))) (select .cse6 (select (select .cse6 |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse7))))) .cse9))))) is different from false [2022-07-14 06:20:02,089 INFO L356 Elim1Store]: treesize reduction 35, result has 37.5 percent of original size [2022-07-14 06:20:02,089 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 122 [2022-07-14 06:20:02,332 INFO L356 Elim1Store]: treesize reduction 35, result has 37.5 percent of original size [2022-07-14 06:20:02,333 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 130 treesize of output 122 [2022-07-14 06:20:02,769 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_item_~item~0#1.base_24| (_ BitVec 32))) (or (and (forall ((v_ArrVal_1235 (_ BitVec 32)) (v_arrayElimArr_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1233 (_ BitVec 32))) (let ((.cse1 (bvadd |c_~#list~0.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG)))) (or (= (let ((.cse0 (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT))) (select (select (store (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_24| (store (store (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_create_item_~item~0#1.base_24|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_~#list~0.base|) .cse1)) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_PREV) v_ArrVal_1233) (_ bv8 32) v_ArrVal_1235)) |c_~#list~0.base| v_arrayElimArr_2) |v_ULTIMATE.start_create_item_~item~0#1.base_24|) .cse0)) (_ bv0 32)) (not (= (select v_arrayElimArr_2 .cse1) |v_ULTIMATE.start_create_item_~item~0#1.base_24|))))) (forall ((v_ArrVal_1234 (_ BitVec 32)) (v_ArrVal_1236 (_ BitVec 32)) (v_ArrVal_1245 (Array (_ BitVec 32) (_ BitVec 32)))) (= (let ((.cse2 (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT))) (select (select (store (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_24| (store (store (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_create_item_~item~0#1.base_24|) .cse2 (select (select |c_#memory_$Pointer$.offset| |c_~#list~0.base|) (bvadd |c_~#list~0.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG)))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_PREV) v_ArrVal_1234) (_ bv8 32) v_ArrVal_1236)) |c_~#list~0.base| v_ArrVal_1245) |v_ULTIMATE.start_create_item_~item~0#1.base_24|) .cse2)) (_ bv0 32)))) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_create_item_~item~0#1.base_24|)))))) is different from false [2022-07-14 06:20:02,772 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:20:02,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2137876256] [2022-07-14 06:20:02,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2137876256] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:20:02,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [395759184] [2022-07-14 06:20:02,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:02,772 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-14 06:20:02,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-14 06:20:02,773 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-14 06:20:02,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (61)] Waiting until timeout for monitored process [2022-07-14 06:20:03,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:03,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-14 06:20:03,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:20:03,213 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:20:03,213 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:20:04,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:04,228 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 27 treesize of output 22 [2022-07-14 06:20:04,234 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:04,234 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 27 treesize of output 22 [2022-07-14 06:20:04,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:04,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:04,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-07-14 06:20:04,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:04,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:04,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2022-07-14 06:20:04,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:04,661 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:04,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-14 06:20:04,667 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:04,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:04,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2022-07-14 06:20:04,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:04,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-14 06:20:05,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:05,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-07-14 06:20:05,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:05,151 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 25 treesize of output 24 [2022-07-14 06:20:05,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:05,159 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 24 treesize of output 26 [2022-07-14 06:20:05,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:05,221 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:05,233 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-07-14 06:20:05,234 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 51 [2022-07-14 06:20:05,245 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 24 treesize of output 26 [2022-07-14 06:20:05,427 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:20:05,427 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 1 case distinctions, treesize of input 33 treesize of output 21 [2022-07-14 06:20:05,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:05,448 INFO L356 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-07-14 06:20:05,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 22 [2022-07-14 06:20:05,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:20:05,481 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:20:05,636 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1305 (_ BitVec 32))) (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1305)))) (select .cse0 (select (select .cse0 |c_~#list~0.base|) (bvadd |c_~#list~0.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32))) (forall ((v_ArrVal_1305 (_ BitVec 32)) (v_ArrVal_1306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1306) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1305)) |c_~#list~0.base|) (bvadd |c_~#list~0.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG)))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT))))) is different from false [2022-07-14 06:20:05,684 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1305 (_ BitVec 32))) (= (_ bv0 32) (select (let ((.cse1 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse0 (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|) (bvadd .cse1 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_append_one_~item~1#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1305)))) (select .cse0 (select (select .cse0 |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse1))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)))) (forall ((v_ArrVal_1305 (_ BitVec 32)) (v_ArrVal_1306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1306) (let ((.cse2 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (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|) (bvadd .cse2 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_append_one_~item~1#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1305)) |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse2)))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32)))) is different from false [2022-07-14 06:20:05,739 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1305 (_ BitVec 32)) (v_ArrVal_1306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1306) (let ((.cse0 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (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|) (bvadd .cse0 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_#res#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1305)) |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse0)))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32))) (forall ((v_ArrVal_1305 (_ BitVec 32))) (= (select (let ((.cse2 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse1 (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|) (bvadd .cse2 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_#res#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1305)))) (select .cse1 (select (select .cse1 |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse2))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32)))) is different from false [2022-07-14 06:20:05,761 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1305 (_ BitVec 32))) (= (select (let ((.cse1 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse0 (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|) (bvadd .cse1 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~head~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1305)))) (select .cse0 (select (select .cse0 |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse1))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32))) (forall ((v_ArrVal_1305 (_ BitVec 32)) (v_ArrVal_1306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1306) (let ((.cse2 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (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|) (bvadd .cse2 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~head~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1305)) |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse2)))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32)))) is different from false [2022-07-14 06:20:05,799 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1305 (_ BitVec 32)) (v_ArrVal_1300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1300) |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1306) (let ((.cse1 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1298))) (store .cse0 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse0 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse1 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~head~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1305))) |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse1)))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)))) (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1305 (_ BitVec 32))) (= (select (let ((.cse3 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1298))) (store .cse4 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse4 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse3 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~head~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1305))))) (select .cse2 (select (select .cse2 |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse3))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32)))) is different from false [2022-07-14 06:20:05,843 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1305 (_ BitVec 32)) (v_ArrVal_1300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1306 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1300) |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1306) (let ((.cse1 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1298))) (store .cse0 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse0 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse1 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1305))) |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse1)))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32))) (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1305 (_ BitVec 32))) (= (select (let ((.cse3 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse2 (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1298))) (store .cse4 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse4 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse3 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1305))))) (select .cse2 (select (select .cse2 |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse3))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32)))) is different from false [2022-07-14 06:20:05,939 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1305 (_ BitVec 32)) (v_ArrVal_1296 (_ BitVec 32))) (= (select (let ((.cse1 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse0 (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_create_item_~item~0#1.offset|) v_ArrVal_1296)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1298))) (store .cse2 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse2 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse1 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1305))))) (select .cse0 (select (select .cse0 |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse1))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32))) (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1305 (_ BitVec 32)) (v_ArrVal_1300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1297 (_ BitVec 32)) (v_ArrVal_1306 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1296 (_ BitVec 32))) (= (select (let ((.cse3 (bvadd (_ bv8 32) |c_ULTIMATE.start_create_item_~item~0#1.offset|))) (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse3 v_ArrVal_1297)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1300) |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1306) (let ((.cse5 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (select (select (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse3 v_ArrVal_1296)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1298))) (store .cse4 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse4 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse5 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1305))) |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse5))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32)))) is different from false [2022-07-14 06:20:06,113 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1305 (_ BitVec 32)) (v_ArrVal_1290 (_ BitVec 32)) (v_ArrVal_1296 (_ BitVec 32))) (= (_ bv0 32) (select (let ((.cse1 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse0 (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~term_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|) v_ArrVal_1290) (bvadd (_ bv8 32) |c_ULTIMATE.start_create_item_~item~0#1.offset|) v_ArrVal_1296)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1298))) (store .cse2 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse2 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse1 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1305))))) (select .cse0 (select (select .cse0 |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse1))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)))) (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1305 (_ BitVec 32)) (v_ArrVal_1291 (_ BitVec 32)) (v_ArrVal_1290 (_ BitVec 32)) (v_ArrVal_1300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1297 (_ BitVec 32)) (v_ArrVal_1306 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1296 (_ BitVec 32))) (= (select (let ((.cse3 (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~term_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|)) (.cse4 (bvadd (_ bv8 32) |c_ULTIMATE.start_create_item_~item~0#1.offset|))) (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse3 v_ArrVal_1291) .cse4 v_ArrVal_1297)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1300) |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1306) (let ((.cse6 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (select (select (let ((.cse5 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse3 v_ArrVal_1290) .cse4 v_ArrVal_1296)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1298))) (store .cse5 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse5 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse6 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1305))) |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse6))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32)))) is different from false [2022-07-14 06:20:06,356 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1305 (_ BitVec 32)) (v_ArrVal_1290 (_ BitVec 32)) (v_ArrVal_1296 (_ BitVec 32))) (= (select (let ((.cse1 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse0 (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~link_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|) |c_ULTIMATE.start_create_item_~link~0#1.base|) (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~term_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|) v_ArrVal_1290) (bvadd (_ bv8 32) |c_ULTIMATE.start_create_item_~item~0#1.offset|) v_ArrVal_1296)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1298))) (store .cse2 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse2 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse1 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1305))))) (select .cse0 (select (select .cse0 |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse1))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32))) (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1305 (_ BitVec 32)) (v_ArrVal_1291 (_ BitVec 32)) (v_ArrVal_1290 (_ BitVec 32)) (v_ArrVal_1300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1297 (_ BitVec 32)) (v_ArrVal_1306 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1296 (_ BitVec 32))) (= (select (let ((.cse3 (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~link_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|)) (.cse4 (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~term_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|)) (.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_create_item_~item~0#1.offset|))) (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse3 |c_ULTIMATE.start_create_item_~link~0#1.offset|) .cse4 v_ArrVal_1291) .cse5 v_ArrVal_1297)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1300) |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1306) (let ((.cse7 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse3 |c_ULTIMATE.start_create_item_~link~0#1.base|) .cse4 v_ArrVal_1290) .cse5 v_ArrVal_1296)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1298))) (store .cse6 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse6 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse7 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1305))) |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse7))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32)))) is different from false [2022-07-14 06:20:06,634 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1305 (_ BitVec 32)) (v_ArrVal_1290 (_ BitVec 32)) (v_ArrVal_1296 (_ BitVec 32))) (= (select (let ((.cse1 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse0 (let ((.cse2 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~link_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|) |c_ULTIMATE.start_create_item_#t~mem13#1.base|) (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~term_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|) v_ArrVal_1290) (bvadd (_ bv8 32) |c_ULTIMATE.start_create_item_~item~0#1.offset|) v_ArrVal_1296)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1298))) (store .cse2 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse2 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse1 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1305))))) (select .cse0 (select (select .cse0 |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse1))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32))) (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1305 (_ BitVec 32)) (v_ArrVal_1291 (_ BitVec 32)) (v_ArrVal_1290 (_ BitVec 32)) (v_ArrVal_1300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1297 (_ BitVec 32)) (v_ArrVal_1306 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1296 (_ BitVec 32))) (= (select (let ((.cse3 (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~link_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|)) (.cse4 (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~term_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|)) (.cse5 (bvadd (_ bv8 32) |c_ULTIMATE.start_create_item_~item~0#1.offset|))) (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse3 |c_ULTIMATE.start_create_item_#t~mem13#1.offset|) .cse4 v_ArrVal_1291) .cse5 v_ArrVal_1297)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1300) |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1306) (let ((.cse7 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (select (select (let ((.cse6 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse3 |c_ULTIMATE.start_create_item_#t~mem13#1.base|) .cse4 v_ArrVal_1290) .cse5 v_ArrVal_1296)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1298))) (store .cse6 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse6 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse7 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1305))) |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse7))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32)))) is different from false [2022-07-14 06:20:06,827 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1305 (_ BitVec 32)) (v_ArrVal_1291 (_ BitVec 32)) (v_ArrVal_1290 (_ BitVec 32)) (v_ArrVal_1300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1297 (_ BitVec 32)) (v_ArrVal_1306 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1296 (_ BitVec 32))) (= (select (let ((.cse0 (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~link_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|)) (.cse1 (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~term_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_create_item_~item~0#1.offset|))) (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset|)) .cse1 v_ArrVal_1291) .cse2 v_ArrVal_1297)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1300) |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1306) (let ((.cse4 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset|)) .cse1 v_ArrVal_1290) .cse2 v_ArrVal_1296)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1298))) (store .cse3 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse3 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse4 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1305))) |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse4))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32))) (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1305 (_ BitVec 32)) (v_ArrVal_1290 (_ BitVec 32)) (v_ArrVal_1296 (_ BitVec 32))) (= (select (let ((.cse6 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse5 (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~link_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset|)) (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~term_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|) v_ArrVal_1290) (bvadd (_ bv8 32) |c_ULTIMATE.start_create_item_~item~0#1.offset|) v_ArrVal_1296)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1298))) (store .cse7 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse7 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse6 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1305))))) (select .cse5 (select (select .cse5 |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse6))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32)))) is different from false [2022-07-14 06:20:07,161 WARN L833 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1305 (_ BitVec 32)) (v_ArrVal_1291 (_ BitVec 32)) (v_ArrVal_1290 (_ BitVec 32)) (v_ArrVal_1300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1297 (_ BitVec 32)) (v_ArrVal_1306 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1296 (_ BitVec 32))) (= (select (let ((.cse0 (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~link_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|)) (.cse1 (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~term_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_create_item_~item~0#1.offset|))) (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset|)) .cse1 v_ArrVal_1291) .cse2 v_ArrVal_1297)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1300) |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1306) (let ((.cse4 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset|)) .cse1 v_ArrVal_1290) .cse2 v_ArrVal_1296)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1298))) (store .cse3 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse3 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse4 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1305))) |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse4))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32))) (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1305 (_ BitVec 32)) (v_ArrVal_1290 (_ BitVec 32)) (v_ArrVal_1296 (_ BitVec 32))) (= (select (let ((.cse6 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse5 (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~link_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset|)) (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~term_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|) v_ArrVal_1290) (bvadd (_ bv8 32) |c_ULTIMATE.start_create_item_~item~0#1.offset|) v_ArrVal_1296)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1298))) (store .cse7 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse7 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse6 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1305))))) (select .cse5 (select (select .cse5 |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse6))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32)))) |c_ULTIMATE.start_create_item_#t~short10#1|) is different from false [2022-07-14 06:20:07,386 WARN L833 $PredicateComparison]: unable to prove that (or (not (= |c_ULTIMATE.start_create_item_#t~mem8#1.base| (_ bv0 32))) (and (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1305 (_ BitVec 32)) (v_ArrVal_1291 (_ BitVec 32)) (v_ArrVal_1290 (_ BitVec 32)) (v_ArrVal_1300 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1297 (_ BitVec 32)) (v_ArrVal_1306 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1296 (_ BitVec 32))) (= (select (let ((.cse0 (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~link_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|)) (.cse1 (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~term_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|)) (.cse2 (bvadd (_ bv8 32) |c_ULTIMATE.start_create_item_~item~0#1.offset|))) (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset|)) .cse1 v_ArrVal_1291) .cse2 v_ArrVal_1297)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1300) |c_ULTIMATE.start_append_one_~list#1.base| v_ArrVal_1306) (let ((.cse4 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (select (select (let ((.cse3 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset|)) .cse1 v_ArrVal_1290) .cse2 v_ArrVal_1296)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1298))) (store .cse3 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse3 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse4 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1305))) |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse4))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32))) (forall ((v_ArrVal_1298 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1305 (_ BitVec 32)) (v_ArrVal_1290 (_ BitVec 32)) (v_ArrVal_1296 (_ BitVec 32))) (= (select (let ((.cse6 (bvmul (_ bv4 32) ~unnamed1~0~LIST_BEG))) (let ((.cse5 (let ((.cse7 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base| (store (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~link_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_create_item_~cursor#1.base|) |c_ULTIMATE.start_create_item_~cursor#1.offset|)) (bvadd (bvmul (_ bv4 32) |c_ULTIMATE.start_create_item_~term_field~0#1|) |c_ULTIMATE.start_create_item_~item~0#1.offset|) v_ArrVal_1290) (bvadd (_ bv8 32) |c_ULTIMATE.start_create_item_~item~0#1.offset|) v_ArrVal_1296)) |c_ULTIMATE.start_create_item_~cursor#1.base| v_ArrVal_1298))) (store .cse7 |c_ULTIMATE.start_append_one_~list#1.base| (store (store (select .cse7 |c_ULTIMATE.start_append_one_~list#1.base|) (bvadd .cse6 |c_ULTIMATE.start_append_one_~list#1.offset|) |c_ULTIMATE.start_create_item_~item~0#1.base|) (bvadd |c_ULTIMATE.start_append_one_~list#1.offset| (bvmul (_ bv4 32) ~unnamed1~0~LIST_END)) v_ArrVal_1305))))) (select .cse5 (select (select .cse5 |c_~#list~0.base|) (bvadd |c_~#list~0.offset| .cse6))))) (bvmul (_ bv4 32) ~unnamed2~0~ITEM_NEXT)) (_ bv0 32)))) (not (= (_ bv0 32) |c_ULTIMATE.start_create_item_#t~mem8#1.offset|))) is different from false [2022-07-14 06:20:15,896 WARN L233 SmtUtils]: Spent 8.46s on a formula simplification. DAG size of input: 104 DAG size of output: 69 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-07-14 06:20:15,897 INFO L356 Elim1Store]: treesize reduction 386, result has 31.7 percent of original size [2022-07-14 06:20:15,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 321 treesize of output 336 [2022-07-14 06:20:18,454 INFO L356 Elim1Store]: treesize reduction 193, result has 31.8 percent of original size [2022-07-14 06:20:18,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 344 treesize of output 401 [2022-07-14 06:20:19,093 INFO L356 Elim1Store]: treesize reduction 60, result has 49.2 percent of original size [2022-07-14 06:20:19,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 752 treesize of output 780 [2022-07-14 06:20:20,302 INFO L356 Elim1Store]: treesize reduction 138, result has 68.9 percent of original size [2022-07-14 06:20:20,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 5800 treesize of output 5485 [2022-07-14 06:20:23,213 INFO L356 Elim1Store]: treesize reduction 154, result has 62.2 percent of original size [2022-07-14 06:20:23,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 10 new quantified variables, introduced 28 case distinctions, treesize of input 7824 treesize of output 7846 [2022-07-14 06:20:23,382 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4950 treesize of output 4694 [2022-07-14 06:20:23,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4694 treesize of output 4566