./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.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-ext/dll_extends_pointer.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 b19ed65fc9d9f8e19f4d644b05d37e3da28cb107a90eedb15c652c094a7f23f1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:20:30,371 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:20:30,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:20:30,424 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:20:30,425 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:20:30,426 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:20:30,429 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:20:30,431 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:20:30,433 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:20:30,439 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:20:30,440 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:20:30,442 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:20:30,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:20:30,444 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:20:30,445 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:20:30,449 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:20:30,450 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:20:30,452 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:20:30,454 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:20:30,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:20:30,461 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:20:30,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:20:30,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:20:30,463 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:20:30,465 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:20:30,469 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:20:30,469 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:20:30,469 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:20:30,470 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:20:30,471 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:20:30,472 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:20:30,472 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:20:30,474 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:20:30,474 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:20:30,475 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:20:30,476 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:20:30,476 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:20:30,476 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:20:30,477 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:20:30,477 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:20:30,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:20:30,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:20:30,481 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:20:30,520 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:20:30,521 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:20:30,521 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:20:30,521 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:20:30,522 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:20:30,523 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:20:30,523 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:20:30,523 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:20:30,523 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:20:30,524 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:20:30,525 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:20:30,525 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:20:30,525 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:20:30,525 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:20:30,525 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:20:30,526 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:20:30,526 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:20:30,526 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:20:30,526 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:20:30,526 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:20:30,527 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:20:30,527 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:20:30,527 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:20:30,527 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:20:30,527 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:20:30,528 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:20:30,528 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:20:30,528 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:20:30,528 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 06:20:30,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 06:20:30,529 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 -> b19ed65fc9d9f8e19f4d644b05d37e3da28cb107a90eedb15c652c094a7f23f1 [2022-07-14 06:20:30,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:20:30,841 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:20:30,843 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:20:30,844 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:20:30,844 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:20:30,846 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2022-07-14 06:20:30,897 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/659cbeaae/5b4996e9ea7a49fe8af9181b9b82639d/FLAGa462e6141 [2022-07-14 06:20:31,461 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:20:31,465 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2022-07-14 06:20:31,493 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/659cbeaae/5b4996e9ea7a49fe8af9181b9b82639d/FLAGa462e6141 [2022-07-14 06:20:31,725 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/659cbeaae/5b4996e9ea7a49fe8af9181b9b82639d [2022-07-14 06:20:31,727 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:20:31,729 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:20:31,731 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:20:31,732 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:20:31,735 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:20:31,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:20:31" (1/1) ... [2022-07-14 06:20:31,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dd7f6c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:20:31, skipping insertion in model container [2022-07-14 06:20:31,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:20:31" (1/1) ... [2022-07-14 06:20:31,744 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:20:31,787 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:20:32,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:20:32,097 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:20:32,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:20:32,157 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:20:32,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:20:32 WrapperNode [2022-07-14 06:20:32,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:20:32,159 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:20:32,159 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:20:32,159 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:20:32,169 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:20:32" (1/1) ... [2022-07-14 06:20:32,190 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:20:32" (1/1) ... [2022-07-14 06:20:32,208 INFO L137 Inliner]: procedures = 123, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 63 [2022-07-14 06:20:32,209 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:20:32,209 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:20:32,210 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:20:32,210 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:20:32,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:20:32" (1/1) ... [2022-07-14 06:20:32,217 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:20:32" (1/1) ... [2022-07-14 06:20:32,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:20:32" (1/1) ... [2022-07-14 06:20:32,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:20:32" (1/1) ... [2022-07-14 06:20:32,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:20:32" (1/1) ... [2022-07-14 06:20:32,250 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:20:32" (1/1) ... [2022-07-14 06:20:32,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:20:32" (1/1) ... [2022-07-14 06:20:32,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:20:32,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:20:32,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:20:32,255 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:20:32,263 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:20:32" (1/1) ... [2022-07-14 06:20:32,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:20:32,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:20:32,296 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:20:32,299 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:20:32,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:20:32,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:20:32,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:20:32,334 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:20:32,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:20:32,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 06:20:32,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:20:32,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:20:32,476 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:20:32,477 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:20:32,800 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:20:32,805 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:20:32,806 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 06:20:32,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:20:32 BoogieIcfgContainer [2022-07-14 06:20:32,808 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:20:32,809 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:20:32,810 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:20:32,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:20:32,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:20:31" (1/3) ... [2022-07-14 06:20:32,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721f653d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:20:32, skipping insertion in model container [2022-07-14 06:20:32,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:20:32" (2/3) ... [2022-07-14 06:20:32,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721f653d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:20:32, skipping insertion in model container [2022-07-14 06:20:32,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:20:32" (3/3) ... [2022-07-14 06:20:32,834 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer.i [2022-07-14 06:20:32,848 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:20:32,848 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2022-07-14 06:20:32,900 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:20:32,908 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@30541bf5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@78c611f0 [2022-07-14 06:20:32,908 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-07-14 06:20:32,912 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 31 states have (on average 2.064516129032258) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 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:20:32,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:20:32,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:20:32,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:20:32,923 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:20:32,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:20:32,929 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-14 06:20:32,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:20:32,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158923047] [2022-07-14 06:20:32,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:32,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:20:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:33,086 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:20:33,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:20:33,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158923047] [2022-07-14 06:20:33,088 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158923047] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:20:33,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:20:33,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:20:33,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564030999] [2022-07-14 06:20:33,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:20:33,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:20:33,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:20:33,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:20:33,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:20:33,127 INFO L87 Difference]: Start difference. First operand has 59 states, 31 states have (on average 2.064516129032258) internal successors, (64), 58 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:20:33,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:20:33,251 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2022-07-14 06:20:33,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:20:33,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-14 06:20:33,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:20:33,265 INFO L225 Difference]: With dead ends: 63 [2022-07-14 06:20:33,266 INFO L226 Difference]: Without dead ends: 59 [2022-07-14 06:20:33,268 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:20:33,273 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 40 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:20:33,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 33 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:20:33,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-14 06:20:33,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2022-07-14 06:20:33,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 52 states have internal predecessors, (58), 0 states have call successors, (0), 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:20:33,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-07-14 06:20:33,312 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 3 [2022-07-14 06:20:33,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:20:33,312 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-07-14 06:20:33,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:20:33,313 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-07-14 06:20:33,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:20:33,313 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:20:33,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:20:33,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 06:20:33,314 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:20:33,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:20:33,315 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-14 06:20:33,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:20:33,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992345996] [2022-07-14 06:20:33,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:33,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:20:33,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:33,404 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:20:33,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:20:33,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992345996] [2022-07-14 06:20:33,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992345996] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:20:33,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:20:33,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:20:33,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115504877] [2022-07-14 06:20:33,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:20:33,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:20:33,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:20:33,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:20:33,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:20:33,412 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:20:33,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:20:33,515 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2022-07-14 06:20:33,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:20:33,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-14 06:20:33,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:20:33,518 INFO L225 Difference]: With dead ends: 55 [2022-07-14 06:20:33,518 INFO L226 Difference]: Without dead ends: 55 [2022-07-14 06:20:33,521 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:20:33,523 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 17 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:20:33,523 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 51 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:20:33,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-14 06:20:33,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 48. [2022-07-14 06:20:33,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.606060606060606) internal successors, (53), 47 states have internal predecessors, (53), 0 states have call successors, (0), 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:20:33,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-07-14 06:20:33,532 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 3 [2022-07-14 06:20:33,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:20:33,532 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-07-14 06:20:33,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:20:33,532 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-07-14 06:20:33,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 06:20:33,533 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:20:33,534 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:20:33,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 06:20:33,537 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:20:33,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:20:33,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1115897518, now seen corresponding path program 1 times [2022-07-14 06:20:33,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:20:33,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778562284] [2022-07-14 06:20:33,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:33,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:20:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:33,640 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:20:33,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:20:33,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778562284] [2022-07-14 06:20:33,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778562284] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:20:33,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:20:33,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:20:33,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603051101] [2022-07-14 06:20:33,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:20:33,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:20:33,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:20:33,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:20:33,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:20:33,644 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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:20:33,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:20:33,717 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2022-07-14 06:20:33,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:20:33,718 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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:20:33,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:20:33,719 INFO L225 Difference]: With dead ends: 58 [2022-07-14 06:20:33,719 INFO L226 Difference]: Without dead ends: 58 [2022-07-14 06:20:33,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:20:33,721 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 47 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:20:33,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 31 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:20:33,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-14 06:20:33,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2022-07-14 06:20:33,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.5945945945945945) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 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:20:33,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-07-14 06:20:33,726 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 10 [2022-07-14 06:20:33,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:20:33,727 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-07-14 06:20:33,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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:20:33,727 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-07-14 06:20:33,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 06:20:33,728 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:20:33,728 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:20:33,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 06:20:33,728 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:20:33,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:20:33,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1115897519, now seen corresponding path program 1 times [2022-07-14 06:20:33,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:20:33,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068395726] [2022-07-14 06:20:33,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:33,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:20:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:33,832 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:20:33,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:20:33,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068395726] [2022-07-14 06:20:33,833 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068395726] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:20:33,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:20:33,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:20:33,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578859588] [2022-07-14 06:20:33,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:20:33,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:20:33,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:20:33,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:20:33,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:20:33,836 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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:20:33,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:20:33,939 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2022-07-14 06:20:33,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:20:33,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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:20:33,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:20:33,945 INFO L225 Difference]: With dead ends: 87 [2022-07-14 06:20:33,945 INFO L226 Difference]: Without dead ends: 87 [2022-07-14 06:20:33,946 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:20:33,952 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 47 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:20:33,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 53 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:20:33,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-14 06:20:33,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 67. [2022-07-14 06:20:33,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.528301886792453) internal successors, (81), 66 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:20:33,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 81 transitions. [2022-07-14 06:20:33,958 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 81 transitions. Word has length 10 [2022-07-14 06:20:33,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:20:33,958 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 81 transitions. [2022-07-14 06:20:33,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 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:20:33,959 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2022-07-14 06:20:33,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 06:20:33,959 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:20:33,960 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:20:33,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 06:20:33,960 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:20:33,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:20:33,961 INFO L85 PathProgramCache]: Analyzing trace with hash 233083786, now seen corresponding path program 1 times [2022-07-14 06:20:33,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:20:33,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338036546] [2022-07-14 06:20:33,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:33,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:20:33,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:34,005 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:20:34,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:20:34,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338036546] [2022-07-14 06:20:34,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338036546] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:20:34,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:20:34,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:20:34,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643440523] [2022-07-14 06:20:34,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:20:34,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:20:34,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:20:34,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:20:34,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:20:34,009 INFO L87 Difference]: Start difference. First operand 67 states and 81 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:20:34,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:20:34,080 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2022-07-14 06:20:34,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:20:34,082 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:20:34,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:20:34,083 INFO L225 Difference]: With dead ends: 90 [2022-07-14 06:20:34,083 INFO L226 Difference]: Without dead ends: 90 [2022-07-14 06:20:34,083 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:20:34,085 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 50 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:20:34,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 58 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:20:34,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-14 06:20:34,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2022-07-14 06:20:34,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.490566037735849) internal successors, (79), 66 states have internal predecessors, (79), 0 states have call successors, (0), 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:20:34,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-07-14 06:20:34,103 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 11 [2022-07-14 06:20:34,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:20:34,103 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-07-14 06:20:34,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:20:34,107 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-07-14 06:20:34,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 06:20:34,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:20:34,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:20:34,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 06:20:34,108 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:20:34,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:20:34,109 INFO L85 PathProgramCache]: Analyzing trace with hash 683852015, now seen corresponding path program 1 times [2022-07-14 06:20:34,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:20:34,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270085018] [2022-07-14 06:20:34,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:34,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:20:34,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:34,229 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:20:34,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:20:34,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270085018] [2022-07-14 06:20:34,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270085018] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:20:34,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:20:34,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:20:34,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765099173] [2022-07-14 06:20:34,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:20:34,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:20:34,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:20:34,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:20:34,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:20:34,232 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:20:34,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:20:34,280 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2022-07-14 06:20:34,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:20:34,281 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-14 06:20:34,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:20:34,281 INFO L225 Difference]: With dead ends: 66 [2022-07-14 06:20:34,281 INFO L226 Difference]: Without dead ends: 66 [2022-07-14 06:20:34,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:20:34,284 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 27 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:20:34,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 45 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:20:34,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-14 06:20:34,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-07-14 06:20:34,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 53 states have (on average 1.471698113207547) internal successors, (78), 65 states have internal predecessors, (78), 0 states have call successors, (0), 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:20:34,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 78 transitions. [2022-07-14 06:20:34,295 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 78 transitions. Word has length 13 [2022-07-14 06:20:34,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:20:34,296 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 78 transitions. [2022-07-14 06:20:34,296 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), 0 states have call successors, (0), 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:20:34,296 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 78 transitions. [2022-07-14 06:20:34,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 06:20:34,297 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:20:34,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:20:34,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 06:20:34,297 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:20:34,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:20:34,298 INFO L85 PathProgramCache]: Analyzing trace with hash -833158411, now seen corresponding path program 1 times [2022-07-14 06:20:34,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:20:34,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317538382] [2022-07-14 06:20:34,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:34,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:20:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:34,435 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:20:34,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:20:34,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317538382] [2022-07-14 06:20:34,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317538382] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:20:34,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:20:34,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:20:34,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [440643941] [2022-07-14 06:20:34,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:20:34,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:20:34,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:20:34,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:20:34,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:20:34,438 INFO L87 Difference]: Start difference. First operand 66 states and 78 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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:20:34,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:20:34,573 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2022-07-14 06:20:34,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:20:34,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-07-14 06:20:34,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:20:34,574 INFO L225 Difference]: With dead ends: 73 [2022-07-14 06:20:34,574 INFO L226 Difference]: Without dead ends: 73 [2022-07-14 06:20:34,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:20:34,576 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 53 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:20:34,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 84 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:20:34,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-14 06:20:34,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2022-07-14 06:20:34,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 48 states have (on average 1.4375) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:20:34,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2022-07-14 06:20:34,579 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 15 [2022-07-14 06:20:34,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:20:34,579 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2022-07-14 06:20:34,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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:20:34,579 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2022-07-14 06:20:34,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 06:20:34,580 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:20:34,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:20:34,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 06:20:34,581 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:20:34,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:20:34,581 INFO L85 PathProgramCache]: Analyzing trace with hash -833147426, now seen corresponding path program 1 times [2022-07-14 06:20:34,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:20:34,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517357018] [2022-07-14 06:20:34,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:34,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:20:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:34,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:20:34,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:20:34,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517357018] [2022-07-14 06:20:34,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517357018] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:20:34,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:20:34,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:20:34,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101442483] [2022-07-14 06:20:34,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:20:34,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:20:34,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:20:34,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:20:34,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:20:34,623 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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:20:34,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:20:34,689 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-07-14 06:20:34,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:20:34,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-07-14 06:20:34,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:20:34,690 INFO L225 Difference]: With dead ends: 77 [2022-07-14 06:20:34,691 INFO L226 Difference]: Without dead ends: 77 [2022-07-14 06:20:34,691 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:20:34,692 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 41 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 60 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.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:20:34,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 60 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:20:34,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-14 06:20:34,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 70. [2022-07-14 06:20:34,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 57 states have (on average 1.4912280701754386) internal successors, (85), 69 states have internal predecessors, (85), 0 states have call successors, (0), 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:20:34,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2022-07-14 06:20:34,695 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 15 [2022-07-14 06:20:34,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:20:34,695 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2022-07-14 06:20:34,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 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:20:34,696 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-07-14 06:20:34,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 06:20:34,696 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:20:34,697 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:20:34,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 06:20:34,697 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:20:34,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:20:34,698 INFO L85 PathProgramCache]: Analyzing trace with hash 321145941, now seen corresponding path program 1 times [2022-07-14 06:20:34,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:20:34,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691437338] [2022-07-14 06:20:34,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:34,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:20:34,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:34,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:20:34,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:20:34,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691437338] [2022-07-14 06:20:34,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691437338] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:20:34,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200234068] [2022-07-14 06:20:34,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:34,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:20:34,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:20:34,791 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:20:34,800 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:20:34,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:34,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-14 06:20:34,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:20:34,986 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 11 treesize of output 7 [2022-07-14 06:20:34,991 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 11 treesize of output 7 [2022-07-14 06:20:35,051 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:35,052 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 21 treesize of output 20 [2022-07-14 06:20:35,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:35,060 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 21 treesize of output 20 [2022-07-14 06:20:35,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:35,078 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 21 treesize of output 20 [2022-07-14 06:20:35,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:35,085 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 21 treesize of output 20 [2022-07-14 06:20:35,137 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:35,138 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 15 treesize of output 7 [2022-07-14 06:20:35,144 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:35,146 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:20:35,147 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 15 treesize of output 10 [2022-07-14 06:20:35,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:20:35,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:20:40,600 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 20 treesize of output 18 [2022-07-14 06:20:40,604 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:40,605 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:40,607 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 14 treesize of output 12 [2022-07-14 06:20:40,613 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 20 treesize of output 18 [2022-07-14 06:20:40,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:40,616 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:40,617 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:40,631 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:20:40,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200234068] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:20:40,631 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:20:40,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 9] total 14 [2022-07-14 06:20:40,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491473452] [2022-07-14 06:20:40,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:20:40,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 06:20:40,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:20:40,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 06:20:40,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=142, Unknown=4, NotChecked=0, Total=182 [2022-07-14 06:20:40,633 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 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:20:40,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:20:40,888 INFO L93 Difference]: Finished difference Result 85 states and 100 transitions. [2022-07-14 06:20:40,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:20:40,889 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 06:20:40,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:20:40,891 INFO L225 Difference]: With dead ends: 85 [2022-07-14 06:20:40,891 INFO L226 Difference]: Without dead ends: 85 [2022-07-14 06:20:40,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=104, Invalid=312, Unknown=4, NotChecked=0, Total=420 [2022-07-14 06:20:40,892 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 108 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:20:40,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 223 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 150 Invalid, 0 Unknown, 62 Unchecked, 0.1s Time] [2022-07-14 06:20:40,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-14 06:20:40,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2022-07-14 06:20:40,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 68 states have (on average 1.4264705882352942) internal successors, (97), 80 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:20:40,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 97 transitions. [2022-07-14 06:20:40,895 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 97 transitions. Word has length 18 [2022-07-14 06:20:40,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:20:40,895 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 97 transitions. [2022-07-14 06:20:40,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5714285714285716) internal successors, (36), 14 states have internal predecessors, (36), 0 states have call successors, (0), 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:20:40,896 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 97 transitions. [2022-07-14 06:20:40,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 06:20:40,896 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:20:40,896 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:20:40,927 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:20:41,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:20:41,106 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:20:41,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:20:41,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1365588675, now seen corresponding path program 1 times [2022-07-14 06:20:41,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:20:41,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771456302] [2022-07-14 06:20:41,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:41,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:20:41,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:41,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:20:41,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:20:41,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771456302] [2022-07-14 06:20:41,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771456302] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:20:41,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2084020068] [2022-07-14 06:20:41,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:41,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:20:41,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:20:41,172 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:20:41,223 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:20:41,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:41,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 06:20:41,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:20:41,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-14 06:20:41,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:20:41,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:20:41,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:20:41,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2084020068] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:20:41,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:20:41,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-14 06:20:41,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237515134] [2022-07-14 06:20:41,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:20:41,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:20:41,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:20:41,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:20:41,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:20:41,361 INFO L87 Difference]: Start difference. First operand 81 states and 97 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:20:41,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:20:41,471 INFO L93 Difference]: Finished difference Result 83 states and 98 transitions. [2022-07-14 06:20:41,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:20:41,472 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-14 06:20:41,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:20:41,473 INFO L225 Difference]: With dead ends: 83 [2022-07-14 06:20:41,473 INFO L226 Difference]: Without dead ends: 72 [2022-07-14 06:20:41,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:20:41,474 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 6 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:20:41,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 109 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 90 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-07-14 06:20:41,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-14 06:20:41,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-07-14 06:20:41,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 71 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:20:41,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2022-07-14 06:20:41,477 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 19 [2022-07-14 06:20:41,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:20:41,477 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2022-07-14 06:20:41,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:20:41,477 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2022-07-14 06:20:41,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 06:20:41,478 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:20:41,478 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:20:41,505 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:20:41,695 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,SelfDestructingSolverStorable9 [2022-07-14 06:20:41,696 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:20:41,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:20:41,696 INFO L85 PathProgramCache]: Analyzing trace with hash -190050214, now seen corresponding path program 1 times [2022-07-14 06:20:41,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:20:41,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996499172] [2022-07-14 06:20:41,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:41,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:20:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:41,756 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:20:41,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:20:41,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996499172] [2022-07-14 06:20:41,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996499172] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:20:41,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:20:41,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:20:41,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520099852] [2022-07-14 06:20:41,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:20:41,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:20:41,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:20:41,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:20:41,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:20:41,758 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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:20:41,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:20:41,834 INFO L93 Difference]: Finished difference Result 81 states and 88 transitions. [2022-07-14 06:20:41,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:20:41,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-07-14 06:20:41,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:20:41,836 INFO L225 Difference]: With dead ends: 81 [2022-07-14 06:20:41,836 INFO L226 Difference]: Without dead ends: 81 [2022-07-14 06:20:41,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:20:41,837 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 46 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:20:41,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 59 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:20:41,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-14 06:20:41,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 68. [2022-07-14 06:20:41,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.3928571428571428) internal successors, (78), 67 states have internal predecessors, (78), 0 states have call successors, (0), 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:20:41,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 78 transitions. [2022-07-14 06:20:41,839 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 78 transitions. Word has length 19 [2022-07-14 06:20:41,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:20:41,839 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 78 transitions. [2022-07-14 06:20:41,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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:20:41,840 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-07-14 06:20:41,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 06:20:41,840 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:20:41,841 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] [2022-07-14 06:20:41,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 06:20:41,841 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:20:41,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:20:41,841 INFO L85 PathProgramCache]: Analyzing trace with hash -36338646, now seen corresponding path program 1 times [2022-07-14 06:20:41,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:20:41,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355836346] [2022-07-14 06:20:41,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:41,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:20:41,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:41,927 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:20:41,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:20:41,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355836346] [2022-07-14 06:20:41,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355836346] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:20:41,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:20:41,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:20:41,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135036976] [2022-07-14 06:20:41,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:20:41,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:20:41,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:20:41,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:20:41,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:20:41,930 INFO L87 Difference]: Start difference. First operand 68 states and 78 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:20:42,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:20:42,058 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2022-07-14 06:20:42,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 06:20:42,058 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-14 06:20:42,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:20:42,059 INFO L225 Difference]: With dead ends: 87 [2022-07-14 06:20:42,059 INFO L226 Difference]: Without dead ends: 87 [2022-07-14 06:20:42,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:20:42,060 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 59 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:20:42,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 151 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:20:42,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-14 06:20:42,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 68. [2022-07-14 06:20:42,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.375) internal successors, (77), 67 states have internal predecessors, (77), 0 states have call successors, (0), 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:20:42,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 77 transitions. [2022-07-14 06:20:42,063 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 77 transitions. Word has length 24 [2022-07-14 06:20:42,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:20:42,063 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 77 transitions. [2022-07-14 06:20:42,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:20:42,064 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 77 transitions. [2022-07-14 06:20:42,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:20:42,064 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:20:42,064 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] [2022-07-14 06:20:42,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 06:20:42,065 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:20:42,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:20:42,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1126497925, now seen corresponding path program 1 times [2022-07-14 06:20:42,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:20:42,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416355682] [2022-07-14 06:20:42,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:42,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:20:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:42,151 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:20:42,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:20:42,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416355682] [2022-07-14 06:20:42,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416355682] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:20:42,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:20:42,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:20:42,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561443471] [2022-07-14 06:20:42,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:20:42,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:20:42,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:20:42,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:20:42,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:20:42,154 INFO L87 Difference]: Start difference. First operand 68 states and 77 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:20:42,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:20:42,326 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2022-07-14 06:20:42,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 06:20:42,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-14 06:20:42,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:20:42,327 INFO L225 Difference]: With dead ends: 86 [2022-07-14 06:20:42,327 INFO L226 Difference]: Without dead ends: 86 [2022-07-14 06:20:42,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:20:42,328 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 50 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:20:42,328 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 125 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:20:42,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-14 06:20:42,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 68. [2022-07-14 06:20:42,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:20:42,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-07-14 06:20:42,330 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 25 [2022-07-14 06:20:42,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:20:42,331 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-07-14 06:20:42,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 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:20:42,331 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-07-14 06:20:42,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 06:20:42,331 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:20:42,331 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] [2022-07-14 06:20:42,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 06:20:42,332 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:20:42,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:20:42,332 INFO L85 PathProgramCache]: Analyzing trace with hash -561697204, now seen corresponding path program 1 times [2022-07-14 06:20:42,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:20:42,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780688449] [2022-07-14 06:20:42,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:42,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:20:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:42,452 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:20:42,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:20:42,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780688449] [2022-07-14 06:20:42,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780688449] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:20:42,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:20:42,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:20:42,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191781534] [2022-07-14 06:20:42,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:20:42,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:20:42,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:20:42,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:20:42,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:20:42,456 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:20:42,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:20:42,587 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-07-14 06:20:42,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:20:42,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-14 06:20:42,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:20:42,588 INFO L225 Difference]: With dead ends: 69 [2022-07-14 06:20:42,588 INFO L226 Difference]: Without dead ends: 69 [2022-07-14 06:20:42,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:20:42,589 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 36 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:20:42,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 74 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:20:42,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-14 06:20:42,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-07-14 06:20:42,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 56 states have (on average 1.3392857142857142) internal successors, (75), 67 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:20:42,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 75 transitions. [2022-07-14 06:20:42,591 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 75 transitions. Word has length 26 [2022-07-14 06:20:42,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:20:42,591 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 75 transitions. [2022-07-14 06:20:42,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:20:42,591 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 75 transitions. [2022-07-14 06:20:42,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 06:20:42,592 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:20:42,592 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] [2022-07-14 06:20:42,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 06:20:42,592 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:20:42,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:20:42,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1337846250, now seen corresponding path program 1 times [2022-07-14 06:20:42,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:20:42,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527219518] [2022-07-14 06:20:42,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:42,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:20:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:42,741 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:20:42,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:20:42,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527219518] [2022-07-14 06:20:42,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527219518] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:20:42,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1439921043] [2022-07-14 06:20:42,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:42,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:20:42,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:20:42,743 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:20:42,771 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:20:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:42,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-14 06:20:42,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:20:42,853 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:20:42,879 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:20:42,880 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:42,900 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 11 treesize of output 7 [2022-07-14 06:20:42,938 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:20:42,939 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 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-14 06:20:42,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:42,979 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 31 treesize of output 26 [2022-07-14 06:20:43,038 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:43,040 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:20:43,041 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 25 treesize of output 16 [2022-07-14 06:20:43,074 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:20:43,079 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:20:43,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:20:43,976 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:20:43,977 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 41 treesize of output 45 [2022-07-14 06:20:48,099 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:20:48,100 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 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-14 06:20:48,103 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 43 treesize of output 39 [2022-07-14 06:20:48,105 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:48,111 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:20:48,112 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 34 treesize of output 38 [2022-07-14 06:20:48,114 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:48,116 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 20 treesize of output 18 [2022-07-14 06:20:48,132 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 06:20:48,132 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 1 [2022-07-14 06:20:48,208 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:20:48,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1439921043] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:20:48,209 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:20:48,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 12] total 23 [2022-07-14 06:20:48,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781824132] [2022-07-14 06:20:48,209 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:20:48,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-14 06:20:48,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:20:48,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-14 06:20:48,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=480, Unknown=4, NotChecked=0, Total=552 [2022-07-14 06:20:48,211 INFO L87 Difference]: Start difference. First operand 68 states and 75 transitions. Second operand has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 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:20:48,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:20:48,760 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2022-07-14 06:20:48,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 06:20:48,760 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-14 06:20:48,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:20:48,761 INFO L225 Difference]: With dead ends: 95 [2022-07-14 06:20:48,761 INFO L226 Difference]: Without dead ends: 95 [2022-07-14 06:20:48,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=235, Invalid=951, Unknown=4, NotChecked=0, Total=1190 [2022-07-14 06:20:48,763 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 212 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:20:48,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 154 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 402 Invalid, 0 Unknown, 102 Unchecked, 0.3s Time] [2022-07-14 06:20:48,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-14 06:20:48,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 73. [2022-07-14 06:20:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.360655737704918) internal successors, (83), 72 states have internal predecessors, (83), 0 states have call successors, (0), 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:20:48,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 83 transitions. [2022-07-14 06:20:48,766 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 83 transitions. Word has length 26 [2022-07-14 06:20:48,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:20:48,766 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 83 transitions. [2022-07-14 06:20:48,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 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:20:48,766 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-07-14 06:20:48,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 06:20:48,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:20:48,767 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] [2022-07-14 06:20:48,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 06:20:48,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:20:48,984 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:20:48,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:20:48,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1337846251, now seen corresponding path program 1 times [2022-07-14 06:20:48,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:20:48,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274859306] [2022-07-14 06:20:48,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:48,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:20:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:49,144 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:20:49,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:20:49,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274859306] [2022-07-14 06:20:49,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274859306] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:20:49,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2033045626] [2022-07-14 06:20:49,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:49,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:20:49,145 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:20:49,146 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:20:49,148 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:20:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:49,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-14 06:20:49,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:20:49,251 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:20:49,256 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:20:49,296 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:20:49,297 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:49,305 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:20:49,328 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 11 treesize of output 7 [2022-07-14 06:20:49,335 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 11 treesize of output 7 [2022-07-14 06:20:49,371 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:20:49,372 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 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-14 06:20:49,376 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:20:49,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:49,420 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 21 treesize of output 20 [2022-07-14 06:20:49,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:49,425 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 31 treesize of output 26 [2022-07-14 06:20:49,490 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:49,491 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 13 [2022-07-14 06:20:49,496 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:49,498 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:20:49,519 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:20:49,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:20:50,737 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:20:50,738 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 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-14 06:20:50,741 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 36 [2022-07-14 06:20:50,744 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:50,746 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 7 [2022-07-14 06:20:50,748 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:50,754 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:20:50,754 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 21 [2022-07-14 06:20:50,775 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:20:50,775 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 48 [2022-07-14 06:20:50,781 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:20:50,782 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 40 [2022-07-14 06:20:50,784 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:50,786 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 37 treesize of output 33 [2022-07-14 06:20:50,788 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:50,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2022-07-14 06:20:50,793 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:50,794 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2022-07-14 06:20:50,797 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:50,798 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-14 06:20:51,016 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:51,023 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:20:51,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2033045626] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:20:51,024 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:20:51,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 23 [2022-07-14 06:20:51,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601268051] [2022-07-14 06:20:51,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:20:51,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-14 06:20:51,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:20:51,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-14 06:20:51,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=478, Unknown=3, NotChecked=0, Total=552 [2022-07-14 06:20:51,026 INFO L87 Difference]: Start difference. First operand 73 states and 83 transitions. Second operand has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 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:20:51,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:20:51,409 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2022-07-14 06:20:51,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 06:20:51,409 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-14 06:20:51,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:20:51,410 INFO L225 Difference]: With dead ends: 100 [2022-07-14 06:20:51,410 INFO L226 Difference]: Without dead ends: 100 [2022-07-14 06:20:51,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=134, Invalid=793, Unknown=3, NotChecked=0, Total=930 [2022-07-14 06:20:51,411 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 46 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 229 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:20:51,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 298 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 352 Invalid, 0 Unknown, 229 Unchecked, 0.2s Time] [2022-07-14 06:20:51,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-14 06:20:51,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2022-07-14 06:20:51,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.3164556962025316) internal successors, (104), 90 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:20:51,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 104 transitions. [2022-07-14 06:20:51,414 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 104 transitions. Word has length 26 [2022-07-14 06:20:51,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:20:51,414 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 104 transitions. [2022-07-14 06:20:51,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.782608695652174) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 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:20:51,415 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 104 transitions. [2022-07-14 06:20:51,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 06:20:51,415 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:20:51,415 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] [2022-07-14 06:20:51,443 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:20:51,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-14 06:20:51,631 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:20:51,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:20:51,632 INFO L85 PathProgramCache]: Analyzing trace with hash 94520065, now seen corresponding path program 1 times [2022-07-14 06:20:51,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:20:51,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025824625] [2022-07-14 06:20:51,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:51,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:20:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:51,806 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:20:51,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:20:51,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025824625] [2022-07-14 06:20:51,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025824625] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:20:51,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231160582] [2022-07-14 06:20:51,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:51,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:20:51,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:20:51,812 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:20:51,813 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:20:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:51,909 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-14 06:20:51,911 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:20:51,915 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:20:51,940 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:20:51,940 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:51,956 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 11 treesize of output 7 [2022-07-14 06:20:51,991 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:20:51,991 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 18 treesize of output 18 [2022-07-14 06:20:52,026 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:20:52,027 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:20:52,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231160582] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:20:52,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:20:52,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [11] total 18 [2022-07-14 06:20:52,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510993671] [2022-07-14 06:20:52,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:20:52,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:20:52,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:20:52,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:20:52,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2022-07-14 06:20:52,029 INFO L87 Difference]: Start difference. First operand 91 states and 104 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 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:20:52,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:20:52,229 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2022-07-14 06:20:52,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 06:20:52,229 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-14 06:20:52,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:20:52,230 INFO L225 Difference]: With dead ends: 100 [2022-07-14 06:20:52,230 INFO L226 Difference]: Without dead ends: 99 [2022-07-14 06:20:52,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2022-07-14 06:20:52,230 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 28 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:20:52,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 172 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:20:52,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-14 06:20:52,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 91. [2022-07-14 06:20:52,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 79 states have (on average 1.3037974683544304) internal successors, (103), 90 states have internal predecessors, (103), 0 states have call successors, (0), 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:20:52,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2022-07-14 06:20:52,232 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 27 [2022-07-14 06:20:52,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:20:52,233 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2022-07-14 06:20:52,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 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:20:52,233 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2022-07-14 06:20:52,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 06:20:52,233 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:20:52,233 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] [2022-07-14 06:20:52,259 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:20:52,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-14 06:20:52,444 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:20:52,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:20:52,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1476440114, now seen corresponding path program 1 times [2022-07-14 06:20:52,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:20:52,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347240730] [2022-07-14 06:20:52,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:52,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:20:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:52,547 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:20:52,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:20:52,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347240730] [2022-07-14 06:20:52,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347240730] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:20:52,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190291784] [2022-07-14 06:20:52,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:52,548 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:20:52,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:20:52,549 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:20:52,550 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:20:52,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:52,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-14 06:20:52,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:20:52,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:20:52,677 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:20:52,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-14 06:20:52,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:20:52,723 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:20:52,723 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 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-14 06:20:52,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:52,760 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 30 treesize of output 25 [2022-07-14 06:20:52,799 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:52,801 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:20:52,801 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 24 treesize of output 15 [2022-07-14 06:20:52,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:20:52,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:20:53,416 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_766 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_28| Int) (v_ArrVal_768 Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_28| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_28|)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_766) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_768) |v_ULTIMATE.start_main_~list~0#1.offset_28|) 0)))) is different from false [2022-07-14 06:20:53,425 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:20:53,426 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 1 case distinctions, treesize of input 24 treesize of output 25 [2022-07-14 06:20:53,433 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 43 treesize of output 39 [2022-07-14 06:20:53,435 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:53,441 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:20:53,441 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 34 treesize of output 38 [2022-07-14 06:20:53,447 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:53,449 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 20 treesize of output 18 [2022-07-14 06:20:53,604 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:20:53,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190291784] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:20:53,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:20:53,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 22 [2022-07-14 06:20:53,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877344915] [2022-07-14 06:20:53,605 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:20:53,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-14 06:20:53,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:20:53,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-14 06:20:53,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=357, Unknown=2, NotChecked=38, Total=462 [2022-07-14 06:20:53,606 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 0 states have call successors, (0), 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:20:54,002 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (forall ((v_ArrVal_766 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_28| Int) (v_ArrVal_768 Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_28| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_28|)) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_766) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_768) |v_ULTIMATE.start_main_~list~0#1.offset_28|) 0)))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) |c_ULTIMATE.start_main_~list~0#1.base|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (not (= |c_ULTIMATE.start_main_~list~0#1.base| 0)) (not (= |c_ULTIMATE.start_main_~y~0#1.base| 0))) is different from false [2022-07-14 06:20:54,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:20:54,502 INFO L93 Difference]: Finished difference Result 184 states and 207 transitions. [2022-07-14 06:20:54,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-14 06:20:54,503 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-14 06:20:54,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:20:54,503 INFO L225 Difference]: With dead ends: 184 [2022-07-14 06:20:54,504 INFO L226 Difference]: Without dead ends: 184 [2022-07-14 06:20:54,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=234, Invalid=1253, Unknown=3, NotChecked=150, Total=1640 [2022-07-14 06:20:54,505 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 106 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 566 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 1034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 424 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:20:54,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 454 Invalid, 1034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 566 Invalid, 0 Unknown, 424 Unchecked, 0.3s Time] [2022-07-14 06:20:54,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-14 06:20:54,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 131. [2022-07-14 06:20:54,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 119 states have (on average 1.2352941176470589) internal successors, (147), 130 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:20:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 147 transitions. [2022-07-14 06:20:54,508 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 147 transitions. Word has length 27 [2022-07-14 06:20:54,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:20:54,508 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 147 transitions. [2022-07-14 06:20:54,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.590909090909091) internal successors, (57), 22 states have internal predecessors, (57), 0 states have call successors, (0), 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:20:54,508 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 147 transitions. [2022-07-14 06:20:54,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-14 06:20:54,508 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:20:54,508 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] [2022-07-14 06:20:54,534 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-14 06:20:54,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-14 06:20:54,728 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:20:54,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:20:54,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1475025644, now seen corresponding path program 1 times [2022-07-14 06:20:54,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:20:54,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084010740] [2022-07-14 06:20:54,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:54,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:20:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:54,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:20:54,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:20:54,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084010740] [2022-07-14 06:20:54,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084010740] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:20:54,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2065967194] [2022-07-14 06:20:54,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:54,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:20:54,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:20:54,940 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:20:54,947 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:20:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:55,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-14 06:20:55,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:20:55,053 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:20:55,056 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:20:55,096 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:20:55,096 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 18 [2022-07-14 06:20:55,111 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:20:55,111 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:55,138 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 11 treesize of output 7 [2022-07-14 06:20:55,143 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 11 treesize of output 7 [2022-07-14 06:20:55,173 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:20:55,174 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 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-14 06:20:55,178 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:20:55,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:55,220 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 31 treesize of output 26 [2022-07-14 06:20:55,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:55,226 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 21 treesize of output 20 [2022-07-14 06:20:55,271 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:55,272 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 13 [2022-07-14 06:20:55,275 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:55,276 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:20:55,311 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:20:55,311 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:20:57,087 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_863 Int) (v_ArrVal_862 Int) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_33| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (let ((.cse0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_862) |v_ULTIMATE.start_main_~list~0#1.offset_33|))) (or (not (<= 0 .cse0)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_33|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_33| |c_ULTIMATE.start_main_~y~0#1.offset|)) (<= (+ 12 .cse0) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_858) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_863) |v_ULTIMATE.start_main_~list~0#1.offset_33|))))))) is different from false [2022-07-14 06:20:57,099 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:20:57,099 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 1 case distinctions, treesize of input 72 treesize of output 64 [2022-07-14 06:20:57,106 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:20:57,107 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 1 case distinctions, treesize of input 39 treesize of output 40 [2022-07-14 06:20:57,112 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 72 treesize of output 68 [2022-07-14 06:20:57,116 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 160 treesize of output 152 [2022-07-14 06:20:57,120 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:57,123 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 46 treesize of output 42 [2022-07-14 06:20:57,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:57,134 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:20:57,135 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 54 treesize of output 56 [2022-07-14 06:20:57,140 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:57,142 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 103 treesize of output 97 [2022-07-14 06:20:57,145 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:57,150 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:20:57,151 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 88 treesize of output 88 [2022-07-14 06:20:57,470 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:20:57,474 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:20:57,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2065967194] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:20:57,475 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:20:57,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 27 [2022-07-14 06:20:57,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581335535] [2022-07-14 06:20:57,475 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:20:57,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-14 06:20:57,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:20:57,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-14 06:20:57,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=613, Unknown=2, NotChecked=50, Total=756 [2022-07-14 06:20:57,479 INFO L87 Difference]: Start difference. First operand 131 states and 147 transitions. Second operand has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 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:20:58,237 WARN L833 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (<= 13 (select |c_#length| |c_ULTIMATE.start_main_~y~0#1.base|)) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (forall ((v_ArrVal_863 Int) (v_ArrVal_862 Int) (v_ArrVal_858 (Array Int Int)) (v_ArrVal_859 (Array Int Int)) (|v_ULTIMATE.start_main_~list~0#1.offset_33| Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (let ((.cse0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_859) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_862) |v_ULTIMATE.start_main_~list~0#1.offset_33|))) (or (not (<= 0 .cse0)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_33|)) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_33| |c_ULTIMATE.start_main_~y~0#1.offset|)) (<= (+ 12 .cse0) (select |c_#length| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_858) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_863) |v_ULTIMATE.start_main_~list~0#1.offset_33|))))))) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) |c_ULTIMATE.start_main_~list~0#1.base|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (<= 13 (select |c_#length| |c_ULTIMATE.start_main_~list~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1) (= (+ |c_ULTIMATE.start_main_~list~0#1.offset| (* (- 1) |c_ULTIMATE.start_main_~y~0#1.offset|)) 0)) is different from false [2022-07-14 06:20:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:20:58,857 INFO L93 Difference]: Finished difference Result 201 states and 224 transitions. [2022-07-14 06:20:58,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 06:20:58,858 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-14 06:20:58,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:20:58,859 INFO L225 Difference]: With dead ends: 201 [2022-07-14 06:20:58,859 INFO L226 Difference]: Without dead ends: 201 [2022-07-14 06:20:58,860 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=276, Invalid=1451, Unknown=3, NotChecked=162, Total=1892 [2022-07-14 06:20:58,860 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 204 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 307 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:20:58,861 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 259 Invalid, 830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 442 Invalid, 0 Unknown, 307 Unchecked, 0.3s Time] [2022-07-14 06:20:58,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-07-14 06:20:58,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 152. [2022-07-14 06:20:58,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 141 states have (on average 1.2411347517730495) internal successors, (175), 151 states have internal predecessors, (175), 0 states have call successors, (0), 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:20:58,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 175 transitions. [2022-07-14 06:20:58,865 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 175 transitions. Word has length 28 [2022-07-14 06:20:58,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:20:58,865 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 175 transitions. [2022-07-14 06:20:58,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.6296296296296298) internal successors, (71), 28 states have internal predecessors, (71), 0 states have call successors, (0), 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:20:58,866 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 175 transitions. [2022-07-14 06:20:58,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 06:20:58,866 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:20:58,866 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] [2022-07-14 06:20:58,887 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:20:59,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:20:59,076 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:20:59,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:20:59,076 INFO L85 PathProgramCache]: Analyzing trace with hash -328711838, now seen corresponding path program 1 times [2022-07-14 06:20:59,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:20:59,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757676169] [2022-07-14 06:20:59,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:59,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:20:59,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:59,233 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:20:59,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:20:59,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757676169] [2022-07-14 06:20:59,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757676169] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:20:59,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:20:59,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:20:59,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235325641] [2022-07-14 06:20:59,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:20:59,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:20:59,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:20:59,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:20:59,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:20:59,235 INFO L87 Difference]: Start difference. First operand 152 states and 175 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:20:59,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:20:59,429 INFO L93 Difference]: Finished difference Result 179 states and 202 transitions. [2022-07-14 06:20:59,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 06:20:59,429 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-14 06:20:59,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:20:59,430 INFO L225 Difference]: With dead ends: 179 [2022-07-14 06:20:59,430 INFO L226 Difference]: Without dead ends: 179 [2022-07-14 06:20:59,431 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:20:59,431 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 55 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:20:59,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 102 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:20:59,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-14 06:20:59,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 152. [2022-07-14 06:20:59,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 141 states have (on average 1.2340425531914894) internal successors, (174), 151 states have internal predecessors, (174), 0 states have call successors, (0), 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:20:59,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 174 transitions. [2022-07-14 06:20:59,435 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 174 transitions. Word has length 29 [2022-07-14 06:20:59,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:20:59,436 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 174 transitions. [2022-07-14 06:20:59,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 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:20:59,437 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 174 transitions. [2022-07-14 06:20:59,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-14 06:20:59,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:20:59,438 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] [2022-07-14 06:20:59,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 06:20:59,439 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:20:59,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:20:59,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1935506277, now seen corresponding path program 1 times [2022-07-14 06:20:59,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:20:59,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721255358] [2022-07-14 06:20:59,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:59,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:20:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:59,764 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:20:59,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:20:59,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721255358] [2022-07-14 06:20:59,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721255358] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:20:59,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976139593] [2022-07-14 06:20:59,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:20:59,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:20:59,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:20:59,768 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:20:59,792 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:20:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:20:59,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-14 06:20:59,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:20:59,890 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:20:59,913 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:20:59,914 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:59,919 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 11 treesize of output 7 [2022-07-14 06:20:59,933 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:20:59,933 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 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-14 06:20:59,964 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-07-14 06:20:59,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-07-14 06:20:59,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:20:59,986 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:21:00,148 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:00,149 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:21:00,166 INFO L356 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2022-07-14 06:21:00,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 41 [2022-07-14 06:21:00,259 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:21:00,260 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 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-14 06:21:00,317 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:21:00,322 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:21:00,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:21:10,996 INFO L356 Elim1Store]: treesize reduction 5, result has 89.8 percent of original size [2022-07-14 06:21:10,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 206 treesize of output 231 [2022-07-14 06:21:11,751 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_37| Int) (|v_ULTIMATE.start_main_#t~malloc8#1.base_12| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_37| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_37|)) (and (forall ((v_ArrVal_998 (Array Int Int))) (= |c_ULTIMATE.start_main_~list~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_998) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) |v_ULTIMATE.start_main_#t~malloc8#1.base_12|) |v_ULTIMATE.start_main_~list~0#1.offset_37|))) (forall ((v_ArrVal_998 (Array Int Int))) (let ((.cse1 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_998) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) |v_ULTIMATE.start_main_#t~malloc8#1.base_12|))) (let ((.cse0 (select .cse1 |v_ULTIMATE.start_main_~list~0#1.offset_37|))) (or (= .cse0 |v_ULTIMATE.start_main_#t~malloc8#1.base_12|) (and (forall ((v_prenex_3 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) |v_ULTIMATE.start_main_#t~malloc8#1.base_12|) |v_ULTIMATE.start_main_~list~0#1.offset_37|) |c_ULTIMATE.start_main_~y~0#1.base|))) (not (= (select .cse1 8) .cse0)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse0))))))) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_12|))) is different from false [2022-07-14 06:21:11,768 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:11,769 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 84 [2022-07-14 06:21:11,778 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 155 treesize of output 143 [2022-07-14 06:21:11,799 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:11,801 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 6 treesize of output 4 [2022-07-14 06:21:11,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:11,820 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:11,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 114 [2022-07-14 06:21:11,825 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:11,827 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 50 treesize of output 46 [2022-07-14 06:21:11,913 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 06:21:11,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 1 [2022-07-14 06:21:11,987 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:21:11,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976139593] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:21:11,988 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:21:11,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 17] total 37 [2022-07-14 06:21:11,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303060066] [2022-07-14 06:21:11,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:21:11,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-14 06:21:11,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:11,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-14 06:21:11,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1169, Unknown=6, NotChecked=70, Total=1406 [2022-07-14 06:21:11,990 INFO L87 Difference]: Start difference. First operand 152 states and 174 transitions. Second operand has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:12,515 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_37| Int) (|v_ULTIMATE.start_main_#t~malloc8#1.base_12| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_37| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_37|)) (and (forall ((v_ArrVal_998 (Array Int Int))) (= |c_ULTIMATE.start_main_~list~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_998) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) |v_ULTIMATE.start_main_#t~malloc8#1.base_12|) |v_ULTIMATE.start_main_~list~0#1.offset_37|))) (forall ((v_ArrVal_998 (Array Int Int))) (let ((.cse2 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_998) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) |v_ULTIMATE.start_main_#t~malloc8#1.base_12|))) (let ((.cse1 (select .cse2 |v_ULTIMATE.start_main_~list~0#1.offset_37|))) (or (= .cse1 |v_ULTIMATE.start_main_#t~malloc8#1.base_12|) (and (forall ((v_prenex_3 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) |v_ULTIMATE.start_main_#t~malloc8#1.base_12|) |v_ULTIMATE.start_main_~list~0#1.offset_37|) |c_ULTIMATE.start_main_~y~0#1.base|))) (not (= (select .cse2 8) .cse1)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1))))))) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_12|))))) is different from false [2022-07-14 06:21:13,217 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|)) (.cse1 (select .cse0 |c_ULTIMATE.start_main_~list~0#1.offset|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (not (= (select .cse0 8) .cse1)) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |c_#valid| .cse2) 1) (not (= |c_ULTIMATE.start_main_~list~0#1.base| .cse1)) (= .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (not (= .cse2 |c_ULTIMATE.start_main_~y~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1) (forall ((|v_ULTIMATE.start_main_~list~0#1.offset_37| Int) (|v_ULTIMATE.start_main_#t~malloc8#1.base_12| Int)) (or (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_37| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_37|)) (and (forall ((v_ArrVal_998 (Array Int Int))) (= |c_ULTIMATE.start_main_~list~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_998) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) |v_ULTIMATE.start_main_#t~malloc8#1.base_12|) |v_ULTIMATE.start_main_~list~0#1.offset_37|))) (forall ((v_ArrVal_998 (Array Int Int))) (let ((.cse4 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_998) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) |v_ULTIMATE.start_main_#t~malloc8#1.base_12|))) (let ((.cse3 (select .cse4 |v_ULTIMATE.start_main_~list~0#1.offset_37|))) (or (= .cse3 |v_ULTIMATE.start_main_#t~malloc8#1.base_12|) (and (forall ((v_prenex_3 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_3) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) |v_ULTIMATE.start_main_#t~malloc8#1.base_12|) |v_ULTIMATE.start_main_~list~0#1.offset_37|) |c_ULTIMATE.start_main_~y~0#1.base|))) (not (= (select .cse4 8) .cse3)) (= |c_ULTIMATE.start_main_~list~0#1.base| .cse3))))))) (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_12|))) (= (select |c_#valid| .cse1) 1)))) is different from false [2022-07-14 06:21:13,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:13,480 INFO L93 Difference]: Finished difference Result 170 states and 190 transitions. [2022-07-14 06:21:13,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-14 06:21:13,481 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-14 06:21:13,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:13,482 INFO L225 Difference]: With dead ends: 170 [2022-07-14 06:21:13,482 INFO L226 Difference]: Without dead ends: 170 [2022-07-14 06:21:13,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=402, Invalid=2254, Unknown=8, NotChecked=306, Total=2970 [2022-07-14 06:21:13,484 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 87 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 404 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:13,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 326 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 459 Invalid, 0 Unknown, 404 Unchecked, 0.2s Time] [2022-07-14 06:21:13,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-07-14 06:21:13,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 146. [2022-07-14 06:21:13,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 135 states have (on average 1.2444444444444445) internal successors, (168), 145 states have internal predecessors, (168), 0 states have call successors, (0), 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:21:13,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 168 transitions. [2022-07-14 06:21:13,487 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 168 transitions. Word has length 31 [2022-07-14 06:21:13,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:13,487 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 168 transitions. [2022-07-14 06:21:13,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.027027027027027) internal successors, (75), 38 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:13,487 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 168 transitions. [2022-07-14 06:21:13,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-14 06:21:13,488 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:13,488 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] [2022-07-14 06:21:13,516 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:21:13,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-14 06:21:13,699 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:21:13,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:13,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1935506278, now seen corresponding path program 1 times [2022-07-14 06:21:13,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:13,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469211367] [2022-07-14 06:21:13,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:13,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:13,886 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:21:13,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:13,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469211367] [2022-07-14 06:21:13,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469211367] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:21:13,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1329707469] [2022-07-14 06:21:13,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:13,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:21:13,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:21:13,892 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:21:13,895 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:21:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:14,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-14 06:21:14,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:14,015 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:21:14,018 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:21:14,074 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:21:14,075 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 18 [2022-07-14 06:21:14,093 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:21:14,093 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:21:14,124 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 11 treesize of output 7 [2022-07-14 06:21:14,129 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 11 treesize of output 7 [2022-07-14 06:21:14,164 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:21:14,164 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 1 case distinctions, treesize of input 47 treesize of output 44 [2022-07-14 06:21:14,168 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:21:14,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:21:14,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:21:14,223 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-07-14 06:21:14,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-07-14 06:21:14,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:21:14,253 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 21 treesize of output 20 [2022-07-14 06:21:14,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:21:14,261 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 31 treesize of output 26 [2022-07-14 06:21:14,320 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:14,321 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 13 [2022-07-14 06:21:14,325 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:14,325 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:21:14,389 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:21:14,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:21:16,748 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:21:16,748 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 13 treesize of output 12 [2022-07-14 06:21:16,812 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_15| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_41| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_15|) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_41| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_41|)) (and (forall ((v_ArrVal_1101 (Array Int Int)) (v_ArrVal_1103 Int) (v_ArrVal_1100 (Array Int Int)) (v_ArrVal_1102 Int) (v_ArrVal_1104 Int)) (let ((.cse0 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1101) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_ArrVal_1104) |v_ULTIMATE.start_main_~list~0#1.offset_41|) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc8#1.base_15| v_ArrVal_1102) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1100) |c_ULTIMATE.start_main_~y~0#1.base|) .cse0 v_ArrVal_1103) |v_ULTIMATE.start_main_~list~0#1.offset_41|))))) (forall ((v_ArrVal_1101 (Array Int Int)) (v_ArrVal_1104 Int)) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1101) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1104) |v_ULTIMATE.start_main_~list~0#1.offset_41|)))))) is different from false [2022-07-14 06:21:16,824 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:16,824 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 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-14 06:21:16,827 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 36 [2022-07-14 06:21:16,829 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:16,831 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 7 [2022-07-14 06:21:16,833 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:16,838 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:16,839 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 21 [2022-07-14 06:21:16,860 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:16,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 51 [2022-07-14 06:21:16,863 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:16,865 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 48 treesize of output 44 [2022-07-14 06:21:16,871 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:16,872 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-07-14 06:21:16,874 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:16,876 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 35 treesize of output 31 [2022-07-14 06:21:16,878 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:16,880 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2022-07-14 06:21:16,882 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:16,883 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-07-14 06:21:17,357 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:17,358 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:17,359 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:21:17,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1329707469] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:21:17,360 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:21:17,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 11] total 30 [2022-07-14 06:21:17,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026722861] [2022-07-14 06:21:17,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:21:17,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-14 06:21:17,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:21:17,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-14 06:21:17,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=770, Unknown=3, NotChecked=56, Total=930 [2022-07-14 06:21:17,362 INFO L87 Difference]: Start difference. First operand 146 states and 168 transitions. Second operand has 31 states, 30 states have (on average 3.033333333333333) internal successors, (91), 31 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:19,454 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (<= 13 (select |c_#length| .cse0)) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) 0) (= .cse0 |c_ULTIMATE.start_main_~list~0#1.base|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (<= 13 (select |c_#length| |c_ULTIMATE.start_main_~list~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_main_~y~0#1.base|)) (forall ((|v_ULTIMATE.start_main_#t~malloc8#1.base_15| Int) (|v_ULTIMATE.start_main_~list~0#1.offset_41| Int)) (or (= |c_ULTIMATE.start_main_~list~0#1.base| |v_ULTIMATE.start_main_#t~malloc8#1.base_15|) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_41| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_41|)) (and (forall ((v_ArrVal_1101 (Array Int Int)) (v_ArrVal_1103 Int) (v_ArrVal_1100 (Array Int Int)) (v_ArrVal_1102 Int) (v_ArrVal_1104 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (<= (+ (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1101) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_1104) |v_ULTIMATE.start_main_~list~0#1.offset_41|) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc8#1.base_15| v_ArrVal_1102) (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1100) |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_1103) |v_ULTIMATE.start_main_~list~0#1.offset_41|))))) (forall ((v_ArrVal_1101 (Array Int Int)) (v_ArrVal_1104 Int)) (<= 0 (select (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_1101) |c_ULTIMATE.start_main_~y~0#1.base|) (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8) v_ArrVal_1104) |v_ULTIMATE.start_main_~list~0#1.offset_41|)))))) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1))) is different from false [2022-07-14 06:21:22,259 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|))) (and (= (select |c_#valid| |c_ULTIMATE.start_main_~list~0#1.base|) 1) (= |c_ULTIMATE.start_main_~y~0#1.offset| 0) (= |c_ULTIMATE.start_main_~list~0#1.offset| 0) (forall ((v_ArrVal_1103 Int) (|v_ULTIMATE.start_main_~list~0#1.offset_41| Int) (v_ArrVal_1104 Int)) (or (let ((.cse1 (+ |c_ULTIMATE.start_main_~y~0#1.offset| 8))) (let ((.cse0 (select (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_1104) |v_ULTIMATE.start_main_~list~0#1.offset_41|))) (and (<= 0 .cse0) (<= (+ .cse0 4) (select |c_#length| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~y~0#1.base|) .cse1 v_ArrVal_1103) |v_ULTIMATE.start_main_~list~0#1.offset_41|)))))) (not (<= |v_ULTIMATE.start_main_~list~0#1.offset_41| |c_ULTIMATE.start_main_~y~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~list~0#1.offset_41|)))) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) 0) (= .cse2 |c_ULTIMATE.start_main_~list~0#1.base|) (not (= |c_ULTIMATE.start_main_~list~0#1.base| |c_ULTIMATE.start_main_~y~0#1.base|)) (<= 8 (select |c_#length| |c_ULTIMATE.start_main_~list~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_main_~y~0#1.base|) 1) (<= 8 (select |c_#length| .cse2)))) is different from false [2022-07-14 06:21:33,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:33,241 INFO L93 Difference]: Finished difference Result 330 states and 370 transitions. [2022-07-14 06:21:33,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-14 06:21:33,241 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 3.033333333333333) internal successors, (91), 31 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-14 06:21:33,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:33,242 INFO L225 Difference]: With dead ends: 330 [2022-07-14 06:21:33,242 INFO L226 Difference]: Without dead ends: 330 [2022-07-14 06:21:33,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 44 SyntacticMatches, 7 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1074 ImplicationChecksByTransitivity, 17.9s TimeCoverageRelationStatistics Valid=558, Invalid=3231, Unknown=5, NotChecked=366, Total=4160 [2022-07-14 06:21:33,244 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 222 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 1256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 565 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:33,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 398 Invalid, 1256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 545 Invalid, 0 Unknown, 565 Unchecked, 0.3s Time] [2022-07-14 06:21:33,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2022-07-14 06:21:33,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 215. [2022-07-14 06:21:33,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 204 states have (on average 1.2205882352941178) internal successors, (249), 214 states have internal predecessors, (249), 0 states have call successors, (0), 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:21:33,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 249 transitions. [2022-07-14 06:21:33,250 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 249 transitions. Word has length 31 [2022-07-14 06:21:33,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:33,250 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 249 transitions. [2022-07-14 06:21:33,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 3.033333333333333) internal successors, (91), 31 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:33,251 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 249 transitions. [2022-07-14 06:21:33,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-14 06:21:33,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:33,251 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:33,274 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:21:33,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:21:33,467 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:21:33,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:33,468 INFO L85 PathProgramCache]: Analyzing trace with hash 678559033, now seen corresponding path program 1 times [2022-07-14 06:21:33,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:21:33,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181302451] [2022-07-14 06:21:33,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:33,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:21:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:33,760 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:33,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:21:33,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181302451] [2022-07-14 06:21:33,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181302451] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:21:33,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [689113026] [2022-07-14 06:21:33,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:33,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:21:33,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:21:33,762 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:21:33,766 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:21:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:33,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-14 06:21:33,893 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:33,899 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:21:33,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:21:33,916 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 13 treesize of output 9 [2022-07-14 06:21:33,940 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:21:33,940 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:21:33,973 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 19 treesize of output 18 [2022-07-14 06:21:33,983 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 06:21:34,022 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:21:34,022 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 50 [2022-07-14 06:21:34,028 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 38 treesize of output 36 [2022-07-14 06:21:34,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:21:34,092 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:34,101 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-14 06:21:34,102 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 59 treesize of output 48 [2022-07-14 06:21:34,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:21:34,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 48 [2022-07-14 06:21:34,518 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:34,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:21:34,521 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:34,525 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:21:34,525 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 62 treesize of output 34 [2022-07-14 06:21:34,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:21:34,588 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:21:53,171 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:53,172 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:53,181 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:53,184 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:53,185 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:53,189 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:53,277 INFO L356 Elim1Store]: treesize reduction 214, result has 49.9 percent of original size [2022-07-14 06:21:53,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, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 2181 treesize of output 1452 [2022-07-14 06:21:53,286 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:53,293 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:21:53,371 INFO L356 Elim1Store]: treesize reduction 239, result has 21.4 percent of original size [2022-07-14 06:21:53,372 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 64336 treesize of output 15179 [2022-07-14 06:21:53,600 INFO L356 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-07-14 06:21:53,600 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 9775 treesize of output 9095 [2022-07-14 06:21:53,683 INFO L356 Elim1Store]: treesize reduction 17, result has 51.4 percent of original size [2022-07-14 06:21:53,683 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 9105 treesize of output 8165 [2022-07-14 06:21:53,746 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-14 06:21:53,768 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:21:53,957 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,SelfDestructingSolverStorable22 [2022-07-14 06:21:53,958 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.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:21:53,961 INFO L158 Benchmark]: Toolchain (without parser) took 82232.18ms. Allocated memory was 90.2MB in the beginning and 161.5MB in the end (delta: 71.3MB). Free memory was 66.4MB in the beginning and 103.7MB in the end (delta: -37.3MB). Peak memory consumption was 103.1MB. Max. memory is 16.1GB. [2022-07-14 06:21:53,961 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 90.2MB. Free memory is still 65.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:21:53,962 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.79ms. Allocated memory is still 90.2MB. Free memory was 66.1MB in the beginning and 50.1MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-14 06:21:53,962 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.15ms. Allocated memory is still 90.2MB. Free memory was 50.1MB in the beginning and 48.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 06:21:53,962 INFO L158 Benchmark]: Boogie Preprocessor took 44.15ms. Allocated memory is still 90.2MB. Free memory was 48.0MB in the beginning and 46.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 06:21:53,962 INFO L158 Benchmark]: RCFGBuilder took 553.36ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 46.6MB in the beginning and 79.5MB in the end (delta: -32.9MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2022-07-14 06:21:53,963 INFO L158 Benchmark]: TraceAbstraction took 81151.45ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 79.0MB in the beginning and 103.7MB in the end (delta: -24.7MB). Peak memory consumption was 91.5MB. Max. memory is 16.1GB. [2022-07-14 06:21:53,965 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.17ms. Allocated memory is still 90.2MB. Free memory is still 65.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 426.79ms. Allocated memory is still 90.2MB. Free memory was 66.1MB in the beginning and 50.1MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.15ms. Allocated memory is still 90.2MB. Free memory was 50.1MB in the beginning and 48.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.15ms. Allocated memory is still 90.2MB. Free memory was 48.0MB in the beginning and 46.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 553.36ms. Allocated memory was 90.2MB in the beginning and 111.1MB in the end (delta: 21.0MB). Free memory was 46.6MB in the beginning and 79.5MB in the end (delta: -32.9MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * TraceAbstraction took 81151.45ms. Allocated memory was 111.1MB in the beginning and 161.5MB in the end (delta: 50.3MB). Free memory was 79.0MB in the beginning and 103.7MB in the end (delta: -24.7MB). Peak memory consumption was 91.5MB. 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:21:54,111 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-ext/dll_extends_pointer.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 b19ed65fc9d9f8e19f4d644b05d37e3da28cb107a90eedb15c652c094a7f23f1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:21:55,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:21:55,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:21:55,979 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:21:55,980 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:21:55,981 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:21:55,985 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:21:55,987 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:21:55,989 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:21:56,002 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:21:56,003 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:21:56,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:21:56,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:21:56,010 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:21:56,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:21:56,014 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:21:56,014 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:21:56,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:21:56,017 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:21:56,023 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:21:56,024 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:21:56,025 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:21:56,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:21:56,028 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:21:56,029 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:21:56,035 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:21:56,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:21:56,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:21:56,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:21:56,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:21:56,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:21:56,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:21:56,040 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:21:56,041 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:21:56,042 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:21:56,043 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:21:56,043 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:21:56,044 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:21:56,044 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:21:56,044 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:21:56,045 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:21:56,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:21:56,054 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:21:56,087 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:21:56,087 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:21:56,087 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:21:56,088 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:21:56,088 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:21:56,089 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:21:56,089 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:21:56,089 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:21:56,090 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:21:56,090 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:21:56,091 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:21:56,091 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:21:56,091 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:21:56,091 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:21:56,091 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:21:56,092 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:21:56,092 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:21:56,092 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:21:56,092 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:21:56,093 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:21:56,093 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 06:21:56,093 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 06:21:56,093 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:21:56,093 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:21:56,094 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:21:56,094 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:21:56,094 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:21:56,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:21:56,094 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:21:56,094 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:21:56,095 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 06:21:56,095 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 06:21:56,095 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 06:21:56,095 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 -> b19ed65fc9d9f8e19f4d644b05d37e3da28cb107a90eedb15c652c094a7f23f1 [2022-07-14 06:21:56,435 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:21:56,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:21:56,460 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:21:56,461 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:21:56,462 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:21:56,464 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2022-07-14 06:21:56,539 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049944150/96bfd4197f2c404a966f36b409eec774/FLAG465ea791a [2022-07-14 06:21:57,005 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:21:57,006 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/dll_extends_pointer.i [2022-07-14 06:21:57,025 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049944150/96bfd4197f2c404a966f36b409eec774/FLAG465ea791a [2022-07-14 06:21:57,537 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/049944150/96bfd4197f2c404a966f36b409eec774 [2022-07-14 06:21:57,540 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:21:57,541 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:21:57,543 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:21:57,544 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:21:57,547 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:21:57,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:21:57" (1/1) ... [2022-07-14 06:21:57,548 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c732ea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:57, skipping insertion in model container [2022-07-14 06:21:57,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:21:57" (1/1) ... [2022-07-14 06:21:57,555 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:21:57,605 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:21:57,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:21:57,915 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:21:57,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:21:58,003 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:21:58,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:58 WrapperNode [2022-07-14 06:21:58,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:21:58,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:21:58,007 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:21:58,007 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:21:58,013 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:21:58" (1/1) ... [2022-07-14 06:21:58,045 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:21:58" (1/1) ... [2022-07-14 06:21:58,074 INFO L137 Inliner]: procedures = 124, calls = 21, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 62 [2022-07-14 06:21:58,074 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:21:58,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:21:58,079 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:21:58,079 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:21:58,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:58" (1/1) ... [2022-07-14 06:21:58,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:58" (1/1) ... [2022-07-14 06:21:58,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:58" (1/1) ... [2022-07-14 06:21:58,100 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:58" (1/1) ... [2022-07-14 06:21:58,111 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:58" (1/1) ... [2022-07-14 06:21:58,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:58" (1/1) ... [2022-07-14 06:21:58,116 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:58" (1/1) ... [2022-07-14 06:21:58,119 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:21:58,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:21:58,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:21:58,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:21:58,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:58" (1/1) ... [2022-07-14 06:21:58,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:21:58,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:21:58,157 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:21:58,187 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:21:58,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:21:58,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:21:58,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:21:58,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:21:58,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:21:58,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-14 06:21:58,203 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:21:58,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:21:58,317 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:21:58,318 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:21:58,623 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:21:58,629 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:21:58,629 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-14 06:21:58,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:21:58 BoogieIcfgContainer [2022-07-14 06:21:58,631 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:21:58,632 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:21:58,632 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:21:58,635 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:21:58,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:21:57" (1/3) ... [2022-07-14 06:21:58,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a65e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:21:58, skipping insertion in model container [2022-07-14 06:21:58,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:21:58" (2/3) ... [2022-07-14 06:21:58,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52a65e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:21:58, skipping insertion in model container [2022-07-14 06:21:58,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:21:58" (3/3) ... [2022-07-14 06:21:58,637 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_extends_pointer.i [2022-07-14 06:21:58,650 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:21:58,650 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2022-07-14 06:21:58,685 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:21:58,700 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@33e46c10, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5da086da [2022-07-14 06:21:58,700 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-07-14 06:21:58,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 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:21:58,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:21:58,721 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:58,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:21:58,722 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:21:58,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:58,726 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-14 06:21:58,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:21:58,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1690332823] [2022-07-14 06:21:58,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:58,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:21:58,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:21:58,747 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:21:58,793 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:21:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:58,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 06:21:58,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:58,923 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:21:58,933 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:21:58,933 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:21:58,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:21:58,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1690332823] [2022-07-14 06:21:58,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1690332823] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:58,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:58,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:21:58,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677857171] [2022-07-14 06:21:58,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:58,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:21:58,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:21:58,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:21:58,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:21:58,965 INFO L87 Difference]: Start difference. First operand has 57 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:59,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:59,090 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2022-07-14 06:21:59,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:21:59,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-14 06:21:59,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:59,098 INFO L225 Difference]: With dead ends: 61 [2022-07-14 06:21:59,099 INFO L226 Difference]: Without dead ends: 57 [2022-07-14 06:21:59,100 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:21:59,103 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 38 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:59,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 31 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:21:59,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-14 06:21:59,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 51. [2022-07-14 06:21:59,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 31 states have (on average 1.8064516129032258) internal successors, (56), 50 states have internal predecessors, (56), 0 states have call successors, (0), 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:21:59,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2022-07-14 06:21:59,130 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 3 [2022-07-14 06:21:59,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:59,131 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2022-07-14 06:21:59,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:59,132 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2022-07-14 06:21:59,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:21:59,132 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:59,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:21:59,150 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:21:59,346 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:21:59,346 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:21:59,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:59,347 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-14 06:21:59,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:21:59,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [727318749] [2022-07-14 06:21:59,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:59,348 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:21:59,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:21:59,349 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:21:59,351 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:21:59,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:59,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:21:59,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:59,419 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:21:59,444 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:21:59,444 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:21:59,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:21:59,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [727318749] [2022-07-14 06:21:59,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [727318749] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:59,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:59,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:21:59,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128539384] [2022-07-14 06:21:59,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:59,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:21:59,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:21:59,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:21:59,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:21:59,448 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:59,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:21:59,577 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-07-14 06:21:59,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:21:59,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-14 06:21:59,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:21:59,578 INFO L225 Difference]: With dead ends: 52 [2022-07-14 06:21:59,578 INFO L226 Difference]: Without dead ends: 52 [2022-07-14 06:21:59,579 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:21:59,580 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 15 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:21:59,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 48 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:21:59,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-14 06:21:59,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2022-07-14 06:21:59,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 31 states have (on average 1.6451612903225807) internal successors, (51), 45 states have internal predecessors, (51), 0 states have call successors, (0), 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:21:59,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-07-14 06:21:59,593 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 3 [2022-07-14 06:21:59,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:21:59,593 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-07-14 06:21:59,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:21:59,594 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-07-14 06:21:59,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-14 06:21:59,594 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:21:59,594 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:21:59,605 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:21:59,803 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:21:59,803 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:21:59,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:21:59,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1837114924, now seen corresponding path program 1 times [2022-07-14 06:21:59,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:21:59,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269969444] [2022-07-14 06:21:59,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:21:59,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:21:59,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:21:59,807 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:21:59,808 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:21:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:21:59,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:21:59,864 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:21:59,869 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:21:59,888 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:21:59,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:21:59,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:21:59,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269969444] [2022-07-14 06:21:59,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [269969444] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:21:59,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:21:59,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:21:59,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586282912] [2022-07-14 06:21:59,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:21:59,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:21:59,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:21:59,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:21:59,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:21:59,892 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:00,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:00,073 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2022-07-14 06:22:00,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:22:00,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-14 06:22:00,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:00,074 INFO L225 Difference]: With dead ends: 56 [2022-07-14 06:22:00,074 INFO L226 Difference]: Without dead ends: 56 [2022-07-14 06:22:00,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:22:00,076 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 44 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:00,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 29 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:22:00,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-14 06:22:00,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2022-07-14 06:22:00,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.6285714285714286) internal successors, (57), 48 states have internal predecessors, (57), 0 states have call successors, (0), 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:22:00,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 57 transitions. [2022-07-14 06:22:00,080 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 57 transitions. Word has length 9 [2022-07-14 06:22:00,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:00,080 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 57 transitions. [2022-07-14 06:22:00,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:00,081 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2022-07-14 06:22:00,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-14 06:22:00,081 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:00,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:00,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-14 06:22:00,290 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:22:00,290 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:22:00,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:00,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1837114925, now seen corresponding path program 1 times [2022-07-14 06:22:00,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:22:00,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1978256395] [2022-07-14 06:22:00,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:00,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:22:00,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:22:00,293 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:22:00,295 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:22:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:00,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 06:22:00,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:00,357 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:22:00,429 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:22:00,429 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:22:00,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:22:00,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1978256395] [2022-07-14 06:22:00,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1978256395] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:00,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:00,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:22:00,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519017697] [2022-07-14 06:22:00,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:00,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:22:00,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:22:00,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:22:00,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:22:00,432 INFO L87 Difference]: Start difference. First operand 49 states and 57 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:00,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:00,630 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2022-07-14 06:22:00,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:22:00,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-14 06:22:00,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:00,632 INFO L225 Difference]: With dead ends: 83 [2022-07-14 06:22:00,632 INFO L226 Difference]: Without dead ends: 83 [2022-07-14 06:22:00,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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:22:00,633 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 43 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:00,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 50 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:22:00,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-14 06:22:00,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2022-07-14 06:22:00,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.56) internal successors, (78), 63 states have internal predecessors, (78), 0 states have call successors, (0), 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:22:00,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 78 transitions. [2022-07-14 06:22:00,640 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 78 transitions. Word has length 9 [2022-07-14 06:22:00,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:00,641 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 78 transitions. [2022-07-14 06:22:00,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:00,641 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 78 transitions. [2022-07-14 06:22:00,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 06:22:00,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:00,642 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:00,651 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:22:00,850 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:22:00,851 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:22:00,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:00,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1115986890, now seen corresponding path program 1 times [2022-07-14 06:22:00,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:22:00,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897163407] [2022-07-14 06:22:00,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:00,852 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:22:00,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:22:00,855 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:22:00,856 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:22:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:00,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 06:22:00,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:00,921 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:22:00,921 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:22:00,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:22:00,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897163407] [2022-07-14 06:22:00,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897163407] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:00,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:00,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:22:00,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885388861] [2022-07-14 06:22:00,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:00,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:22:00,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:22:00,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:22:00,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:22:00,923 INFO L87 Difference]: Start difference. First operand 64 states and 78 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:22:01,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:01,039 INFO L93 Difference]: Finished difference Result 87 states and 101 transitions. [2022-07-14 06:22:01,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:22:01,040 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:22:01,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:01,041 INFO L225 Difference]: With dead ends: 87 [2022-07-14 06:22:01,041 INFO L226 Difference]: Without dead ends: 87 [2022-07-14 06:22:01,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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:22:01,042 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 47 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:01,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 49 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:22:01,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-14 06:22:01,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 64. [2022-07-14 06:22:01,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.52) internal successors, (76), 63 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:01,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2022-07-14 06:22:01,047 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 10 [2022-07-14 06:22:01,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:01,047 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2022-07-14 06:22:01,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:22:01,048 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2022-07-14 06:22:01,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 06:22:01,048 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:01,048 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:01,059 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:22:01,257 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:22:01,257 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:22:01,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:01,258 INFO L85 PathProgramCache]: Analyzing trace with hash 236809714, now seen corresponding path program 1 times [2022-07-14 06:22:01,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:22:01,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092414659] [2022-07-14 06:22:01,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:01,258 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:22:01,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:22:01,260 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:22:01,260 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:22:01,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:01,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 06:22:01,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:01,367 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:22:01,372 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:22:01,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:22:01,417 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:22:01,428 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:22:01,428 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:22:01,442 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:22:01,443 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:22:01,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:22:01,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092414659] [2022-07-14 06:22:01,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092414659] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:01,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:01,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:22:01,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934233824] [2022-07-14 06:22:01,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:01,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:22:01,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:22:01,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:22:01,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:22:01,445 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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:22:01,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:01,545 INFO L93 Difference]: Finished difference Result 63 states and 75 transitions. [2022-07-14 06:22:01,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:22:01,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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:22:01,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:01,547 INFO L225 Difference]: With dead ends: 63 [2022-07-14 06:22:01,547 INFO L226 Difference]: Without dead ends: 63 [2022-07-14 06:22:01,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 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:22:01,548 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 13 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:01,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 50 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:22:01,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-14 06:22:01,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-07-14 06:22:01,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 50 states have (on average 1.5) internal successors, (75), 62 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:01,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 75 transitions. [2022-07-14 06:22:01,552 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 75 transitions. Word has length 11 [2022-07-14 06:22:01,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:01,553 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 75 transitions. [2022-07-14 06:22:01,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 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:22:01,553 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 75 transitions. [2022-07-14 06:22:01,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 06:22:01,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:01,553 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:01,576 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:22:01,774 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:22:01,774 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:22:01,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:01,775 INFO L85 PathProgramCache]: Analyzing trace with hash 657991070, now seen corresponding path program 1 times [2022-07-14 06:22:01,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:22:01,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890308522] [2022-07-14 06:22:01,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:01,775 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:22:01,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:22:01,776 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:22:01,777 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:22:01,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:01,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 06:22:01,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:01,944 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:22:01,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:22:01,945 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:22:01,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890308522] [2022-07-14 06:22:01,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890308522] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:01,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:01,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:22:01,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789498376] [2022-07-14 06:22:01,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:01,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:22:01,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:22:01,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:22:01,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:22:01,946 INFO L87 Difference]: Start difference. First operand 63 states and 75 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:02,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:02,110 INFO L93 Difference]: Finished difference Result 86 states and 98 transitions. [2022-07-14 06:22:02,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:22:02,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-14 06:22:02,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:02,112 INFO L225 Difference]: With dead ends: 86 [2022-07-14 06:22:02,112 INFO L226 Difference]: Without dead ends: 86 [2022-07-14 06:22:02,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:22:02,113 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 75 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:02,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 38 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:22:02,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-14 06:22:02,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 72. [2022-07-14 06:22:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 59 states have (on average 1.5423728813559323) internal successors, (91), 71 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:02,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 91 transitions. [2022-07-14 06:22:02,118 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 91 transitions. Word has length 14 [2022-07-14 06:22:02,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:02,118 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 91 transitions. [2022-07-14 06:22:02,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:02,118 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 91 transitions. [2022-07-14 06:22:02,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 06:22:02,119 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:02,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:02,129 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:22:02,327 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:22:02,327 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:22:02,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:02,331 INFO L85 PathProgramCache]: Analyzing trace with hash 657980085, now seen corresponding path program 1 times [2022-07-14 06:22:02,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:22:02,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1395583785] [2022-07-14 06:22:02,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:02,332 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:22:02,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:22:02,333 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:22:02,334 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:22:02,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:02,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-14 06:22:02,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:02,417 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 13 treesize of output 9 [2022-07-14 06:22:02,422 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:22:02,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-14 06:22:02,514 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:22:02,537 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:22:02,537 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:22:02,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:22:02,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1395583785] [2022-07-14 06:22:02,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1395583785] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:02,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:02,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:22:02,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217169396] [2022-07-14 06:22:02,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:02,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:22:02,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:22:02,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:22:02,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:22:02,540 INFO L87 Difference]: Start difference. First operand 72 states and 91 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:02,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:02,797 INFO L93 Difference]: Finished difference Result 77 states and 93 transitions. [2022-07-14 06:22:02,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:22:02,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-14 06:22:02,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:02,799 INFO L225 Difference]: With dead ends: 77 [2022-07-14 06:22:02,799 INFO L226 Difference]: Without dead ends: 77 [2022-07-14 06:22:02,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:22:02,800 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 35 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:02,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 97 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:22:02,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-14 06:22:02,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2022-07-14 06:22:02,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 54 states have (on average 1.5185185185185186) internal successors, (82), 66 states have internal predecessors, (82), 0 states have call successors, (0), 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:22:02,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2022-07-14 06:22:02,805 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 14 [2022-07-14 06:22:02,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:02,805 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2022-07-14 06:22:02,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:02,805 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2022-07-14 06:22:02,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:22:02,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:02,806 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:02,815 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:22:03,014 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:22:03,014 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:22:03,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:03,015 INFO L85 PathProgramCache]: Analyzing trace with hash -675555265, now seen corresponding path program 1 times [2022-07-14 06:22:03,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:22:03,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [732534225] [2022-07-14 06:22:03,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:03,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:22:03,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:22:03,017 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:22:03,018 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:22:03,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:03,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:22:03,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:03,161 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:03,161 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:22:03,161 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:22:03,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [732534225] [2022-07-14 06:22:03,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [732534225] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:03,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:03,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:22:03,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423913890] [2022-07-14 06:22:03,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:03,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:22:03,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:22:03,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:22:03,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:22:03,164 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:03,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:03,320 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-07-14 06:22:03,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:22:03,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 06:22:03,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:03,321 INFO L225 Difference]: With dead ends: 76 [2022-07-14 06:22:03,321 INFO L226 Difference]: Without dead ends: 76 [2022-07-14 06:22:03,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:22:03,321 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 43 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:03,322 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 57 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:22:03,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-14 06:22:03,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 63. [2022-07-14 06:22:03,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 51 states have (on average 1.4313725490196079) internal successors, (73), 62 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:03,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2022-07-14 06:22:03,326 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 16 [2022-07-14 06:22:03,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:03,326 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2022-07-14 06:22:03,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:03,326 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-07-14 06:22:03,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:22:03,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:03,327 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:03,335 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:22:03,535 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:22:03,536 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:22:03,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:03,536 INFO L85 PathProgramCache]: Analyzing trace with hash -18664237, now seen corresponding path program 1 times [2022-07-14 06:22:03,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:22:03,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [793015736] [2022-07-14 06:22:03,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:03,537 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:22:03,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:22:03,538 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:22:03,539 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:22:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:03,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-14 06:22:03,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:03,630 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 11 treesize of output 7 [2022-07-14 06:22:03,636 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 11 treesize of output 7 [2022-07-14 06:22:03,672 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-14 06:22:03,672 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 21 treesize of output 20 [2022-07-14 06:22:03,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:22:03,681 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 21 treesize of output 20 [2022-07-14 06:22:03,721 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-14 06:22:03,722 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 21 treesize of output 20 [2022-07-14 06:22:03,728 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:22:03,730 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 21 treesize of output 20 [2022-07-14 06:22:03,770 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:22:03,775 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:22:03,813 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:03,814 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:22:03,878 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:03,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:22:03,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [793015736] [2022-07-14 06:22:03,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [793015736] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:22:03,879 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:22:03,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2022-07-14 06:22:03,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745081951] [2022-07-14 06:22:03,880 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:22:03,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:22:03,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:22:03,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:22:03,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:22:03,881 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:04,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:04,097 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-07-14 06:22:04,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:22:04,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-14 06:22:04,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:04,098 INFO L225 Difference]: With dead ends: 77 [2022-07-14 06:22:04,098 INFO L226 Difference]: Without dead ends: 77 [2022-07-14 06:22:04,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:22:04,099 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 18 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:04,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 124 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:22:04,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-14 06:22:04,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2022-07-14 06:22:04,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 72 states have internal predecessors, (84), 0 states have call successors, (0), 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:22:04,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 84 transitions. [2022-07-14 06:22:04,103 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 84 transitions. Word has length 17 [2022-07-14 06:22:04,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:04,104 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 84 transitions. [2022-07-14 06:22:04,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:04,104 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 84 transitions. [2022-07-14 06:22:04,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 06:22:04,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:04,104 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:22:04,119 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:22:04,305 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:22:04,305 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:22:04,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:04,306 INFO L85 PathProgramCache]: Analyzing trace with hash -578592253, now seen corresponding path program 1 times [2022-07-14 06:22:04,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:22:04,306 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [157894267] [2022-07-14 06:22:04,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:04,306 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:22:04,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:22:04,307 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:22:04,309 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:22:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:04,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 06:22:04,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:04,507 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:04,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:22:04,571 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:04,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:22:04,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [157894267] [2022-07-14 06:22:04,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [157894267] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:22:04,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:22:04,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-14 06:22:04,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058603249] [2022-07-14 06:22:04,572 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:22:04,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:22:04,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:22:04,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:22:04,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:22:04,573 INFO L87 Difference]: Start difference. First operand 73 states and 84 transitions. Second operand has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 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:22:04,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:04,741 INFO L93 Difference]: Finished difference Result 75 states and 85 transitions. [2022-07-14 06:22:04,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:22:04,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 06:22:04,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:04,742 INFO L225 Difference]: With dead ends: 75 [2022-07-14 06:22:04,742 INFO L226 Difference]: Without dead ends: 64 [2022-07-14 06:22:04,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:22:04,743 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 3 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:04,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 95 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 51 Unchecked, 0.1s Time] [2022-07-14 06:22:04,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-07-14 06:22:04,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-07-14 06:22:04,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 52 states have (on average 1.4230769230769231) internal successors, (74), 63 states have internal predecessors, (74), 0 states have call successors, (0), 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:22:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 74 transitions. [2022-07-14 06:22:04,747 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 74 transitions. Word has length 18 [2022-07-14 06:22:04,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:04,747 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 74 transitions. [2022-07-14 06:22:04,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.0) internal successors, (35), 8 states have internal predecessors, (35), 0 states have call successors, (0), 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:22:04,747 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 74 transitions. [2022-07-14 06:22:04,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:22:04,748 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:04,748 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:22:04,763 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:22:04,949 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:22:04,949 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:22:04,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:04,949 INFO L85 PathProgramCache]: Analyzing trace with hash -952974365, now seen corresponding path program 1 times [2022-07-14 06:22:04,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:22:04,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101508241] [2022-07-14 06:22:04,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:04,950 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:22:04,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:22:04,951 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:22:04,952 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:22:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:05,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 06:22:05,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:05,069 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 13 treesize of output 9 [2022-07-14 06:22:05,132 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:22:05,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:05,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:22:05,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:22:05,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101508241] [2022-07-14 06:22:05,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101508241] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:05,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:05,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:22:05,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043425405] [2022-07-14 06:22:05,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:05,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:22:05,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:22:05,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:22:05,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:22:05,142 INFO L87 Difference]: Start difference. First operand 64 states and 74 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:05,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:05,463 INFO L93 Difference]: Finished difference Result 82 states and 90 transitions. [2022-07-14 06:22:05,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 06:22:05,463 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-14 06:22:05,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:05,464 INFO L225 Difference]: With dead ends: 82 [2022-07-14 06:22:05,464 INFO L226 Difference]: Without dead ends: 82 [2022-07-14 06:22:05,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:22:05,465 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 59 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:05,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 134 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:22:05,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-14 06:22:05,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 64. [2022-07-14 06:22:05,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 63 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2022-07-14 06:22:05,468 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 21 [2022-07-14 06:22:05,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:05,468 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2022-07-14 06:22:05,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:05,468 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2022-07-14 06:22:05,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:22:05,469 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:05,469 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:22:05,477 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:22:05,675 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:22:05,675 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:22:05,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:05,676 INFO L85 PathProgramCache]: Analyzing trace with hash 522565856, now seen corresponding path program 1 times [2022-07-14 06:22:05,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:22:05,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092177136] [2022-07-14 06:22:05,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:05,677 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:22:05,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:22:05,678 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:22:05,678 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:22:05,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:05,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-14 06:22:05,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:05,929 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 13 treesize of output 9 [2022-07-14 06:22:06,135 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:22:06,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:06,171 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:22:06,171 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:22:06,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092177136] [2022-07-14 06:22:06,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092177136] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:06,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:06,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:22:06,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730742032] [2022-07-14 06:22:06,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:06,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:22:06,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:22:06,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:22:06,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:22:06,173 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:06,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:06,213 INFO L93 Difference]: Finished difference Result 87 states and 99 transitions. [2022-07-14 06:22:06,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:22:06,213 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-14 06:22:06,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:06,214 INFO L225 Difference]: With dead ends: 87 [2022-07-14 06:22:06,214 INFO L226 Difference]: Without dead ends: 87 [2022-07-14 06:22:06,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:22:06,215 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 36 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:06,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 99 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 73 Unchecked, 0.0s Time] [2022-07-14 06:22:06,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-14 06:22:06,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 79. [2022-07-14 06:22:06,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 67 states have (on average 1.3582089552238805) internal successors, (91), 78 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:06,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 91 transitions. [2022-07-14 06:22:06,218 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 91 transitions. Word has length 22 [2022-07-14 06:22:06,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:06,218 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 91 transitions. [2022-07-14 06:22:06,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:06,218 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 91 transitions. [2022-07-14 06:22:06,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 06:22:06,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:06,219 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] [2022-07-14 06:22:06,233 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:22:06,428 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:22:06,429 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:22:06,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:06,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1402337693, now seen corresponding path program 1 times [2022-07-14 06:22:06,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:22:06,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429973802] [2022-07-14 06:22:06,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:06,430 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:22:06,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:22:06,431 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:22:06,433 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:22:06,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:06,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-14 06:22:06,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:06,552 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:22:06,575 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:22:06,575 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 12 [2022-07-14 06:22:06,595 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 11 treesize of output 7 [2022-07-14 06:22:06,629 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:22:06,629 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 1 case distinctions, treesize of input 31 treesize of output 32 [2022-07-14 06:22:06,674 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-14 06:22:06,674 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 34 treesize of output 29 [2022-07-14 06:22:06,734 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 28 treesize of output 16 [2022-07-14 06:22:06,792 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 15 treesize of output 17 [2022-07-14 06:22:06,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:06,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:22:06,904 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:06,904 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 37 treesize of output 41 [2022-07-14 06:22:06,945 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_384 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= |c_ULTIMATE.start_main_~y~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_384) |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|)))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~list~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_prenex_1) |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|)))) is different from false [2022-07-14 06:22:06,960 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:06,960 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 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-14 06:22:06,964 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 30 treesize of output 22 [2022-07-14 06:22:06,968 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 5 treesize of output 3 [2022-07-14 06:22:06,975 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-14 06:22:06,975 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 1 [2022-07-14 06:22:06,990 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:06,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:22:06,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429973802] [2022-07-14 06:22:06,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429973802] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:22:06,991 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:22:06,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 12 [2022-07-14 06:22:06,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211886941] [2022-07-14 06:22:06,992 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:22:06,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 06:22:06,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:22:06,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 06:22:06,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=107, Unknown=1, NotChecked=20, Total=156 [2022-07-14 06:22:06,993 INFO L87 Difference]: Start difference. First operand 79 states and 91 transitions. Second operand has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 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:22:07,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:07,735 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2022-07-14 06:22:07,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 06:22:07,736 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-14 06:22:07,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:07,736 INFO L225 Difference]: With dead ends: 101 [2022-07-14 06:22:07,736 INFO L226 Difference]: Without dead ends: 101 [2022-07-14 06:22:07,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=131, Invalid=378, Unknown=1, NotChecked=42, Total=552 [2022-07-14 06:22:07,737 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 106 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 64 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:07,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 77 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 253 Invalid, 0 Unknown, 64 Unchecked, 0.4s Time] [2022-07-14 06:22:07,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-14 06:22:07,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 84. [2022-07-14 06:22:07,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 72 states have (on average 1.375) internal successors, (99), 83 states have internal predecessors, (99), 0 states have call successors, (0), 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:22:07,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 99 transitions. [2022-07-14 06:22:07,741 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 99 transitions. Word has length 23 [2022-07-14 06:22:07,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:07,741 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 99 transitions. [2022-07-14 06:22:07,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.25) internal successors, (27), 13 states have internal predecessors, (27), 0 states have call successors, (0), 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:22:07,741 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2022-07-14 06:22:07,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 06:22:07,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:07,742 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] [2022-07-14 06:22:07,754 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:22:07,947 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:22:07,947 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:22:07,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:07,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1402337692, now seen corresponding path program 1 times [2022-07-14 06:22:07,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:22:07,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1995680472] [2022-07-14 06:22:07,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:07,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:22:07,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:22:07,949 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:22:07,952 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:22:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:08,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-14 06:22:08,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:08,106 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:22:08,112 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:22:08,160 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:22:08,164 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 12 [2022-07-14 06:22:08,172 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:22:08,189 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 11 treesize of output 7 [2022-07-14 06:22:08,195 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 11 treesize of output 7 [2022-07-14 06:22:08,232 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:22:08,233 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 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-14 06:22:08,238 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:22:08,283 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-14 06:22:08,283 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 31 treesize of output 26 [2022-07-14 06:22:08,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:22:08,293 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 21 treesize of output 20 [2022-07-14 06:22:08,337 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 06:22:08,342 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 15 treesize of output 7 [2022-07-14 06:22:08,399 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:08,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:22:08,725 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_436 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_437 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_437) |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_436) |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|)))) (forall ((v_ArrVal_437 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_437) |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2022-07-14 06:22:08,740 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:08,741 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 1 case distinctions, treesize of input 35 treesize of output 28 [2022-07-14 06:22:08,743 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 28 [2022-07-14 06:22:08,750 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 13 treesize of output 9 [2022-07-14 06:22:08,767 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:08,767 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2022-07-14 06:22:08,775 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:08,776 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-14 06:22:08,778 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:22:08,780 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 27 treesize of output 19 [2022-07-14 06:22:08,783 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:22:08,785 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 20 treesize of output 12 [2022-07-14 06:22:09,129 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:22:09,130 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:09,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:22:09,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1995680472] [2022-07-14 06:22:09,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1995680472] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:22:09,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:22:09,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2022-07-14 06:22:09,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807828977] [2022-07-14 06:22:09,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:22:09,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-14 06:22:09,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:22:09,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-14 06:22:09,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=228, Unknown=1, NotChecked=30, Total=306 [2022-07-14 06:22:09,133 INFO L87 Difference]: Start difference. First operand 84 states and 99 transitions. Second operand has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 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:22:10,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:10,111 INFO L93 Difference]: Finished difference Result 100 states and 113 transitions. [2022-07-14 06:22:10,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 06:22:10,111 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-14 06:22:10,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:10,112 INFO L225 Difference]: With dead ends: 100 [2022-07-14 06:22:10,112 INFO L226 Difference]: Without dead ends: 100 [2022-07-14 06:22:10,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=182, Invalid=523, Unknown=1, NotChecked=50, Total=756 [2022-07-14 06:22:10,113 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 90 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:10,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 132 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 228 Invalid, 0 Unknown, 146 Unchecked, 0.5s Time] [2022-07-14 06:22:10,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-14 06:22:10,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 87. [2022-07-14 06:22:10,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 75 states have (on average 1.3866666666666667) internal successors, (104), 86 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:10,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 104 transitions. [2022-07-14 06:22:10,116 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 104 transitions. Word has length 23 [2022-07-14 06:22:10,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:10,116 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 104 transitions. [2022-07-14 06:22:10,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.6470588235294117) internal successors, (45), 18 states have internal predecessors, (45), 0 states have call successors, (0), 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:22:10,116 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2022-07-14 06:22:10,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 06:22:10,117 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:10,117 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:22:10,131 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:22:10,317 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:22:10,317 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:22:10,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:10,318 INFO L85 PathProgramCache]: Analyzing trace with hash -980327547, now seen corresponding path program 1 times [2022-07-14 06:22:10,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:22:10,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1683860629] [2022-07-14 06:22:10,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:10,318 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:22:10,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:22:10,319 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:22:10,320 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:22:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:10,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-14 06:22:10,405 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:10,419 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:22:10,432 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 13 treesize of output 9 [2022-07-14 06:22:10,492 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 17 treesize of output 9 [2022-07-14 06:22:10,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:10,503 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:22:10,503 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:22:10,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1683860629] [2022-07-14 06:22:10,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1683860629] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:10,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:10,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:22:10,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213420375] [2022-07-14 06:22:10,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:10,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:22:10,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:22:10,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:22:10,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:22:10,506 INFO L87 Difference]: Start difference. First operand 87 states and 104 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:10,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:10,764 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2022-07-14 06:22:10,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:22:10,764 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-14 06:22:10,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:10,765 INFO L225 Difference]: With dead ends: 88 [2022-07-14 06:22:10,765 INFO L226 Difference]: Without dead ends: 88 [2022-07-14 06:22:10,765 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:22:10,766 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:10,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 70 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:22:10,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-14 06:22:10,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2022-07-14 06:22:10,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 75 states have (on average 1.3733333333333333) internal successors, (103), 86 states have internal predecessors, (103), 0 states have call successors, (0), 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:22:10,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 103 transitions. [2022-07-14 06:22:10,768 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 103 transitions. Word has length 23 [2022-07-14 06:22:10,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:10,768 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 103 transitions. [2022-07-14 06:22:10,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:10,769 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 103 transitions. [2022-07-14 06:22:10,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 06:22:10,769 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:10,769 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] [2022-07-14 06:22:10,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-14 06:22:10,970 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:22:10,970 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:22:10,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:10,970 INFO L85 PathProgramCache]: Analyzing trace with hash -522796429, now seen corresponding path program 1 times [2022-07-14 06:22:10,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:22:10,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [342387686] [2022-07-14 06:22:10,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:10,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:22:10,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:22:10,972 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:22:10,973 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:22:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:11,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-14 06:22:11,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:11,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:22:11,141 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:22:11,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-07-14 06:22:11,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:22:11,182 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:22:11,183 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 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-14 06:22:11,212 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-14 06:22:11,212 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 30 treesize of output 25 [2022-07-14 06:22:11,238 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 12 [2022-07-14 06:22:11,265 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:22:11,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:22:11,316 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_531 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_531) |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-14 06:22:11,322 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:11,323 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 1 case distinctions, treesize of input 19 treesize of output 20 [2022-07-14 06:22:11,325 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 33 treesize of output 25 [2022-07-14 06:22:11,438 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:22:11,438 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:22:11,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [342387686] [2022-07-14 06:22:11,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [342387686] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:22:11,438 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:22:11,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-07-14 06:22:11,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227707591] [2022-07-14 06:22:11,439 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:22:11,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-14 06:22:11,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:22:11,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-14 06:22:11,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=148, Unknown=1, NotChecked=24, Total=210 [2022-07-14 06:22:11,440 INFO L87 Difference]: Start difference. First operand 87 states and 103 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 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:22:11,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:11,884 INFO L93 Difference]: Finished difference Result 127 states and 147 transitions. [2022-07-14 06:22:11,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 06:22:11,885 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-14 06:22:11,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:11,886 INFO L225 Difference]: With dead ends: 127 [2022-07-14 06:22:11,886 INFO L226 Difference]: Without dead ends: 127 [2022-07-14 06:22:11,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=302, Unknown=1, NotChecked=36, Total=420 [2022-07-14 06:22:11,887 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 31 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 129 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:11,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 203 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 249 Invalid, 0 Unknown, 129 Unchecked, 0.3s Time] [2022-07-14 06:22:11,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-14 06:22:11,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 119. [2022-07-14 06:22:11,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 107 states have (on average 1.308411214953271) internal successors, (140), 118 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:11,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 140 transitions. [2022-07-14 06:22:11,890 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 140 transitions. Word has length 24 [2022-07-14 06:22:11,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:11,891 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 140 transitions. [2022-07-14 06:22:11,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 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:22:11,891 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 140 transitions. [2022-07-14 06:22:11,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:22:11,893 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:11,893 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] [2022-07-14 06:22:11,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-07-14 06:22:12,099 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:22:12,100 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:22:12,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:12,101 INFO L85 PathProgramCache]: Analyzing trace with hash 973208805, now seen corresponding path program 1 times [2022-07-14 06:22:12,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:22:12,101 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989659394] [2022-07-14 06:22:12,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:12,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:22:12,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:22:12,103 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:22:12,105 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:22:12,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:12,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-14 06:22:12,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:12,282 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:22:12,286 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:22:12,341 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:22:12,342 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 18 [2022-07-14 06:22:12,356 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:22:12,356 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 12 [2022-07-14 06:22:12,383 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 11 treesize of output 7 [2022-07-14 06:22:12,390 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 11 treesize of output 7 [2022-07-14 06:22:12,435 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:22:12,435 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 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-14 06:22:12,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, 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:22:12,485 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-14 06:22:12,485 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 31 treesize of output 26 [2022-07-14 06:22:12,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:22:12,497 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 21 treesize of output 20 [2022-07-14 06:22:12,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-14 06:22:12,546 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 15 treesize of output 7 [2022-07-14 06:22:12,628 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:12,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:22:13,021 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_583 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_582) |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_583) |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|)))) (forall ((v_ArrVal_582 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_582) |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32)))))) is different from false [2022-07-14 06:22:13,038 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:13,039 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 1 case distinctions, treesize of input 37 treesize of output 38 [2022-07-14 06:22:13,045 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:13,045 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 1 case distinctions, treesize of input 29 treesize of output 30 [2022-07-14 06:22:13,048 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 52 treesize of output 44 [2022-07-14 06:22:13,050 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 82 treesize of output 70 [2022-07-14 06:22:13,058 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 34 treesize of output 30 [2022-07-14 06:22:13,060 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 62 treesize of output 58 [2022-07-14 06:22:13,152 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:13,152 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 1 case distinctions, treesize of input 37 treesize of output 30 [2022-07-14 06:22:13,154 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 44 treesize of output 32 [2022-07-14 06:22:13,158 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 15 treesize of output 11 [2022-07-14 06:22:13,751 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:22:13,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:13,761 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:22:13,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989659394] [2022-07-14 06:22:13,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989659394] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:22:13,761 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:22:13,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2022-07-14 06:22:13,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914309181] [2022-07-14 06:22:13,763 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:22:13,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-14 06:22:13,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:22:13,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-14 06:22:13,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=291, Unknown=1, NotChecked=34, Total=380 [2022-07-14 06:22:13,764 INFO L87 Difference]: Start difference. First operand 119 states and 140 transitions. Second operand has 20 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 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:22:15,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:15,577 INFO L93 Difference]: Finished difference Result 204 states and 238 transitions. [2022-07-14 06:22:15,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 06:22:15,578 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-14 06:22:15,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:15,579 INFO L225 Difference]: With dead ends: 204 [2022-07-14 06:22:15,579 INFO L226 Difference]: Without dead ends: 204 [2022-07-14 06:22:15,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=179, Invalid=754, Unknown=1, NotChecked=58, Total=992 [2022-07-14 06:22:15,580 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 171 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:15,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 196 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 423 Invalid, 0 Unknown, 221 Unchecked, 1.0s Time] [2022-07-14 06:22:15,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-14 06:22:15,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 158. [2022-07-14 06:22:15,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 147 states have (on average 1.2857142857142858) internal successors, (189), 157 states have internal predecessors, (189), 0 states have call successors, (0), 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:22:15,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 189 transitions. [2022-07-14 06:22:15,584 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 189 transitions. Word has length 25 [2022-07-14 06:22:15,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:15,585 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 189 transitions. [2022-07-14 06:22:15,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.5789473684210527) internal successors, (49), 20 states have internal predecessors, (49), 0 states have call successors, (0), 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:22:15,585 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 189 transitions. [2022-07-14 06:22:15,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 06:22:15,586 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:15,586 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] [2022-07-14 06:22:15,594 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:22:15,791 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:22:15,791 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:22:15,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:15,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1807946471, now seen corresponding path program 1 times [2022-07-14 06:22:15,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:22:15,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [752085617] [2022-07-14 06:22:15,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:15,793 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:22:15,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:22:15,794 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:22:15,799 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:22:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:15,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 06:22:15,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:15,929 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 13 treesize of output 9 [2022-07-14 06:22:15,978 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:22:15,989 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:15,989 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:22:15,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:22:15,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [752085617] [2022-07-14 06:22:15,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [752085617] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:15,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:15,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:22:15,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632694139] [2022-07-14 06:22:15,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:15,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:22:15,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:22:15,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:22:15,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:22:15,991 INFO L87 Difference]: Start difference. First operand 158 states and 189 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:16,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:16,266 INFO L93 Difference]: Finished difference Result 173 states and 200 transitions. [2022-07-14 06:22:16,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:22:16,266 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-14 06:22:16,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:16,267 INFO L225 Difference]: With dead ends: 173 [2022-07-14 06:22:16,267 INFO L226 Difference]: Without dead ends: 173 [2022-07-14 06:22:16,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:22:16,268 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 41 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:16,268 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 141 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:22:16,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-07-14 06:22:16,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 154. [2022-07-14 06:22:16,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 143 states have (on average 1.2727272727272727) internal successors, (182), 153 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:16,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 182 transitions. [2022-07-14 06:22:16,272 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 182 transitions. Word has length 26 [2022-07-14 06:22:16,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:16,272 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 182 transitions. [2022-07-14 06:22:16,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:16,273 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 182 transitions. [2022-07-14 06:22:16,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 06:22:16,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:16,273 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:22:16,281 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:22:16,479 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:22:16,479 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:22:16,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:16,480 INFO L85 PathProgramCache]: Analyzing trace with hash 839765447, now seen corresponding path program 1 times [2022-07-14 06:22:16,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:22:16,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095755460] [2022-07-14 06:22:16,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:16,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:22:16,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:22:16,481 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:22:16,485 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:22:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:16,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 06:22:16,603 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:16,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:22:16,629 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:22:16,630 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:22:16,649 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 13 treesize of output 9 [2022-07-14 06:22:16,735 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 16 treesize of output 8 [2022-07-14 06:22:16,760 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:22:16,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:16,773 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:22:16,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:22:16,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095755460] [2022-07-14 06:22:16,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095755460] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:22:16,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:22:16,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:22:16,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629187062] [2022-07-14 06:22:16,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:22:16,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:22:16,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:22:16,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:22:16,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:22:16,775 INFO L87 Difference]: Start difference. First operand 154 states and 182 transitions. Second operand has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:17,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:17,127 INFO L93 Difference]: Finished difference Result 171 states and 196 transitions. [2022-07-14 06:22:17,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 06:22:17,127 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-14 06:22:17,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:17,128 INFO L225 Difference]: With dead ends: 171 [2022-07-14 06:22:17,128 INFO L226 Difference]: Without dead ends: 171 [2022-07-14 06:22:17,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-07-14 06:22:17,129 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 60 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:17,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 77 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:22:17,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-14 06:22:17,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 154. [2022-07-14 06:22:17,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 143 states have (on average 1.2587412587412588) internal successors, (180), 153 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:17,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 180 transitions. [2022-07-14 06:22:17,134 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 180 transitions. Word has length 26 [2022-07-14 06:22:17,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:17,134 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 180 transitions. [2022-07-14 06:22:17,134 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:17,134 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 180 transitions. [2022-07-14 06:22:17,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-14 06:22:17,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:17,135 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:22:17,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-14 06:22:17,345 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:22:17,345 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:22:17,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:17,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1834274759, now seen corresponding path program 1 times [2022-07-14 06:22:17,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:22:17,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1181674745] [2022-07-14 06:22:17,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:17,346 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:22:17,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:22:17,347 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:22:17,349 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:22:17,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:17,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-14 06:22:17,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:17,547 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 06:22:17,548 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 18 treesize of output 25 [2022-07-14 06:22:17,639 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-14 06:22:17,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2022-07-14 06:22:17,663 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 11 treesize of output 7 [2022-07-14 06:22:17,697 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:22:17,698 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2022-07-14 06:22:17,739 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-14 06:22:17,739 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 37 treesize of output 28 [2022-07-14 06:22:17,792 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 31 treesize of output 15 [2022-07-14 06:22:17,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:17,896 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:22:18,014 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_725 (Array (_ BitVec 32) (_ BitVec 32)))) (bvult (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~list~0#1.base| v_ArrVal_725) |c_ULTIMATE.start_main_~y~0#1.base|) |c_ULTIMATE.start_main_~y~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2022-07-14 06:22:18,020 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:22:18,021 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 1 case distinctions, treesize of input 18 treesize of output 19 [2022-07-14 06:22:18,023 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 30 treesize of output 22 [2022-07-14 06:22:18,027 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 7 [2022-07-14 06:22:18,194 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:18,194 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:22:18,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1181674745] [2022-07-14 06:22:18,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1181674745] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:22:18,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:22:18,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2022-07-14 06:22:18,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148840498] [2022-07-14 06:22:18,195 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:22:18,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-14 06:22:18,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:22:18,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-14 06:22:18,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=321, Unknown=1, NotChecked=36, Total=420 [2022-07-14 06:22:18,196 INFO L87 Difference]: Start difference. First operand 154 states and 180 transitions. Second operand has 21 states, 20 states have (on average 2.8) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 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:22:19,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:22:19,218 INFO L93 Difference]: Finished difference Result 194 states and 226 transitions. [2022-07-14 06:22:19,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 06:22:19,219 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.8) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-14 06:22:19,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:22:19,220 INFO L225 Difference]: With dead ends: 194 [2022-07-14 06:22:19,220 INFO L226 Difference]: Without dead ends: 194 [2022-07-14 06:22:19,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=196, Invalid=863, Unknown=1, NotChecked=62, Total=1122 [2022-07-14 06:22:19,221 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 85 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 158 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:22:19,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 192 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 372 Invalid, 0 Unknown, 158 Unchecked, 0.6s Time] [2022-07-14 06:22:19,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-07-14 06:22:19,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 176. [2022-07-14 06:22:19,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 165 states have (on average 1.303030303030303) internal successors, (215), 175 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:22:19,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 215 transitions. [2022-07-14 06:22:19,226 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 215 transitions. Word has length 28 [2022-07-14 06:22:19,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:22:19,226 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 215 transitions. [2022-07-14 06:22:19,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.8) internal successors, (56), 21 states have internal predecessors, (56), 0 states have call successors, (0), 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:22:19,226 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 215 transitions. [2022-07-14 06:22:19,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-14 06:22:19,227 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:22:19,227 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] [2022-07-14 06:22:19,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-14 06:22:19,437 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:22:19,437 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-07-14 06:22:19,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:22:19,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1834263774, now seen corresponding path program 1 times [2022-07-14 06:22:19,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:22:19,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [625783849] [2022-07-14 06:22:19,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:22:19,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:22:19,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:22:19,440 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:22:19,442 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:22:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:22:19,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-14 06:22:19,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:22:19,614 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:22:19,628 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:22:19,637 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 13 treesize of output 9 [2022-07-14 06:22:19,683 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:22:19,683 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 12 [2022-07-14 06:22:19,716 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:22:19,724 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 21 treesize of output 20 [2022-07-14 06:22:19,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:22:19,773 INFO L356 Elim1Store]: treesize reduction 55, result has 11.3 percent of original size [2022-07-14 06:22:19,773 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 103 treesize of output 80 [2022-07-14 06:22:19,784 INFO L356 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2022-07-14 06:22:19,784 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 77 treesize of output 65 [2022-07-14 06:22:19,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:22:19,833 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 32 treesize of output 34 [2022-07-14 06:22:19,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:22:19,850 INFO L356 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-07-14 06:22:19,851 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 48 treesize of output 41 [2022-07-14 06:22:20,163 INFO L356 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2022-07-14 06:22:20,163 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 1 case distinctions, treesize of input 35 treesize of output 16 [2022-07-14 06:22:20,168 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:22:20,177 INFO L356 Elim1Store]: treesize reduction 32, result has 8.6 percent of original size [2022-07-14 06:22:20,178 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 20 [2022-07-14 06:22:20,210 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:22:20,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:22:58,540 WARN L233 SmtUtils]: Spent 8.65s on a formula simplification that was a NOOP. DAG size: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-14 06:23:00,709 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~y~0#1.base_65| (_ BitVec 32))) (or (and (forall ((v_ArrVal_779 (_ BitVec 32)) (|ULTIMATE.start_main_~y~0#1.offset| (_ BitVec 32)) (v_ArrVal_783 (_ BitVec 32)) (v_ArrVal_780 (_ BitVec 32))) (let ((.cse4 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse0 (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~y~0#1.base_65| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~y~0#1.base_65|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|)))) (store .cse5 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_780))))) (let ((.cse1 (select .cse0 |v_ULTIMATE.start_main_~y~0#1.base_65|))) (let ((.cse2 (select .cse1 |ULTIMATE.start_main_~y~0#1.offset|))) (= (select (select (store .cse0 |v_ULTIMATE.start_main_~y~0#1.base_65| (store .cse1 (bvadd (_ bv8 32) |ULTIMATE.start_main_~y~0#1.offset|) v_ArrVal_783)) .cse2) (bvadd (_ bv8 32) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~y~0#1.base_65| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~y~0#1.base_65|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|)))) (store .cse3 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse3 |c_ULTIMATE.start_main_~list~0#1.base|) .cse4 v_ArrVal_779))) |v_ULTIMATE.start_main_~y~0#1.base_65|) |ULTIMATE.start_main_~y~0#1.offset|))) .cse2)))))) (forall ((v_ArrVal_779 (_ BitVec 32)) (|ULTIMATE.start_main_~y~0#1.offset| (_ BitVec 32)) (v_ArrVal_784 (_ BitVec 32)) (v_ArrVal_780 (_ BitVec 32))) (let ((.cse9 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~list~0#1.offset|))) (let ((.cse6 (let ((.cse11 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~y~0#1.base_65| (store (select |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~y~0#1.base_65|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.offset|)))) (store .cse11 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~list~0#1.base|) .cse9 v_ArrVal_779))))) (let ((.cse7 (select .cse6 |v_ULTIMATE.start_main_~y~0#1.base_65|))) (let ((.cse10 (select .cse7 |ULTIMATE.start_main_~y~0#1.offset|))) (= (select (select (store .cse6 |v_ULTIMATE.start_main_~y~0#1.base_65| (store .cse7 (bvadd (_ bv8 32) |ULTIMATE.start_main_~y~0#1.offset|) v_ArrVal_784)) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~y~0#1.base_65| (store (select |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~y~0#1.base_65|) |ULTIMATE.start_main_~y~0#1.offset| |c_ULTIMATE.start_main_~list~0#1.base|)))) (store .cse8 |c_ULTIMATE.start_main_~list~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~list~0#1.base|) .cse9 v_ArrVal_780))) |v_ULTIMATE.start_main_~y~0#1.base_65|) |ULTIMATE.start_main_~y~0#1.offset|)) (bvadd (_ bv8 32) .cse10)) (bvadd (_ bv12 32) .cse10)))))))) (not (= (bvneg (select |c_#valid| |v_ULTIMATE.start_main_~y~0#1.base_65|)) (_ bv0 1))))) is different from false [2022-07-14 06:23:24,234 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:23:24,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16412 treesize of output 15748 [2022-07-14 06:23:24,889 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:23:24,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [625783849] [2022-07-14 06:23:24,890 WARN L319 FreeRefinementEngine]: Global settings require throwing the following exception [2022-07-14 06:23:24,905 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:23:25,101 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:23:25,102 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$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.QuantifierPushUtilsForLocalEliminatees.pushLocalEliminateeSetToDualJunct(QuantifierPushUtilsForLocalEliminatees.java:129) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtilsForLocalEliminatees.pushLocalEliminateesOverCorrespondingFiniteJunction(QuantifierPushUtilsForLocalEliminatees.java:83) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPushUtils.preprocessDualFiniteJunction(QuantifierPushUtils.java:187) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:326) 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.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.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) 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:23:25,106 INFO L158 Benchmark]: Toolchain (without parser) took 87564.88ms. Allocated memory was 52.4MB in the beginning and 79.7MB in the end (delta: 27.3MB). Free memory was 28.4MB in the beginning and 53.8MB in the end (delta: -25.5MB). Peak memory consumption was 38.5MB. Max. memory is 16.1GB. [2022-07-14 06:23:25,106 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 52.4MB. Free memory was 33.9MB in the beginning and 33.9MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:23:25,106 INFO L158 Benchmark]: CACSL2BoogieTranslator took 461.91ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 28.2MB in the beginning and 41.5MB in the end (delta: -13.3MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. [2022-07-14 06:23:25,107 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.39ms. Allocated memory is still 65.0MB. Free memory was 41.3MB in the beginning and 39.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 06:23:25,107 INFO L158 Benchmark]: Boogie Preprocessor took 39.84ms. Allocated memory is still 65.0MB. Free memory was 39.3MB in the beginning and 37.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 06:23:25,107 INFO L158 Benchmark]: RCFGBuilder took 507.41ms. Allocated memory is still 65.0MB. Free memory was 37.8MB in the beginning and 37.3MB in the end (delta: 511.6kB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. [2022-07-14 06:23:25,107 INFO L158 Benchmark]: TraceAbstraction took 86473.17ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 36.6MB in the beginning and 53.8MB in the end (delta: -17.2MB). Peak memory consumption was 32.7MB. Max. memory is 16.1GB. [2022-07-14 06:23:25,108 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.28ms. Allocated memory is still 52.4MB. Free memory was 33.9MB in the beginning and 33.9MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 461.91ms. Allocated memory was 52.4MB in the beginning and 65.0MB in the end (delta: 12.6MB). Free memory was 28.2MB in the beginning and 41.5MB in the end (delta: -13.3MB). Peak memory consumption was 3.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.39ms. Allocated memory is still 65.0MB. Free memory was 41.3MB in the beginning and 39.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.84ms. Allocated memory is still 65.0MB. Free memory was 39.3MB in the beginning and 37.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 507.41ms. Allocated memory is still 65.0MB. Free memory was 37.8MB in the beginning and 37.3MB in the end (delta: 511.6kB). Peak memory consumption was 10.4MB. Max. memory is 16.1GB. * TraceAbstraction took 86473.17ms. Allocated memory was 65.0MB in the beginning and 79.7MB in the end (delta: 14.7MB). Free memory was 36.6MB in the beginning and 53.8MB in the end (delta: -17.2MB). Peak memory consumption was 32.7MB. 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:23:25,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range