./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-circular-2.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/forester-heap/dll-circular-2.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 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:39:42,171 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:39:42,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:39:42,235 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:39:42,236 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:39:42,237 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:39:42,240 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:39:42,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:39:42,246 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:39:42,251 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:39:42,252 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:39:42,254 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:39:42,254 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:39:42,256 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:39:42,258 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:39:42,259 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:39:42,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:39:42,261 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:39:42,263 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:39:42,268 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:39:42,270 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:39:42,271 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:39:42,272 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:39:42,272 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:39:42,274 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:39:42,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:39:42,280 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:39:42,281 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:39:42,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:39:42,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:39:42,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:39:42,285 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:39:42,286 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:39:42,287 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:39:42,287 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:39:42,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:39:42,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:39:42,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:39:42,289 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:39:42,289 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:39:42,290 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:39:42,291 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:39:42,292 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:39:42,324 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:39:42,324 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:39:42,324 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:39:42,325 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:39:42,326 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:39:42,326 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:39:42,327 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:39:42,327 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:39:42,327 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:39:42,328 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:39:42,328 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:39:42,328 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:39:42,329 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:39:42,329 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:39:42,329 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:39:42,329 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:39:42,329 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:39:42,330 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:39:42,331 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:39:42,331 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:39:42,331 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:39:42,331 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:39:42,332 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:39:42,332 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:39:42,332 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:39:42,332 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:39:42,332 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:39:42,333 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:39:42,333 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 06:39:42,333 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 06:39:42,333 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 -> 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c [2022-07-14 06:39:42,556 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:39:42,589 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:39:42,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:39:42,592 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:39:42,593 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:39:42,594 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-circular-2.i [2022-07-14 06:39:42,642 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90f3cf853/f6dc7207bc654703985d3eb19c7c79c6/FLAG41d2f8e28 [2022-07-14 06:39:43,056 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:39:43,057 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i [2022-07-14 06:39:43,080 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90f3cf853/f6dc7207bc654703985d3eb19c7c79c6/FLAG41d2f8e28 [2022-07-14 06:39:43,449 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/90f3cf853/f6dc7207bc654703985d3eb19c7c79c6 [2022-07-14 06:39:43,451 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:39:43,452 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:39:43,454 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:39:43,454 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:39:43,456 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:39:43,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:39:43" (1/1) ... [2022-07-14 06:39:43,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@614f1463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:39:43, skipping insertion in model container [2022-07-14 06:39:43,458 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:39:43" (1/1) ... [2022-07-14 06:39:43,464 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:39:43,508 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:39:43,748 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22391,22404] [2022-07-14 06:39:43,751 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22497,22510] [2022-07-14 06:39:43,752 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22622,22635] [2022-07-14 06:39:43,756 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:39:43,766 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:39:43,799 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22391,22404] [2022-07-14 06:39:43,801 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22497,22510] [2022-07-14 06:39:43,802 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22622,22635] [2022-07-14 06:39:43,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:39:43,829 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:39:43,830 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:39:43 WrapperNode [2022-07-14 06:39:43,830 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:39:43,831 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:39:43,831 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:39:43,831 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:39:43,837 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:39:43" (1/1) ... [2022-07-14 06:39:43,863 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:39:43" (1/1) ... [2022-07-14 06:39:43,887 INFO L137 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 123 [2022-07-14 06:39:43,887 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:39:43,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:39:43,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:39:43,888 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:39:43,894 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:39:43" (1/1) ... [2022-07-14 06:39:43,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:39:43" (1/1) ... [2022-07-14 06:39:43,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:39:43" (1/1) ... [2022-07-14 06:39:43,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:39:43" (1/1) ... [2022-07-14 06:39:43,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:39:43" (1/1) ... [2022-07-14 06:39:43,926 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:39:43" (1/1) ... [2022-07-14 06:39:43,927 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:39:43" (1/1) ... [2022-07-14 06:39:43,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:39:43,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:39:43,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:39:43,929 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:39:43,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:39:43" (1/1) ... [2022-07-14 06:39:43,948 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:39:43,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:39:43,972 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:39:43,990 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:39:44,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 06:39:44,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 06:39:44,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:39:44,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:39:44,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:39:44,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:39:44,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:39:44,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 06:39:44,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:39:44,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:39:44,097 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:39:44,098 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:39:44,450 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:39:44,456 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:39:44,456 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-07-14 06:39:44,458 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:39:44 BoogieIcfgContainer [2022-07-14 06:39:44,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:39:44,471 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:39:44,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:39:44,477 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:39:44,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:39:43" (1/3) ... [2022-07-14 06:39:44,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3377e46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:39:44, skipping insertion in model container [2022-07-14 06:39:44,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:39:43" (2/3) ... [2022-07-14 06:39:44,478 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3377e46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:39:44, skipping insertion in model container [2022-07-14 06:39:44,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:39:44" (3/3) ... [2022-07-14 06:39:44,480 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2022-07-14 06:39:44,492 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:39:44,493 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2022-07-14 06:39:44,531 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:39:44,537 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@6e0d1413, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5fee321d [2022-07-14 06:39:44,537 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2022-07-14 06:39:44,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 112 states, 59 states have (on average 2.2033898305084745) internal successors, (130), 111 states have internal predecessors, (130), 0 states have call successors, (0), 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:39:44,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:39:44,568 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:44,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:39:44,570 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:44,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:44,574 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-14 06:39:44,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:44,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044122702] [2022-07-14 06:39:44,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:44,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:44,710 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:39:44,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:44,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044122702] [2022-07-14 06:39:44,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044122702] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:44,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:44,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:39:44,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762041682] [2022-07-14 06:39:44,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:44,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:39:44,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:44,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:39:44,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:39:44,745 INFO L87 Difference]: Start difference. First operand has 112 states, 59 states have (on average 2.2033898305084745) internal successors, (130), 111 states have internal predecessors, (130), 0 states have call successors, (0), 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:39:44,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:44,856 INFO L93 Difference]: Finished difference Result 117 states and 124 transitions. [2022-07-14 06:39:44,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:39:44,858 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:39:44,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:44,865 INFO L225 Difference]: With dead ends: 117 [2022-07-14 06:39:44,866 INFO L226 Difference]: Without dead ends: 115 [2022-07-14 06:39:44,867 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:39:44,870 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 95 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:44,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 80 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:44,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-14 06:39:44,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2022-07-14 06:39:44,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 58 states have (on average 1.9137931034482758) internal successors, (111), 104 states have internal predecessors, (111), 0 states have call successors, (0), 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:39:44,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 111 transitions. [2022-07-14 06:39:44,902 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 111 transitions. Word has length 3 [2022-07-14 06:39:44,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:44,903 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 111 transitions. [2022-07-14 06:39:44,903 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:39:44,903 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 111 transitions. [2022-07-14 06:39:44,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:39:44,903 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:44,904 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:39:44,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 06:39:44,904 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:44,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:44,905 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-14 06:39:44,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:44,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628716014] [2022-07-14 06:39:44,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:44,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:44,973 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:39:44,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:44,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628716014] [2022-07-14 06:39:44,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628716014] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:44,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:44,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:39:44,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265914104] [2022-07-14 06:39:44,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:44,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:39:44,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:44,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:39:44,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:39:44,979 INFO L87 Difference]: Start difference. First operand 105 states and 111 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:39:45,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:45,064 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2022-07-14 06:39:45,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:39:45,065 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:39:45,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:45,068 INFO L225 Difference]: With dead ends: 112 [2022-07-14 06:39:45,068 INFO L226 Difference]: Without dead ends: 112 [2022-07-14 06:39:45,068 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:39:45,069 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 92 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:45,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 80 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:45,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-14 06:39:45,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 100. [2022-07-14 06:39:45,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 58 states have (on average 1.8275862068965518) internal successors, (106), 99 states have internal predecessors, (106), 0 states have call successors, (0), 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:39:45,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2022-07-14 06:39:45,088 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 3 [2022-07-14 06:39:45,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:45,090 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2022-07-14 06:39:45,090 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:39:45,090 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2022-07-14 06:39:45,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-14 06:39:45,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:45,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:45,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 06:39:45,092 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:45,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:45,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112040, now seen corresponding path program 1 times [2022-07-14 06:39:45,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:45,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738087338] [2022-07-14 06:39:45,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:45,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:45,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:45,160 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:39:45,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:45,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738087338] [2022-07-14 06:39:45,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738087338] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:45,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:45,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:39:45,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394433758] [2022-07-14 06:39:45,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:45,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:39:45,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:45,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:39:45,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:39:45,165 INFO L87 Difference]: Start difference. First operand 100 states and 106 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:39:45,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:45,256 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2022-07-14 06:39:45,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:39:45,257 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:39:45,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:45,259 INFO L225 Difference]: With dead ends: 97 [2022-07-14 06:39:45,259 INFO L226 Difference]: Without dead ends: 97 [2022-07-14 06:39:45,261 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:39:45,263 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 149 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:45,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 54 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:45,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-14 06:39:45,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 88. [2022-07-14 06:39:45,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 58 states have (on average 1.6206896551724137) internal successors, (94), 87 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:45,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2022-07-14 06:39:45,278 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 9 [2022-07-14 06:39:45,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:45,278 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2022-07-14 06:39:45,279 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:39:45,279 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2022-07-14 06:39:45,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-14 06:39:45,280 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:45,280 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:45,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 06:39:45,280 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:45,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:45,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112041, now seen corresponding path program 1 times [2022-07-14 06:39:45,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:45,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382249007] [2022-07-14 06:39:45,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:45,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:45,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:45,341 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:39:45,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:45,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382249007] [2022-07-14 06:39:45,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382249007] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:45,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:45,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:39:45,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207893070] [2022-07-14 06:39:45,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:45,342 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:39:45,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:45,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:39:45,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:39:45,343 INFO L87 Difference]: Start difference. First operand 88 states and 94 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:39:45,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:45,452 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2022-07-14 06:39:45,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:39:45,453 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:39:45,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:45,454 INFO L225 Difference]: With dead ends: 113 [2022-07-14 06:39:45,454 INFO L226 Difference]: Without dead ends: 113 [2022-07-14 06:39:45,454 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:39:45,460 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 103 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:45,461 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 101 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:45,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-14 06:39:45,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 97. [2022-07-14 06:39:45,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 67 states have (on average 1.5820895522388059) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 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:39:45,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-07-14 06:39:45,474 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 9 [2022-07-14 06:39:45,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:45,475 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-07-14 06:39:45,475 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:39:45,475 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-07-14 06:39:45,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 06:39:45,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:45,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:45,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 06:39:45,477 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:45,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:45,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2022-07-14 06:39:45,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:45,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67207827] [2022-07-14 06:39:45,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:45,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:45,545 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:39:45,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:45,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67207827] [2022-07-14 06:39:45,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67207827] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:45,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:45,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:39:45,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601174086] [2022-07-14 06:39:45,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:45,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:39:45,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:45,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:39:45,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:39:45,547 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:45,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:45,667 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2022-07-14 06:39:45,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:39:45,667 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-14 06:39:45,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:45,668 INFO L225 Difference]: With dead ends: 96 [2022-07-14 06:39:45,668 INFO L226 Difference]: Without dead ends: 96 [2022-07-14 06:39:45,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:39:45,668 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 6 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:45,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 224 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:45,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-14 06:39:45,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2022-07-14 06:39:45,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 67 states have (on average 1.5522388059701493) internal successors, (104), 95 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:39:45,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 104 transitions. [2022-07-14 06:39:45,671 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 104 transitions. Word has length 12 [2022-07-14 06:39:45,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:45,671 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 104 transitions. [2022-07-14 06:39:45,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:45,671 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 104 transitions. [2022-07-14 06:39:45,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 06:39:45,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:45,671 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:45,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 06:39:45,671 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:45,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:45,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2022-07-14 06:39:45,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:45,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010285661] [2022-07-14 06:39:45,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:45,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:45,711 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:39:45,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:45,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010285661] [2022-07-14 06:39:45,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010285661] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:45,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:45,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:39:45,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302851879] [2022-07-14 06:39:45,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:45,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:39:45,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:45,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:39:45,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:39:45,713 INFO L87 Difference]: Start difference. First operand 96 states and 104 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:45,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:45,809 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2022-07-14 06:39:45,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:39:45,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-14 06:39:45,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:45,810 INFO L225 Difference]: With dead ends: 95 [2022-07-14 06:39:45,810 INFO L226 Difference]: Without dead ends: 95 [2022-07-14 06:39:45,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:39:45,811 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 7 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:45,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 229 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:45,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-14 06:39:45,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2022-07-14 06:39:45,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 94 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:45,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2022-07-14 06:39:45,814 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 12 [2022-07-14 06:39:45,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:45,814 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2022-07-14 06:39:45,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:45,814 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2022-07-14 06:39:45,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 06:39:45,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:45,815 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:45,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 06:39:45,815 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:45,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:45,815 INFO L85 PathProgramCache]: Analyzing trace with hash 683852107, now seen corresponding path program 1 times [2022-07-14 06:39:45,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:45,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827530795] [2022-07-14 06:39:45,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:45,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:45,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:45,917 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:39:45,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:45,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827530795] [2022-07-14 06:39:45,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827530795] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:45,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:45,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:39:45,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975519864] [2022-07-14 06:39:45,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:45,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:39:45,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:45,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:39:45,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:39:45,919 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:46,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:46,097 INFO L93 Difference]: Finished difference Result 178 states and 189 transitions. [2022-07-14 06:39:46,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:39:46,097 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-14 06:39:46,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:46,098 INFO L225 Difference]: With dead ends: 178 [2022-07-14 06:39:46,098 INFO L226 Difference]: Without dead ends: 178 [2022-07-14 06:39:46,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:39:46,099 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 356 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:46,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 286 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:46,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-14 06:39:46,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 98. [2022-07-14 06:39:46,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 70 states have (on average 1.5) internal successors, (105), 97 states have internal predecessors, (105), 0 states have call successors, (0), 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:39:46,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2022-07-14 06:39:46,101 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 13 [2022-07-14 06:39:46,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:46,102 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2022-07-14 06:39:46,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 8 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:46,102 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2022-07-14 06:39:46,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 06:39:46,102 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:46,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:46,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 06:39:46,103 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:46,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:46,103 INFO L85 PathProgramCache]: Analyzing trace with hash -275416990, now seen corresponding path program 1 times [2022-07-14 06:39:46,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:46,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175899398] [2022-07-14 06:39:46,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:46,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:46,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:46,196 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:39:46,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:46,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175899398] [2022-07-14 06:39:46,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175899398] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:46,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:46,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:39:46,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609735683] [2022-07-14 06:39:46,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:46,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:39:46,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:46,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:39:46,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:39:46,198 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 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:39:46,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:46,409 INFO L93 Difference]: Finished difference Result 140 states and 149 transitions. [2022-07-14 06:39:46,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:39:46,410 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 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:39:46,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:46,411 INFO L225 Difference]: With dead ends: 140 [2022-07-14 06:39:46,411 INFO L226 Difference]: Without dead ends: 140 [2022-07-14 06:39:46,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:39:46,412 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 314 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:46,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 210 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:46,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-14 06:39:46,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 100. [2022-07-14 06:39:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 72 states have (on average 1.5) internal successors, (108), 99 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2022-07-14 06:39:46,415 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 14 [2022-07-14 06:39:46,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:46,415 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2022-07-14 06:39:46,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 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:39:46,415 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2022-07-14 06:39:46,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-14 06:39:46,416 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:46,416 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:46,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 06:39:46,416 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:46,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:46,417 INFO L85 PathProgramCache]: Analyzing trace with hash -275416989, now seen corresponding path program 1 times [2022-07-14 06:39:46,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:46,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735157324] [2022-07-14 06:39:46,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:46,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:46,545 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:39:46,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:46,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735157324] [2022-07-14 06:39:46,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735157324] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:46,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:46,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:39:46,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644294522] [2022-07-14 06:39:46,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:46,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:39:46,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:46,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:39:46,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:39:46,547 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 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:39:46,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:46,781 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2022-07-14 06:39:46,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:39:46,782 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 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:39:46,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:46,782 INFO L225 Difference]: With dead ends: 172 [2022-07-14 06:39:46,782 INFO L226 Difference]: Without dead ends: 172 [2022-07-14 06:39:46,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:39:46,783 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 184 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:46,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 270 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:39:46,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-14 06:39:46,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 112. [2022-07-14 06:39:46,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 84 states have (on average 1.5) internal successors, (126), 111 states have internal predecessors, (126), 0 states have call successors, (0), 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:39:46,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 126 transitions. [2022-07-14 06:39:46,785 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 126 transitions. Word has length 14 [2022-07-14 06:39:46,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:46,786 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 126 transitions. [2022-07-14 06:39:46,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.0) internal successors, (14), 8 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:39:46,786 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 126 transitions. [2022-07-14 06:39:46,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:39:46,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:46,786 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:39:46,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 06:39:46,786 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:46,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:46,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2022-07-14 06:39:46,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:46,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809881820] [2022-07-14 06:39:46,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:46,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:46,857 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:39:46,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:46,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809881820] [2022-07-14 06:39:46,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809881820] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:46,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:46,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:39:46,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452928168] [2022-07-14 06:39:46,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:46,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:39:46,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:46,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:39:46,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:39:46,858 INFO L87 Difference]: Start difference. First operand 112 states and 126 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:47,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:47,094 INFO L93 Difference]: Finished difference Result 120 states and 135 transitions. [2022-07-14 06:39:47,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 06:39:47,094 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 06:39:47,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:47,095 INFO L225 Difference]: With dead ends: 120 [2022-07-14 06:39:47,095 INFO L226 Difference]: Without dead ends: 120 [2022-07-14 06:39:47,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-07-14 06:39:47,096 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 167 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:47,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 191 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:39:47,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-14 06:39:47,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 111. [2022-07-14 06:39:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 84 states have (on average 1.4880952380952381) internal successors, (125), 110 states have internal predecessors, (125), 0 states have call successors, (0), 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:39:47,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2022-07-14 06:39:47,098 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 16 [2022-07-14 06:39:47,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:47,099 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2022-07-14 06:39:47,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:47,099 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2022-07-14 06:39:47,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:39:47,099 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:47,099 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:39:47,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 06:39:47,099 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:47,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:47,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2022-07-14 06:39:47,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:47,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274462720] [2022-07-14 06:39:47,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:47,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:47,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:47,213 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:39:47,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:47,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274462720] [2022-07-14 06:39:47,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274462720] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:47,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:47,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:39:47,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306865823] [2022-07-14 06:39:47,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:47,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:39:47,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:47,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:39:47,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:39:47,215 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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:39:47,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:47,586 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2022-07-14 06:39:47,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 06:39:47,587 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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:39:47,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:47,587 INFO L225 Difference]: With dead ends: 115 [2022-07-14 06:39:47,587 INFO L226 Difference]: Without dead ends: 115 [2022-07-14 06:39:47,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-07-14 06:39:47,588 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 158 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:47,588 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 240 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:39:47,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-14 06:39:47,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2022-07-14 06:39:47,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.4487179487179487) internal successors, (113), 98 states have internal predecessors, (113), 0 states have call successors, (0), 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:39:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2022-07-14 06:39:47,590 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 16 [2022-07-14 06:39:47,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:47,590 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2022-07-14 06:39:47,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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:39:47,590 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2022-07-14 06:39:47,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:39:47,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:47,591 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:47,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 06:39:47,591 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:47,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:47,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1559926215, now seen corresponding path program 1 times [2022-07-14 06:39:47,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:47,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277164263] [2022-07-14 06:39:47,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:47,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:47,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:47,696 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:39:47,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:47,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277164263] [2022-07-14 06:39:47,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277164263] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:47,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:47,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:39:47,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941910509] [2022-07-14 06:39:47,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:47,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:39:47,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:47,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:39:47,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:39:47,698 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 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:39:47,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:47,965 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2022-07-14 06:39:47,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:39:47,965 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 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:39:47,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:47,966 INFO L225 Difference]: With dead ends: 147 [2022-07-14 06:39:47,966 INFO L226 Difference]: Without dead ends: 147 [2022-07-14 06:39:47,966 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:39:47,967 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 333 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:47,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 319 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:39:47,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-14 06:39:47,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 99. [2022-07-14 06:39:47,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.435897435897436) internal successors, (112), 98 states have internal predecessors, (112), 0 states have call successors, (0), 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:39:47,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2022-07-14 06:39:47,969 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 17 [2022-07-14 06:39:47,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:47,969 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2022-07-14 06:39:47,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 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:39:47,969 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2022-07-14 06:39:47,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:39:47,969 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:47,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:47,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 06:39:47,970 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:47,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:47,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1559926214, now seen corresponding path program 1 times [2022-07-14 06:39:47,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:47,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863928252] [2022-07-14 06:39:47,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:47,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:47,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:48,113 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:39:48,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:48,113 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863928252] [2022-07-14 06:39:48,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863928252] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:48,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:48,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:39:48,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538480435] [2022-07-14 06:39:48,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:48,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:39:48,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:48,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:39:48,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:39:48,115 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:48,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:48,349 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-07-14 06:39:48,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:39:48,350 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-14 06:39:48,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:48,350 INFO L225 Difference]: With dead ends: 157 [2022-07-14 06:39:48,350 INFO L226 Difference]: Without dead ends: 157 [2022-07-14 06:39:48,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:39:48,351 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 181 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:48,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 240 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:39:48,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-14 06:39:48,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 99. [2022-07-14 06:39:48,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.4230769230769231) internal successors, (111), 98 states have internal predecessors, (111), 0 states have call successors, (0), 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:39:48,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2022-07-14 06:39:48,353 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 17 [2022-07-14 06:39:48,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:48,353 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2022-07-14 06:39:48,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:48,354 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2022-07-14 06:39:48,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 06:39:48,354 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:48,354 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:39:48,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 06:39:48,354 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:48,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:48,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1113087206, now seen corresponding path program 1 times [2022-07-14 06:39:48,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:48,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412454467] [2022-07-14 06:39:48,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:48,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:48,445 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:39:48,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:48,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412454467] [2022-07-14 06:39:48,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412454467] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:48,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:48,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:39:48,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633964708] [2022-07-14 06:39:48,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:48,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:39:48,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:48,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:39:48,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:39:48,448 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:48,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:48,610 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2022-07-14 06:39:48,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:39:48,611 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 06:39:48,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:48,612 INFO L225 Difference]: With dead ends: 138 [2022-07-14 06:39:48,612 INFO L226 Difference]: Without dead ends: 138 [2022-07-14 06:39:48,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:39:48,612 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 287 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 234 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:48,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 207 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:48,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-07-14 06:39:48,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 116. [2022-07-14 06:39:48,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 95 states have (on average 1.4947368421052631) internal successors, (142), 115 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:48,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 142 transitions. [2022-07-14 06:39:48,614 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 142 transitions. Word has length 18 [2022-07-14 06:39:48,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:48,615 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 142 transitions. [2022-07-14 06:39:48,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:48,615 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 142 transitions. [2022-07-14 06:39:48,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 06:39:48,615 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:48,615 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:39:48,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 06:39:48,615 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:48,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:48,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1113087205, now seen corresponding path program 1 times [2022-07-14 06:39:48,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:48,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817087548] [2022-07-14 06:39:48,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:48,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:48,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:39:48,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:48,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817087548] [2022-07-14 06:39:48,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817087548] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:48,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:48,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:39:48,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566631149] [2022-07-14 06:39:48,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:48,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:39:48,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:48,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:39:48,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:39:48,731 INFO L87 Difference]: Start difference. First operand 116 states and 142 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:48,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:48,926 INFO L93 Difference]: Finished difference Result 159 states and 173 transitions. [2022-07-14 06:39:48,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:39:48,926 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 06:39:48,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:48,927 INFO L225 Difference]: With dead ends: 159 [2022-07-14 06:39:48,927 INFO L226 Difference]: Without dead ends: 159 [2022-07-14 06:39:48,927 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:39:48,927 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 142 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:48,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 229 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:48,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-14 06:39:48,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 121. [2022-07-14 06:39:48,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 100 states have (on average 1.47) internal successors, (147), 120 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:39:48,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 147 transitions. [2022-07-14 06:39:48,930 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 147 transitions. Word has length 18 [2022-07-14 06:39:48,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:48,930 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 147 transitions. [2022-07-14 06:39:48,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:48,930 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 147 transitions. [2022-07-14 06:39:48,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:39:48,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:48,934 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:39:48,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 06:39:48,935 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:48,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:48,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1461687964, now seen corresponding path program 1 times [2022-07-14 06:39:48,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:48,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564408881] [2022-07-14 06:39:48,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:48,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:48,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:49,046 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:39:49,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:49,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564408881] [2022-07-14 06:39:49,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564408881] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:49,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:49,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:39:49,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316814630] [2022-07-14 06:39:49,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:49,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:39:49,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:49,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:39:49,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:39:49,048 INFO L87 Difference]: Start difference. First operand 121 states and 147 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:49,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:49,209 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2022-07-14 06:39:49,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:39:49,209 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-14 06:39:49,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:49,210 INFO L225 Difference]: With dead ends: 155 [2022-07-14 06:39:49,210 INFO L226 Difference]: Without dead ends: 155 [2022-07-14 06:39:49,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 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:39:49,211 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 135 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:49,211 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 335 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:49,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-14 06:39:49,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 122. [2022-07-14 06:39:49,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 121 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:49,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 148 transitions. [2022-07-14 06:39:49,213 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 148 transitions. Word has length 21 [2022-07-14 06:39:49,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:49,213 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 148 transitions. [2022-07-14 06:39:49,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:49,213 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 148 transitions. [2022-07-14 06:39:49,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:39:49,213 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:49,214 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:39:49,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 06:39:49,214 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:49,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:49,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1905376220, now seen corresponding path program 1 times [2022-07-14 06:39:49,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:49,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217675079] [2022-07-14 06:39:49,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:49,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:49,241 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:39:49,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:49,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217675079] [2022-07-14 06:39:49,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217675079] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:49,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:49,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:39:49,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257317994] [2022-07-14 06:39:49,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:49,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:39:49,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:49,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:39:49,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:39:49,243 INFO L87 Difference]: Start difference. First operand 122 states and 148 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:49,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:49,248 INFO L93 Difference]: Finished difference Result 125 states and 151 transitions. [2022-07-14 06:39:49,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:39:49,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-14 06:39:49,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:49,248 INFO L225 Difference]: With dead ends: 125 [2022-07-14 06:39:49,249 INFO L226 Difference]: Without dead ends: 125 [2022-07-14 06:39:49,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:39:49,249 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:49,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:39:49,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-14 06:39:49,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2022-07-14 06:39:49,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 104 states have (on average 1.4519230769230769) internal successors, (151), 124 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:49,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 151 transitions. [2022-07-14 06:39:49,252 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 151 transitions. Word has length 21 [2022-07-14 06:39:49,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:49,253 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 151 transitions. [2022-07-14 06:39:49,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:49,253 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 151 transitions. [2022-07-14 06:39:49,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:39:49,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:49,254 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:39:49,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 06:39:49,254 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:49,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:49,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2137291894, now seen corresponding path program 1 times [2022-07-14 06:39:49,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:49,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423357620] [2022-07-14 06:39:49,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:49,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:49,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:49,318 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:39:49,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:49,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423357620] [2022-07-14 06:39:49,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423357620] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:49,319 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:49,319 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:39:49,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871300363] [2022-07-14 06:39:49,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:49,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:39:49,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:49,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:39:49,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:39:49,320 INFO L87 Difference]: Start difference. First operand 125 states and 151 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:49,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:49,394 INFO L93 Difference]: Finished difference Result 124 states and 150 transitions. [2022-07-14 06:39:49,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:39:49,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-14 06:39:49,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:49,396 INFO L225 Difference]: With dead ends: 124 [2022-07-14 06:39:49,396 INFO L226 Difference]: Without dead ends: 124 [2022-07-14 06:39:49,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:39:49,398 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 190 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:49,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 99 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:49,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-14 06:39:49,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-07-14 06:39:49,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 103 states have (on average 1.4466019417475728) internal successors, (149), 122 states have internal predecessors, (149), 0 states have call successors, (0), 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:39:49,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 149 transitions. [2022-07-14 06:39:49,401 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 149 transitions. Word has length 21 [2022-07-14 06:39:49,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:49,401 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 149 transitions. [2022-07-14 06:39:49,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:49,402 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 149 transitions. [2022-07-14 06:39:49,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:39:49,405 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:49,405 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:39:49,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 06:39:49,405 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:49,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:49,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1062832435, now seen corresponding path program 1 times [2022-07-14 06:39:49,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:49,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845235865] [2022-07-14 06:39:49,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:49,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:49,446 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:39:49,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:49,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845235865] [2022-07-14 06:39:49,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845235865] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:49,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:49,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:39:49,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616971281] [2022-07-14 06:39:49,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:49,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:39:49,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:49,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:39:49,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:39:49,448 INFO L87 Difference]: Start difference. First operand 123 states and 149 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:49,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:49,520 INFO L93 Difference]: Finished difference Result 122 states and 146 transitions. [2022-07-14 06:39:49,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:39:49,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-14 06:39:49,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:49,521 INFO L225 Difference]: With dead ends: 122 [2022-07-14 06:39:49,521 INFO L226 Difference]: Without dead ends: 122 [2022-07-14 06:39:49,522 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:39:49,522 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 29 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:49,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 164 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:49,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-14 06:39:49,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2022-07-14 06:39:49,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 121 states have internal predecessors, (146), 0 states have call successors, (0), 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:39:49,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 146 transitions. [2022-07-14 06:39:49,525 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 146 transitions. Word has length 22 [2022-07-14 06:39:49,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:49,525 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 146 transitions. [2022-07-14 06:39:49,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:49,525 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 146 transitions. [2022-07-14 06:39:49,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:39:49,525 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:49,526 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:39:49,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-14 06:39:49,526 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:49,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:49,526 INFO L85 PathProgramCache]: Analyzing trace with hash -1062832434, now seen corresponding path program 1 times [2022-07-14 06:39:49,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:49,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622976041] [2022-07-14 06:39:49,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:49,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:49,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:49,659 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:39:49,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:49,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622976041] [2022-07-14 06:39:49,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622976041] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:49,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:49,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:39:49,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541117091] [2022-07-14 06:39:49,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:49,660 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:39:49,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:49,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:39:49,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:39:49,661 INFO L87 Difference]: Start difference. First operand 122 states and 146 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:49,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:49,918 INFO L93 Difference]: Finished difference Result 153 states and 164 transitions. [2022-07-14 06:39:49,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:39:49,918 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-14 06:39:49,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:49,919 INFO L225 Difference]: With dead ends: 153 [2022-07-14 06:39:49,919 INFO L226 Difference]: Without dead ends: 153 [2022-07-14 06:39:49,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2022-07-14 06:39:49,919 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 158 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:49,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 287 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:39:49,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-14 06:39:49,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 122. [2022-07-14 06:39:49,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.4077669902912622) internal successors, (145), 121 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:49,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 145 transitions. [2022-07-14 06:39:49,922 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 145 transitions. Word has length 22 [2022-07-14 06:39:49,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:49,922 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 145 transitions. [2022-07-14 06:39:49,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:49,922 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2022-07-14 06:39:49,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 06:39:49,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:49,922 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:39:49,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 06:39:49,922 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:49,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:49,923 INFO L85 PathProgramCache]: Analyzing trace with hash 227835007, now seen corresponding path program 1 times [2022-07-14 06:39:49,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:49,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097227913] [2022-07-14 06:39:49,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:49,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:49,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:50,033 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:39:50,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:50,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097227913] [2022-07-14 06:39:50,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097227913] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:50,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:50,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:39:50,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926224851] [2022-07-14 06:39:50,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:50,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:39:50,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:50,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:39:50,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:39:50,035 INFO L87 Difference]: Start difference. First operand 122 states and 145 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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:39:50,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:50,252 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2022-07-14 06:39:50,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:39:50,252 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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:39:50,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:50,253 INFO L225 Difference]: With dead ends: 140 [2022-07-14 06:39:50,253 INFO L226 Difference]: Without dead ends: 140 [2022-07-14 06:39:50,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:39:50,254 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 199 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:50,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 345 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:50,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-14 06:39:50,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2022-07-14 06:39:50,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 103 states have (on average 1.3980582524271845) internal successors, (144), 121 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:50,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 144 transitions. [2022-07-14 06:39:50,257 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 144 transitions. Word has length 23 [2022-07-14 06:39:50,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:50,257 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 144 transitions. [2022-07-14 06:39:50,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 9 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:39:50,257 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 144 transitions. [2022-07-14 06:39:50,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 06:39:50,258 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:50,258 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:39:50,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-14 06:39:50,258 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:50,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:50,259 INFO L85 PathProgramCache]: Analyzing trace with hash 779247630, now seen corresponding path program 1 times [2022-07-14 06:39:50,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:50,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204466118] [2022-07-14 06:39:50,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:50,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:50,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:50,294 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:39:50,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:50,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204466118] [2022-07-14 06:39:50,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204466118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:50,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:50,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:39:50,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343057586] [2022-07-14 06:39:50,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:50,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:39:50,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:50,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:39:50,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:39:50,296 INFO L87 Difference]: Start difference. First operand 122 states and 144 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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:39:50,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:50,408 INFO L93 Difference]: Finished difference Result 125 states and 146 transitions. [2022-07-14 06:39:50,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:39:50,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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:39:50,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:50,410 INFO L225 Difference]: With dead ends: 125 [2022-07-14 06:39:50,410 INFO L226 Difference]: Without dead ends: 125 [2022-07-14 06:39:50,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:39:50,411 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 76 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:50,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 159 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:50,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-07-14 06:39:50,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2022-07-14 06:39:50,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 104 states have (on average 1.3942307692307692) internal successors, (145), 122 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:50,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 145 transitions. [2022-07-14 06:39:50,413 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 145 transitions. Word has length 24 [2022-07-14 06:39:50,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:50,413 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 145 transitions. [2022-07-14 06:39:50,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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:39:50,413 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 145 transitions. [2022-07-14 06:39:50,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 06:39:50,413 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:50,414 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:39:50,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-14 06:39:50,414 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:50,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:50,414 INFO L85 PathProgramCache]: Analyzing trace with hash 779247631, now seen corresponding path program 1 times [2022-07-14 06:39:50,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:50,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390636946] [2022-07-14 06:39:50,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:50,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:50,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:50,537 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:39:50,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:50,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390636946] [2022-07-14 06:39:50,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390636946] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:39:50,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440884393] [2022-07-14 06:39:50,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:50,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:39:50,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:39:50,540 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:39:50,563 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:39:50,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:50,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-14 06:39:50,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:39:50,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-14 06:39:50,799 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:39:50,829 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:39:50,829 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:39:50,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440884393] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:50,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:39:50,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 14 [2022-07-14 06:39:50,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007491389] [2022-07-14 06:39:50,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:50,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:39:50,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:50,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:39:50,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2022-07-14 06:39:50,830 INFO L87 Difference]: Start difference. First operand 123 states and 145 transitions. Second operand has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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:39:50,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:50,979 INFO L93 Difference]: Finished difference Result 123 states and 142 transitions. [2022-07-14 06:39:50,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:39:50,979 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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:39:50,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:50,980 INFO L225 Difference]: With dead ends: 123 [2022-07-14 06:39:50,980 INFO L226 Difference]: Without dead ends: 123 [2022-07-14 06:39:50,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-07-14 06:39:50,980 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 61 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:50,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 173 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:50,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-14 06:39:50,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2022-07-14 06:39:50,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 104 states have (on average 1.3557692307692308) internal successors, (141), 121 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:50,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 141 transitions. [2022-07-14 06:39:50,982 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 141 transitions. Word has length 24 [2022-07-14 06:39:50,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:50,983 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 141 transitions. [2022-07-14 06:39:50,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.8) internal successors, (24), 6 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:39:50,983 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2022-07-14 06:39:50,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:39:50,983 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:50,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:51,003 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:39:51,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-14 06:39:51,194 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:51,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:51,194 INFO L85 PathProgramCache]: Analyzing trace with hash -342052636, now seen corresponding path program 1 times [2022-07-14 06:39:51,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:51,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771638195] [2022-07-14 06:39:51,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:51,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:51,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:51,315 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:39:51,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:51,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771638195] [2022-07-14 06:39:51,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771638195] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:51,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:51,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 06:39:51,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335045951] [2022-07-14 06:39:51,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:51,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 06:39:51,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:51,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 06:39:51,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:39:51,318 INFO L87 Difference]: Start difference. First operand 122 states and 141 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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:39:51,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:51,616 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2022-07-14 06:39:51,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 06:39:51,617 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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:39:51,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:51,617 INFO L225 Difference]: With dead ends: 135 [2022-07-14 06:39:51,617 INFO L226 Difference]: Without dead ends: 135 [2022-07-14 06:39:51,618 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-07-14 06:39:51,618 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 137 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:51,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 448 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:51,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-14 06:39:51,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 121. [2022-07-14 06:39:51,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 103 states have (on average 1.3495145631067962) internal successors, (139), 120 states have internal predecessors, (139), 0 states have call successors, (0), 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:39:51,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 139 transitions. [2022-07-14 06:39:51,620 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 139 transitions. Word has length 25 [2022-07-14 06:39:51,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:51,620 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 139 transitions. [2022-07-14 06:39:51,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 11 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:39:51,620 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 139 transitions. [2022-07-14 06:39:51,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:39:51,621 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:51,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:51,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-14 06:39:51,621 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:51,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:51,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1700492295, now seen corresponding path program 1 times [2022-07-14 06:39:51,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:51,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647627292] [2022-07-14 06:39:51,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:51,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:51,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:51,645 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:39:51,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:51,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647627292] [2022-07-14 06:39:51,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647627292] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:51,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:51,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:39:51,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980067996] [2022-07-14 06:39:51,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:51,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:39:51,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:51,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:39:51,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:39:51,647 INFO L87 Difference]: Start difference. First operand 121 states and 139 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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:39:51,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:51,655 INFO L93 Difference]: Finished difference Result 191 states and 213 transitions. [2022-07-14 06:39:51,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:39:51,655 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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:39:51,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:51,657 INFO L225 Difference]: With dead ends: 191 [2022-07-14 06:39:51,657 INFO L226 Difference]: Without dead ends: 191 [2022-07-14 06:39:51,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:39:51,658 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 59 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:51,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 151 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:39:51,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-07-14 06:39:51,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 137. [2022-07-14 06:39:51,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.319327731092437) internal successors, (157), 136 states have internal predecessors, (157), 0 states have call successors, (0), 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:39:51,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2022-07-14 06:39:51,661 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 25 [2022-07-14 06:39:51,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:51,661 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2022-07-14 06:39:51,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 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:39:51,662 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2022-07-14 06:39:51,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 06:39:51,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:51,662 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:39:51,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-14 06:39:51,662 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:51,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:51,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1532665747, now seen corresponding path program 1 times [2022-07-14 06:39:51,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:51,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510331441] [2022-07-14 06:39:51,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:51,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:51,796 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:39:51,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:51,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510331441] [2022-07-14 06:39:51,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510331441] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:39:51,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180802736] [2022-07-14 06:39:51,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:51,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:39:51,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:39:51,798 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:39:51,799 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:39:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:51,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-14 06:39:51,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:39:51,945 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 17 [2022-07-14 06:39:51,947 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 13 [2022-07-14 06:39:51,971 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-14 06:39:51,982 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:39:51,982 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:39:51,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [180802736] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:51,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 06:39:51,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [11] total 19 [2022-07-14 06:39:51,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713996511] [2022-07-14 06:39:51,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:51,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:39:51,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:51,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:39:51,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-07-14 06:39:51,984 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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:39:52,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:52,177 INFO L93 Difference]: Finished difference Result 155 states and 176 transitions. [2022-07-14 06:39:52,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:39:52,178 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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:39:52,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:52,178 INFO L225 Difference]: With dead ends: 155 [2022-07-14 06:39:52,178 INFO L226 Difference]: Without dead ends: 155 [2022-07-14 06:39:52,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2022-07-14 06:39:52,179 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 32 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:52,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 319 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:52,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-14 06:39:52,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 150. [2022-07-14 06:39:52,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 132 states have (on average 1.303030303030303) internal successors, (172), 149 states have internal predecessors, (172), 0 states have call successors, (0), 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:39:52,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 172 transitions. [2022-07-14 06:39:52,182 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 172 transitions. Word has length 26 [2022-07-14 06:39:52,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:52,182 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 172 transitions. [2022-07-14 06:39:52,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 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:39:52,182 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 172 transitions. [2022-07-14 06:39:52,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-14 06:39:52,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:52,182 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] [2022-07-14 06:39:52,201 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:39:52,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-14 06:39:52,391 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:52,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:52,392 INFO L85 PathProgramCache]: Analyzing trace with hash -301886117, now seen corresponding path program 1 times [2022-07-14 06:39:52,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:52,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145214742] [2022-07-14 06:39:52,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:52,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:52,523 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:39:52,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:52,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145214742] [2022-07-14 06:39:52,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145214742] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:39:52,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231763963] [2022-07-14 06:39:52,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:52,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:39:52,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:39:52,524 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:39:52,525 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:39:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:52,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-14 06:39:52,620 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:39:52,626 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:39:52,674 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:39:52,674 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:39:52,699 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:39:52,760 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:39: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, 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:39:52,826 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:39:52,827 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 28 [2022-07-14 06:39:52,851 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:39:52,852 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 28 [2022-07-14 06:39:52,885 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:39:52,885 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:39:52,910 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:39:52,932 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:39:52,932 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:39:52,947 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_840) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-14 06:39:52,971 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_840) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-14 06:39:52,975 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_840 (Array Int Int))) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-14 06:39:52,982 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_837 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (not (= 0 (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_837))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-14 06:39:52,988 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_837 (Array Int Int)) (v_ArrVal_840 (Array Int Int))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_837))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_840)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-07-14 06:39:52,996 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:39:52,997 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:39:53,005 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:39:53,007 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 141 treesize of output 128 [2022-07-14 06:39:53,014 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:39:53,014 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 112 treesize of output 111 [2022-07-14 06:39:53,019 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 102 treesize of output 98 [2022-07-14 06:39:53,180 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-14 06:39:53,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231763963] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:39:53,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:39:53,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 29 [2022-07-14 06:39:53,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661213820] [2022-07-14 06:39:53,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:39:53,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-14 06:39:53,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:53,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-14 06:39:53,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=486, Unknown=5, NotChecked=240, Total=812 [2022-07-14 06:39:53,182 INFO L87 Difference]: Start difference. First operand 150 states and 172 transitions. Second operand has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 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:39:53,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:53,849 INFO L93 Difference]: Finished difference Result 281 states and 306 transitions. [2022-07-14 06:39:53,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 06:39:53,850 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 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 28 [2022-07-14 06:39:53,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:53,851 INFO L225 Difference]: With dead ends: 281 [2022-07-14 06:39:53,851 INFO L226 Difference]: Without dead ends: 281 [2022-07-14 06:39:53,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=200, Invalid=1005, Unknown=5, NotChecked=350, Total=1560 [2022-07-14 06:39:53,853 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 434 mSDsluCounter, 790 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 1809 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 900 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:53,853 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 868 Invalid, 1809 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 882 Invalid, 0 Unknown, 900 Unchecked, 0.4s Time] [2022-07-14 06:39:53,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2022-07-14 06:39:53,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 175. [2022-07-14 06:39:53,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 157 states have (on average 1.2738853503184713) internal successors, (200), 174 states have internal predecessors, (200), 0 states have call successors, (0), 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:39:53,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 200 transitions. [2022-07-14 06:39:53,856 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 200 transitions. Word has length 28 [2022-07-14 06:39:53,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:53,856 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 200 transitions. [2022-07-14 06:39:53,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.586206896551724) internal successors, (75), 29 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:39:53,856 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 200 transitions. [2022-07-14 06:39:53,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 06:39:53,857 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:53,857 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:39:53,883 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:39:54,057 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:39:54,058 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:39:54,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:54,058 INFO L85 PathProgramCache]: Analyzing trace with hash -768530862, now seen corresponding path program 1 times [2022-07-14 06:39:54,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:54,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886719999] [2022-07-14 06:39:54,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:54,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:54,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:54,224 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:39:54,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:54,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886719999] [2022-07-14 06:39:54,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886719999] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:39:54,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637943257] [2022-07-14 06:39:54,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:54,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:39:54,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:39:54,226 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:39:54,226 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:39:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:54,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-14 06:39:54,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:39:54,437 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-14 06:39:54,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-07-14 06:39:54,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:39:54,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:39:54,485 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 06:39:54,486 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 1 case distinctions, treesize of input 28 treesize of output 30 [2022-07-14 06:39:54,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:39:54,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:39:54,535 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 06:39:54,536 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 35 [2022-07-14 06:39:54,572 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 06:39:54,573 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 15 [2022-07-14 06:39:54,589 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:39:54,589 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:39:56,297 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:39:56,297 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 120 treesize of output 99 [2022-07-14 06:39:57,118 INFO L356 Elim1Store]: treesize reduction 8, result has 83.7 percent of original size [2022-07-14 06:39:57,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 64 [2022-07-14 06:39:57,198 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:39:57,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637943257] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:39:57,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:39:57,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 24 [2022-07-14 06:39:57,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595505159] [2022-07-14 06:39:57,199 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:39:57,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-14 06:39:57,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:57,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-14 06:39:57,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2022-07-14 06:39:57,200 INFO L87 Difference]: Start difference. First operand 175 states and 200 transitions. Second operand has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 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:39:58,179 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 1))) (and .cse0 (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (forall ((v_ArrVal_951 Int)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_951)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) (or (forall ((v_ArrVal_951 Int) (|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1))) (not .cse0)) (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_#t~mem5#1.base|) 1)) (forall ((v_ArrVal_951 Int) (|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)))))) is different from false [2022-07-14 06:39:58,555 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 1))) (and .cse0 (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.offset|) (= |c_ULTIMATE.start_main_~head~0#1.base| |c_ULTIMATE.start_main_~x~0#1.base|) (= (select |c_#valid| (select .cse1 |c_ULTIMATE.start_main_~head~0#1.offset|)) 1) (not (= (select .cse1 |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_951 Int)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (+ |c_ULTIMATE.start_main_~x~0#1.offset| 8) v_ArrVal_951)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) (or (forall ((v_ArrVal_951 Int) (|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1))) (not .cse0)) (or (not (= (select |c_#valid| |c_ULTIMATE.start_main_#t~mem5#1.base|) 1)) (forall ((v_ArrVal_951 Int) (|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (+ 8 |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_951)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)))))) is different from false [2022-07-14 06:40:03,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:03,168 INFO L93 Difference]: Finished difference Result 270 states and 305 transitions. [2022-07-14 06:40:03,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-14 06:40:03,168 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 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) Word has length 29 [2022-07-14 06:40:03,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:03,169 INFO L225 Difference]: With dead ends: 270 [2022-07-14 06:40:03,169 INFO L226 Difference]: Without dead ends: 270 [2022-07-14 06:40:03,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 41 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=319, Invalid=1325, Unknown=4, NotChecked=158, Total=1806 [2022-07-14 06:40:03,170 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 387 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 387 SdHoareTripleChecker+Valid, 534 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 369 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:03,170 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [387 Valid, 534 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 560 Invalid, 0 Unknown, 369 Unchecked, 0.3s Time] [2022-07-14 06:40:03,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-07-14 06:40:03,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 214. [2022-07-14 06:40:03,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 196 states have (on average 1.260204081632653) internal successors, (247), 213 states have internal predecessors, (247), 0 states have call successors, (0), 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:40:03,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 247 transitions. [2022-07-14 06:40:03,173 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 247 transitions. Word has length 29 [2022-07-14 06:40:03,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:03,173 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 247 transitions. [2022-07-14 06:40:03,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.1666666666666665) internal successors, (76), 25 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:40:03,174 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 247 transitions. [2022-07-14 06:40:03,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 06:40:03,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:03,174 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:40:03,206 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-07-14 06:40:03,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-14 06:40:03,406 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:03,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:03,406 INFO L85 PathProgramCache]: Analyzing trace with hash -768530861, now seen corresponding path program 1 times [2022-07-14 06:40:03,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:03,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66152656] [2022-07-14 06:40:03,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:03,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:03,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:03,438 ERROR L253 erpolLogProxyWrapper]: Interpolant 13 not inductive [2022-07-14 06:40:03,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-14 06:40:03,446 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:233) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:879) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:803) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.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:40:03,452 INFO L158 Benchmark]: Toolchain (without parser) took 19999.91ms. Allocated memory was 107.0MB in the beginning and 264.2MB in the end (delta: 157.3MB). Free memory was 78.2MB in the beginning and 224.6MB in the end (delta: -146.4MB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2022-07-14 06:40:03,452 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 107.0MB. Free memory is still 62.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-14 06:40:03,452 INFO L158 Benchmark]: CACSL2BoogieTranslator took 376.68ms. Allocated memory is still 107.0MB. Free memory was 77.9MB in the beginning and 75.3MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-14 06:40:03,452 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.26ms. Allocated memory is still 107.0MB. Free memory was 75.3MB in the beginning and 73.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 06:40:03,453 INFO L158 Benchmark]: Boogie Preprocessor took 40.91ms. Allocated memory is still 107.0MB. Free memory was 73.2MB in the beginning and 71.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-14 06:40:03,453 INFO L158 Benchmark]: RCFGBuilder took 528.51ms. Allocated memory is still 107.0MB. Free memory was 71.5MB in the beginning and 53.5MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-14 06:40:03,453 INFO L158 Benchmark]: TraceAbstraction took 18979.99ms. Allocated memory was 151.0MB in the beginning and 264.2MB in the end (delta: 113.2MB). Free memory was 126.8MB in the beginning and 224.6MB in the end (delta: -97.8MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. [2022-07-14 06:40:03,459 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.15ms. Allocated memory is still 107.0MB. Free memory is still 62.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 376.68ms. Allocated memory is still 107.0MB. Free memory was 77.9MB in the beginning and 75.3MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.26ms. Allocated memory is still 107.0MB. Free memory was 75.3MB in the beginning and 73.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 40.91ms. Allocated memory is still 107.0MB. Free memory was 73.2MB in the beginning and 71.5MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 528.51ms. Allocated memory is still 107.0MB. Free memory was 71.5MB in the beginning and 53.5MB in the end (delta: 17.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 18979.99ms. Allocated memory was 151.0MB in the beginning and 264.2MB in the end (delta: 113.2MB). Free memory was 126.8MB in the beginning and 224.6MB in the end (delta: -97.8MB). Peak memory consumption was 15.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:233) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-07-14 06:40:03,493 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/forester-heap/dll-circular-2.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 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:40:05,247 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:40:05,249 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:40:05,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:40:05,290 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:40:05,291 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:40:05,293 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:40:05,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:40:05,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:40:05,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:40:05,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:40:05,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:40:05,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:40:05,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:40:05,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:40:05,312 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:40:05,313 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:40:05,314 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:40:05,315 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:40:05,318 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:40:05,318 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:40:05,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:40:05,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:40:05,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:40:05,322 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:40:05,327 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:40:05,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:40:05,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:40:05,329 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:40:05,329 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:40:05,330 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:40:05,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:40:05,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:40:05,332 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:40:05,332 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:40:05,333 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:40:05,333 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:40:05,334 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:40:05,334 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:40:05,334 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:40:05,335 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:40:05,336 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:40:05,342 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:40:05,365 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:40:05,366 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:40:05,366 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:40:05,366 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:40:05,367 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:40:05,367 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:40:05,367 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:40:05,367 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:40:05,368 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:40:05,368 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:40:05,368 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:40:05,368 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:40:05,369 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:40:05,369 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:40:05,369 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:40:05,369 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:40:05,369 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:40:05,369 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:40:05,370 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:40:05,370 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:40:05,370 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-14 06:40:05,370 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-14 06:40:05,370 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:40:05,370 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:40:05,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:40:05,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:40:05,371 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:40:05,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:40:05,371 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:40:05,371 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:40:05,371 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-14 06:40:05,372 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-14 06:40:05,372 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-14 06:40:05,372 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 -> 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c [2022-07-14 06:40:05,656 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:40:05,674 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:40:05,675 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:40:05,676 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:40:05,677 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:40:05,678 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-circular-2.i [2022-07-14 06:40:05,725 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/855da0357/c8c33d64fd6847e5aa7f622f319e989b/FLAGa2b83a428 [2022-07-14 06:40:06,105 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:40:06,117 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i [2022-07-14 06:40:06,128 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/855da0357/c8c33d64fd6847e5aa7f622f319e989b/FLAGa2b83a428 [2022-07-14 06:40:06,140 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/855da0357/c8c33d64fd6847e5aa7f622f319e989b [2022-07-14 06:40:06,144 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:40:06,145 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:40:06,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:40:06,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:40:06,149 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:40:06,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:40:06" (1/1) ... [2022-07-14 06:40:06,151 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@561be124 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:40:06, skipping insertion in model container [2022-07-14 06:40:06,151 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:40:06" (1/1) ... [2022-07-14 06:40:06,155 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:40:06,193 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:40:06,443 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22391,22404] [2022-07-14 06:40:06,446 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22497,22510] [2022-07-14 06:40:06,449 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22622,22635] [2022-07-14 06:40:06,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:40:06,465 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:40:06,484 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22391,22404] [2022-07-14 06:40:06,487 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22497,22510] [2022-07-14 06:40:06,488 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22622,22635] [2022-07-14 06:40:06,490 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:40:06,510 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:40:06,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:40:06 WrapperNode [2022-07-14 06:40:06,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:40:06,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:40:06,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:40:06,511 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:40:06,516 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:40:06" (1/1) ... [2022-07-14 06:40:06,527 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:40:06" (1/1) ... [2022-07-14 06:40:06,542 INFO L137 Inliner]: procedures = 122, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 122 [2022-07-14 06:40:06,543 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:40:06,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:40:06,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:40:06,544 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:40:06,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:40:06" (1/1) ... [2022-07-14 06:40:06,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:40:06" (1/1) ... [2022-07-14 06:40:06,555 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:40:06" (1/1) ... [2022-07-14 06:40:06,555 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:40:06" (1/1) ... [2022-07-14 06:40:06,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:40:06" (1/1) ... [2022-07-14 06:40:06,568 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:40:06" (1/1) ... [2022-07-14 06:40:06,569 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:40:06" (1/1) ... [2022-07-14 06:40:06,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:40:06,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:40:06,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:40:06,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:40:06,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:40:06" (1/1) ... [2022-07-14 06:40:06,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:40:06,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:40:06,603 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:40:06,605 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:40:06,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-14 06:40:06,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:40:06,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:40:06,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:40:06,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:40:06,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:40:06,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-14 06:40:06,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-14 06:40:06,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:40:06,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:40:06,786 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:40:06,787 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:40:07,187 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:40:07,192 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:40:07,207 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-07-14 06:40:07,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:40:07 BoogieIcfgContainer [2022-07-14 06:40:07,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:40:07,210 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:40:07,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:40:07,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:40:07,213 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:40:06" (1/3) ... [2022-07-14 06:40:07,213 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4de5cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:40:07, skipping insertion in model container [2022-07-14 06:40:07,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:40:06" (2/3) ... [2022-07-14 06:40:07,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c4de5cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:40:07, skipping insertion in model container [2022-07-14 06:40:07,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:40:07" (3/3) ... [2022-07-14 06:40:07,215 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2022-07-14 06:40:07,225 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:40:07,225 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 52 error locations. [2022-07-14 06:40:07,254 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:40:07,258 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@596ee68d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@504c7dd0 [2022-07-14 06:40:07,264 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2022-07-14 06:40:07,272 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 57 states have (on average 2.245614035087719) internal successors, (128), 109 states have internal predecessors, (128), 0 states have call successors, (0), 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:40:07,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:40:07,276 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:07,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:40:07,276 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:07,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:07,287 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-14 06:40:07,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:40:07,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [546136226] [2022-07-14 06:40:07,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:07,296 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:40:07,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:40:07,323 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:40:07,354 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:40:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:07,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-14 06:40:07,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:07,457 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:40:07,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:07,467 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:40:07,468 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:40:07,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [546136226] [2022-07-14 06:40:07,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [546136226] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:07,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:07,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:40:07,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047509605] [2022-07-14 06:40:07,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:07,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:40:07,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:40:07,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:40:07,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:40:07,494 INFO L87 Difference]: Start difference. First operand has 110 states, 57 states have (on average 2.245614035087719) internal successors, (128), 109 states have internal predecessors, (128), 0 states have call successors, (0), 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:40:07,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:07,650 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2022-07-14 06:40:07,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:40:07,652 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:40:07,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:07,657 INFO L225 Difference]: With dead ends: 115 [2022-07-14 06:40:07,657 INFO L226 Difference]: Without dead ends: 113 [2022-07-14 06:40:07,658 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:40:07,661 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 93 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:07,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 78 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:40:07,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-14 06:40:07,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 103. [2022-07-14 06:40:07,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 56 states have (on average 1.9464285714285714) internal successors, (109), 102 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:07,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 109 transitions. [2022-07-14 06:40:07,695 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 109 transitions. Word has length 3 [2022-07-14 06:40:07,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:07,696 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 109 transitions. [2022-07-14 06:40:07,696 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:40:07,696 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 109 transitions. [2022-07-14 06:40:07,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:40:07,697 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:07,697 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:40:07,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-14 06:40:07,908 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:40:07,908 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:07,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:07,909 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-14 06:40:07,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:40:07,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [107305116] [2022-07-14 06:40:07,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:07,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:40:07,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:40:07,916 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:40:07,918 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:40:07,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:07,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:40:07,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:07,967 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:40:07,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:07,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:40:07,977 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:40:07,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [107305116] [2022-07-14 06:40:07,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [107305116] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:07,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:07,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:40:07,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231239150] [2022-07-14 06:40:07,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:07,981 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:40:07,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:40:07,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:40:07,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:40:07,982 INFO L87 Difference]: Start difference. First operand 103 states and 109 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:40:08,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:08,120 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2022-07-14 06:40:08,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:40:08,120 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:40:08,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:08,121 INFO L225 Difference]: With dead ends: 110 [2022-07-14 06:40:08,121 INFO L226 Difference]: Without dead ends: 110 [2022-07-14 06:40:08,121 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:40:08,122 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 90 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:08,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 78 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:40:08,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-14 06:40:08,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 98. [2022-07-14 06:40:08,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 56 states have (on average 1.8571428571428572) internal successors, (104), 97 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:40:08,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2022-07-14 06:40:08,127 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 3 [2022-07-14 06:40:08,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:08,128 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2022-07-14 06:40:08,128 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:40:08,128 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2022-07-14 06:40:08,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 06:40:08,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:08,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:08,137 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:40:08,329 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:40:08,329 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:08,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:08,330 INFO L85 PathProgramCache]: Analyzing trace with hash 59261800, now seen corresponding path program 1 times [2022-07-14 06:40:08,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:40:08,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [792275600] [2022-07-14 06:40:08,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:08,331 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:40:08,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:40:08,344 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:40:08,345 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:40:08,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:08,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:40:08,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:08,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:40:08,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:08,409 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:40:08,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:40:08,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [792275600] [2022-07-14 06:40:08,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [792275600] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:08,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:08,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:40:08,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753910797] [2022-07-14 06:40:08,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:08,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:40:08,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:40:08,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:40:08,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:40:08,413 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:08,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:08,598 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2022-07-14 06:40:08,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:40:08,598 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-14 06:40:08,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:08,599 INFO L225 Difference]: With dead ends: 95 [2022-07-14 06:40:08,599 INFO L226 Difference]: Without dead ends: 95 [2022-07-14 06:40:08,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:40:08,600 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 146 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:08,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 52 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:40:08,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-14 06:40:08,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2022-07-14 06:40:08,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 85 states have internal predecessors, (92), 0 states have call successors, (0), 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:40:08,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2022-07-14 06:40:08,604 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 8 [2022-07-14 06:40:08,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:08,605 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2022-07-14 06:40:08,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:08,605 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2022-07-14 06:40:08,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 06:40:08,605 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:08,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:08,617 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:40:08,814 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:40:08,815 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:08,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:08,815 INFO L85 PathProgramCache]: Analyzing trace with hash 59261801, now seen corresponding path program 1 times [2022-07-14 06:40:08,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:40:08,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1121876827] [2022-07-14 06:40:08,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:08,816 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:40:08,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:40:08,820 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:40:08,823 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:40:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:08,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 06:40:08,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:08,891 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:40:08,930 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:40:08,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:40:08,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:40:08,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1121876827] [2022-07-14 06:40:08,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1121876827] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:08,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:08,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:40:08,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925298145] [2022-07-14 06:40:08,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:08,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:40:08,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:40:08,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:40:08,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:40:08,933 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:09,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:09,191 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2022-07-14 06:40:09,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:40:09,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-07-14 06:40:09,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:09,192 INFO L225 Difference]: With dead ends: 110 [2022-07-14 06:40:09,192 INFO L226 Difference]: Without dead ends: 110 [2022-07-14 06:40:09,192 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:40:09,193 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 100 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:09,193 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 97 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:40:09,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-14 06:40:09,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 94. [2022-07-14 06:40:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 64 states have (on average 1.609375) internal successors, (103), 93 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:40:09,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 103 transitions. [2022-07-14 06:40:09,197 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 103 transitions. Word has length 8 [2022-07-14 06:40:09,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:09,198 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 103 transitions. [2022-07-14 06:40:09,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:09,198 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-07-14 06:40:09,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 06:40:09,198 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:09,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:09,217 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:40:09,405 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:40:09,406 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:09,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:09,406 INFO L85 PathProgramCache]: Analyzing trace with hash 236809587, now seen corresponding path program 1 times [2022-07-14 06:40:09,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:40:09,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [354486044] [2022-07-14 06:40:09,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:09,407 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:40:09,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:40:09,408 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:40:09,410 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:40:09,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:09,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 06:40:09,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:09,476 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:40:09,496 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:40:09,521 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:40:09,527 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:40:09,528 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:40:09,528 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:40:09,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [354486044] [2022-07-14 06:40:09,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [354486044] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:09,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:09,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:40:09,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400210148] [2022-07-14 06:40:09,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:09,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:40:09,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:40:09,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:40:09,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:40:09,530 INFO L87 Difference]: Start difference. First operand 94 states and 103 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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:40:09,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:09,734 INFO L93 Difference]: Finished difference Result 93 states and 101 transitions. [2022-07-14 06:40:09,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:40:09,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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:40:09,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:09,735 INFO L225 Difference]: With dead ends: 93 [2022-07-14 06:40:09,736 INFO L226 Difference]: Without dead ends: 93 [2022-07-14 06:40:09,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:40:09,736 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 9 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:09,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 221 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:40:09,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-14 06:40:09,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-07-14 06:40:09,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 64 states have (on average 1.578125) internal successors, (101), 92 states have internal predecessors, (101), 0 states have call successors, (0), 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:40:09,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2022-07-14 06:40:09,741 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 11 [2022-07-14 06:40:09,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:09,741 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2022-07-14 06:40:09,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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:40:09,741 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-07-14 06:40:09,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 06:40:09,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:09,742 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:09,753 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:40:09,950 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:40:09,951 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:09,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:09,951 INFO L85 PathProgramCache]: Analyzing trace with hash 236809588, now seen corresponding path program 1 times [2022-07-14 06:40:09,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:40:09,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231061930] [2022-07-14 06:40:09,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:09,951 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:40:09,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:40:09,952 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:40:09,953 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:40:10,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:10,020 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 06:40:10,022 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:10,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:40:10,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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:40:10,055 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:40:10,078 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:40:10,098 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:40:10,112 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:40:10,112 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:40:10,112 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:40:10,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231061930] [2022-07-14 06:40:10,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231061930] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:10,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:10,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:40:10,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376694132] [2022-07-14 06:40:10,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:10,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:40:10,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:40:10,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:40:10,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:40:10,114 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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:40:10,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:10,375 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2022-07-14 06:40:10,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:40:10,375 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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:40:10,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:10,376 INFO L225 Difference]: With dead ends: 92 [2022-07-14 06:40:10,376 INFO L226 Difference]: Without dead ends: 92 [2022-07-14 06:40:10,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:40:10,377 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 4 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:10,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 216 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:40:10,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-14 06:40:10,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-07-14 06:40:10,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 64 states have (on average 1.546875) internal successors, (99), 91 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:40:10,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2022-07-14 06:40:10,381 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 11 [2022-07-14 06:40:10,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:10,381 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2022-07-14 06:40:10,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 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:40:10,381 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2022-07-14 06:40:10,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 06:40:10,382 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:10,382 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:10,403 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:40:10,588 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:40:10,590 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:10,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:10,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1249789621, now seen corresponding path program 1 times [2022-07-14 06:40:10,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:40:10,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [726268910] [2022-07-14 06:40:10,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:10,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:40:10,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:40:10,593 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:40:10,594 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:40:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:10,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-14 06:40:10,667 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:10,682 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:40:10,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:10,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:40:10,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:10,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:40:10,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:10,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:40:10,798 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:40:10,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:10,809 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:40:10,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:40:10,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [726268910] [2022-07-14 06:40:10,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [726268910] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:10,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:10,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:40:10,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822255122] [2022-07-14 06:40:10,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:10,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:40:10,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:40:10,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:40:10,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:40:10,811 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:11,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:11,047 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2022-07-14 06:40:11,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:40:11,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-14 06:40:11,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:11,048 INFO L225 Difference]: With dead ends: 175 [2022-07-14 06:40:11,048 INFO L226 Difference]: Without dead ends: 175 [2022-07-14 06:40:11,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:40:11,049 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 274 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:11,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 263 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:40:11,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-14 06:40:11,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 95. [2022-07-14 06:40:11,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 94 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:11,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2022-07-14 06:40:11,052 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 12 [2022-07-14 06:40:11,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:11,053 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2022-07-14 06:40:11,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:11,053 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2022-07-14 06:40:11,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 06:40:11,053 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:11,053 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:11,063 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:40:11,261 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:40:11,261 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:11,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:11,261 INFO L85 PathProgramCache]: Analyzing trace with hash -88768416, now seen corresponding path program 1 times [2022-07-14 06:40:11,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:40:11,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614142176] [2022-07-14 06:40:11,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:11,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:40:11,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:40:11,263 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:40:11,263 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:40:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:11,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-14 06:40:11,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:11,336 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:40:11,347 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:40:11,382 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:11,383 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:40:11,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:11,394 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:40:11,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:11,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, 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:40:11,442 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:40:11,455 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:40:11,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:40:11,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:40:11,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614142176] [2022-07-14 06:40:11,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614142176] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:11,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:11,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:40:11,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157314460] [2022-07-14 06:40:11,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:11,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:40:11,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:40:11,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:40:11,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:40:11,458 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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:40:11,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:11,784 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2022-07-14 06:40:11,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:40:11,785 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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:40:11,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:11,786 INFO L225 Difference]: With dead ends: 144 [2022-07-14 06:40:11,786 INFO L226 Difference]: Without dead ends: 144 [2022-07-14 06:40:11,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:40:11,786 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 255 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:11,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 155 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:40:11,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-14 06:40:11,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 97. [2022-07-14 06:40:11,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 69 states have (on average 1.5217391304347827) internal successors, (105), 96 states have internal predecessors, (105), 0 states have call successors, (0), 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:40:11,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 105 transitions. [2022-07-14 06:40:11,789 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 105 transitions. Word has length 13 [2022-07-14 06:40:11,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:11,789 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 105 transitions. [2022-07-14 06:40:11,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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:40:11,789 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 105 transitions. [2022-07-14 06:40:11,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-14 06:40:11,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:11,790 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:11,803 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:40:11,995 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:40:11,996 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:11,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:11,996 INFO L85 PathProgramCache]: Analyzing trace with hash -88768415, now seen corresponding path program 1 times [2022-07-14 06:40:11,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:40:11,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194377509] [2022-07-14 06:40:11,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:11,996 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:40:11,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:40:11,997 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:40:11,998 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:40:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:12,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-14 06:40:12,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:12,075 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:40:12,090 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:40:12,095 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:40:12,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:12,130 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:40:12,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:12,138 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:40:12,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:12,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:40:12,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:12,156 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:40:12,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:12,204 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:40:12,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:12,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, 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:40:12,220 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:40:12,223 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:40:12,261 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:40:12,262 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:40:12,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:40:12,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194377509] [2022-07-14 06:40:12,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194377509] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:12,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:12,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:40:12,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456871363] [2022-07-14 06:40:12,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:12,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:40:12,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:40:12,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:40:12,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:40:12,264 INFO L87 Difference]: Start difference. First operand 97 states and 105 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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:40:12,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:12,621 INFO L93 Difference]: Finished difference Result 169 states and 180 transitions. [2022-07-14 06:40:12,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:40:12,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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:40:12,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:12,622 INFO L225 Difference]: With dead ends: 169 [2022-07-14 06:40:12,622 INFO L226 Difference]: Without dead ends: 169 [2022-07-14 06:40:12,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:40:12,623 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 249 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:12,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 197 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:40:12,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-07-14 06:40:12,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 109. [2022-07-14 06:40:12,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 81 states have (on average 1.5185185185185186) internal successors, (123), 108 states have internal predecessors, (123), 0 states have call successors, (0), 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:40:12,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 123 transitions. [2022-07-14 06:40:12,626 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 123 transitions. Word has length 13 [2022-07-14 06:40:12,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:12,626 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 123 transitions. [2022-07-14 06:40:12,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 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:40:12,626 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 123 transitions. [2022-07-14 06:40:12,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 06:40:12,627 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:12,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:12,645 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:40:12,827 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:40:12,827 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:12,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:12,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1108053835, now seen corresponding path program 1 times [2022-07-14 06:40:12,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:40:12,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [141909273] [2022-07-14 06:40:12,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:12,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:40:12,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:40:12,829 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:40:12,832 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:40:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:12,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-14 06:40:12,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:12,922 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-14 06:40:12,922 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 21 [2022-07-14 06:40:12,988 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-14 06:40:12,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-07-14 06:40:13,070 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:40:13,243 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:13,244 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 44 treesize of output 43 [2022-07-14 06:40:13,321 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 41 treesize of output 25 [2022-07-14 06:40:13,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:13,486 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:40:13,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:40:13,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [141909273] [2022-07-14 06:40:13,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [141909273] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:13,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:13,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:40:13,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104144145] [2022-07-14 06:40:13,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:13,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:40:13,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:40:13,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:40:13,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:40:13,487 INFO L87 Difference]: Start difference. First operand 109 states and 123 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 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:40:13,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:13,971 INFO L93 Difference]: Finished difference Result 167 states and 185 transitions. [2022-07-14 06:40:13,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 06:40:13,971 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 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:40:13,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:13,972 INFO L225 Difference]: With dead ends: 167 [2022-07-14 06:40:13,972 INFO L226 Difference]: Without dead ends: 167 [2022-07-14 06:40:13,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2022-07-14 06:40:13,973 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 179 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 287 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:13,973 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 304 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 155 Invalid, 0 Unknown, 287 Unchecked, 0.2s Time] [2022-07-14 06:40:13,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-14 06:40:13,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 111. [2022-07-14 06:40:13,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 83 states have (on average 1.5180722891566265) internal successors, (126), 110 states have internal predecessors, (126), 0 states have call successors, (0), 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:40:13,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 126 transitions. [2022-07-14 06:40:13,975 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 126 transitions. Word has length 15 [2022-07-14 06:40:13,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:13,975 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 126 transitions. [2022-07-14 06:40:13,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 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:40:13,976 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 126 transitions. [2022-07-14 06:40:13,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 06:40:13,976 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:13,976 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:13,997 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:40:14,176 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:40:14,177 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:14,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:14,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1108053834, now seen corresponding path program 1 times [2022-07-14 06:40:14,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:40:14,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [854757479] [2022-07-14 06:40:14,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:14,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:40:14,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:40:14,178 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:40:14,179 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:40:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:14,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-14 06:40:14,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:14,284 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:40:14,303 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:40:14,305 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:40:14,309 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:40:14,322 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:40:14,327 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:40:14,387 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:14,387 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:40:14,391 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:40:14,404 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:40:14,407 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:40:14,432 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:40:14,432 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:40:14,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:40:14,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [854757479] [2022-07-14 06:40:14,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [854757479] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:14,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:14,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:40:14,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010967521] [2022-07-14 06:40:14,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:14,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:40:14,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:40:14,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:40:14,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:40:14,435 INFO L87 Difference]: Start difference. First operand 111 states and 126 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 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:40:15,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:15,022 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2022-07-14 06:40:15,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 06:40:15,022 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 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:40:15,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:15,023 INFO L225 Difference]: With dead ends: 114 [2022-07-14 06:40:15,023 INFO L226 Difference]: Without dead ends: 114 [2022-07-14 06:40:15,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2022-07-14 06:40:15,024 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 153 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:15,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 169 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:40:15,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-14 06:40:15,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2022-07-14 06:40:15,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.4337349397590362) internal successors, (119), 104 states have internal predecessors, (119), 0 states have call successors, (0), 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:40:15,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 119 transitions. [2022-07-14 06:40:15,026 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 119 transitions. Word has length 15 [2022-07-14 06:40:15,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:15,026 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 119 transitions. [2022-07-14 06:40:15,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 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:40:15,026 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 119 transitions. [2022-07-14 06:40:15,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:40:15,026 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:15,026 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:40:15,036 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:40:15,227 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:40:15,227 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:15,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:15,227 INFO L85 PathProgramCache]: Analyzing trace with hash 1200058809, now seen corresponding path program 1 times [2022-07-14 06:40:15,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:40:15,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918733351] [2022-07-14 06:40:15,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:15,228 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:40:15,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:40:15,229 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:40:15,230 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:40:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:15,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-14 06:40:15,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:15,342 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-14 06:40:15,343 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 21 [2022-07-14 06:40:15,349 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:40:15,370 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:40:15,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:15,405 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:40:15,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:15,424 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:40:15,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:15,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, 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:40:15,743 INFO L356 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-07-14 06:40:15,744 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 27 [2022-07-14 06:40:15,748 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 14 [2022-07-14 06:40:15,768 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:40:15,769 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:40:15,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:40:15,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918733351] [2022-07-14 06:40:15,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918733351] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:15,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:15,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:40:15,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962413702] [2022-07-14 06:40:15,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:15,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:40:15,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:40:15,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:40:15,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:40:15,770 INFO L87 Difference]: Start difference. First operand 105 states and 119 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:16,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:16,108 INFO L93 Difference]: Finished difference Result 109 states and 119 transitions. [2022-07-14 06:40:16,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:40:16,109 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 06:40:16,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:16,109 INFO L225 Difference]: With dead ends: 109 [2022-07-14 06:40:16,109 INFO L226 Difference]: Without dead ends: 109 [2022-07-14 06:40:16,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:40:16,110 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 69 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 149 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:16,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 292 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 141 Invalid, 0 Unknown, 149 Unchecked, 0.2s Time] [2022-07-14 06:40:16,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-14 06:40:16,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2022-07-14 06:40:16,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.4216867469879517) internal successors, (118), 104 states have internal predecessors, (118), 0 states have call successors, (0), 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:40:16,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2022-07-14 06:40:16,112 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 16 [2022-07-14 06:40:16,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:16,112 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2022-07-14 06:40:16,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:16,112 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2022-07-14 06:40:16,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:40:16,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:16,113 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:40:16,120 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:40:16,319 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:40:16,320 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:16,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:16,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1200058810, now seen corresponding path program 1 times [2022-07-14 06:40:16,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:40:16,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1562278228] [2022-07-14 06:40:16,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:16,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:40:16,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:40:16,322 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:40:16,322 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:40:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:16,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-14 06:40:16,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:16,422 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:40:16,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 11 treesize of output 7 [2022-07-14 06:40:16,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:16,451 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:40:16,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:16,461 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:40:16,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:16,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:40:16,637 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-07-14 06:40:16,637 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 46 [2022-07-14 06:40:16,644 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:40:16,644 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 29 [2022-07-14 06:40:16,678 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:40:16,678 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:40:16,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:40:16,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1562278228] [2022-07-14 06:40:16,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1562278228] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:16,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:16,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:40:16,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011309982] [2022-07-14 06:40:16,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:16,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:40:16,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:40:16,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:40:16,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:40:16,680 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:16,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:16,975 INFO L93 Difference]: Finished difference Result 108 states and 118 transitions. [2022-07-14 06:40:16,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:40:16,976 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 06:40:16,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:16,976 INFO L225 Difference]: With dead ends: 108 [2022-07-14 06:40:16,976 INFO L226 Difference]: Without dead ends: 108 [2022-07-14 06:40:16,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:40:16,977 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 41 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 141 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:16,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 287 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 136 Invalid, 0 Unknown, 141 Unchecked, 0.3s Time] [2022-07-14 06:40:16,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2022-07-14 06:40:16,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2022-07-14 06:40:16,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 83 states have (on average 1.4096385542168675) internal successors, (117), 104 states have internal predecessors, (117), 0 states have call successors, (0), 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:40:16,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-07-14 06:40:16,979 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 16 [2022-07-14 06:40:16,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:16,980 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-07-14 06:40:16,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:16,980 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-07-14 06:40:16,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:40:16,980 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:16,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:16,987 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:40:17,187 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:40:17,188 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:17,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:17,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1452897384, now seen corresponding path program 1 times [2022-07-14 06:40:17,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:40:17,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714132948] [2022-07-14 06:40:17,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:17,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:40:17,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:40:17,190 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:40:17,191 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:40:17,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:17,252 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-14 06:40:17,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:17,284 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:40:17,307 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:40:17,308 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:40:17,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:40:17,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714132948] [2022-07-14 06:40:17,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [714132948] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:17,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:17,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:40:17,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912162889] [2022-07-14 06:40:17,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:17,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:40:17,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:40:17,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:40:17,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:40:17,309 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 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:40:17,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:17,706 INFO L93 Difference]: Finished difference Result 141 states and 156 transitions. [2022-07-14 06:40:17,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:40:17,706 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 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:40:17,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:17,707 INFO L225 Difference]: With dead ends: 141 [2022-07-14 06:40:17,707 INFO L226 Difference]: Without dead ends: 141 [2022-07-14 06:40:17,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:40:17,708 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 165 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:17,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 177 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:40:17,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-14 06:40:17,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 106. [2022-07-14 06:40:17,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 105 states have internal predecessors, (119), 0 states have call successors, (0), 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:40:17,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 119 transitions. [2022-07-14 06:40:17,710 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 119 transitions. Word has length 17 [2022-07-14 06:40:17,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:17,710 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 119 transitions. [2022-07-14 06:40:17,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 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:40:17,710 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 119 transitions. [2022-07-14 06:40:17,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:40:17,710 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:17,711 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:17,720 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:40:17,915 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:40:17,915 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:17,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:17,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1452897383, now seen corresponding path program 1 times [2022-07-14 06:40:17,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:40:17,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143403656] [2022-07-14 06:40:17,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:17,916 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:40:17,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:40:17,917 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:40:17,919 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:40:17,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:17,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-14 06:40:17,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:18,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-14 06:40:18,062 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 34 treesize of output 18 [2022-07-14 06:40:18,122 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:40:18,122 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:40:18,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:40:18,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143403656] [2022-07-14 06:40:18,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143403656] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:18,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:18,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:40:18,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487928498] [2022-07-14 06:40:18,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:18,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:40:18,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:40:18,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:40:18,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:40:18,124 INFO L87 Difference]: Start difference. First operand 106 states and 119 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 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:40:19,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:19,125 INFO L93 Difference]: Finished difference Result 141 states and 155 transitions. [2022-07-14 06:40:19,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:40:19,125 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 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:40:19,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:19,126 INFO L225 Difference]: With dead ends: 141 [2022-07-14 06:40:19,126 INFO L226 Difference]: Without dead ends: 141 [2022-07-14 06:40:19,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:40:19,127 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 150 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:19,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 198 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-14 06:40:19,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-07-14 06:40:19,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 105. [2022-07-14 06:40:19,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.3928571428571428) internal successors, (117), 104 states have internal predecessors, (117), 0 states have call successors, (0), 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:40:19,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-07-14 06:40:19,132 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 17 [2022-07-14 06:40:19,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:19,133 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-07-14 06:40:19,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 7 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:40:19,133 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-07-14 06:40:19,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 06:40:19,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:19,134 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:40:19,141 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:40:19,339 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:40:19,339 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:19,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:19,340 INFO L85 PathProgramCache]: Analyzing trace with hash -370010073, now seen corresponding path program 1 times [2022-07-14 06:40:19,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:40:19,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1582271445] [2022-07-14 06:40:19,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:19,340 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:40:19,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:40:19,341 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:40:19,342 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:40:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:19,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-14 06:40:19,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:19,425 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:40:19,429 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:40:19,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:19,442 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:40:19,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:19,447 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:40:19,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:19,460 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:40:19,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:19,465 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:40:19,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:19,505 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:40:19,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:19,511 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:40:19,515 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:40:19,532 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:40:19,534 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:40:19,563 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:40:19,572 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:40:19,572 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:40:19,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:40:19,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1582271445] [2022-07-14 06:40:19,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1582271445] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:19,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:19,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:40:19,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691778856] [2022-07-14 06:40:19,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:19,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:40:19,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:40:19,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:40:19,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:40:19,573 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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:40:19,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:19,924 INFO L93 Difference]: Finished difference Result 146 states and 156 transitions. [2022-07-14 06:40:19,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:40:19,925 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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:40:19,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:19,925 INFO L225 Difference]: With dead ends: 146 [2022-07-14 06:40:19,925 INFO L226 Difference]: Without dead ends: 146 [2022-07-14 06:40:19,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:40:19,926 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 272 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:19,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 296 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:40:19,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-14 06:40:19,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 105. [2022-07-14 06:40:19,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 84 states have (on average 1.380952380952381) internal successors, (116), 104 states have internal predecessors, (116), 0 states have call successors, (0), 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:40:19,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2022-07-14 06:40:19,928 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 19 [2022-07-14 06:40:19,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:19,928 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2022-07-14 06:40:19,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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:40:19,929 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2022-07-14 06:40:19,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 06:40:19,929 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:19,929 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:40:19,937 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:40:20,136 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:40:20,136 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:20,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:20,136 INFO L85 PathProgramCache]: Analyzing trace with hash -666970825, now seen corresponding path program 1 times [2022-07-14 06:40:20,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:40:20,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1507425398] [2022-07-14 06:40:20,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:20,137 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:40:20,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:40:20,138 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:40:20,139 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:40:20,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:20,248 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 06:40:20,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:20,257 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:40:20,270 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:40:20,283 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:40:20,283 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:40:20,292 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:40:20,292 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:40:20,292 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:40:20,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1507425398] [2022-07-14 06:40:20,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1507425398] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:20,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:20,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:40:20,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733070561] [2022-07-14 06:40:20,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:20,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:40:20,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:40:20,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:40:20,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:40:20,293 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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:40:20,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:20,401 INFO L93 Difference]: Finished difference Result 103 states and 114 transitions. [2022-07-14 06:40:20,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:40:20,402 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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:40:20,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:20,402 INFO L225 Difference]: With dead ends: 103 [2022-07-14 06:40:20,402 INFO L226 Difference]: Without dead ends: 103 [2022-07-14 06:40:20,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:40:20,403 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 112 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:20,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 51 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:40:20,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-14 06:40:20,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-07-14 06:40:20,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 102 states have internal predecessors, (114), 0 states have call successors, (0), 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:40:20,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 114 transitions. [2022-07-14 06:40:20,405 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 114 transitions. Word has length 19 [2022-07-14 06:40:20,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:20,405 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 114 transitions. [2022-07-14 06:40:20,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 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:40:20,405 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 114 transitions. [2022-07-14 06:40:20,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 06:40:20,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:20,406 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:20,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-14 06:40:20,613 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:40:20,614 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:20,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:20,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1858278108, now seen corresponding path program 1 times [2022-07-14 06:40:20,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:40:20,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440007983] [2022-07-14 06:40:20,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:20,614 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:40:20,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:40:20,615 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:40:20,616 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:40:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:20,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 06:40:20,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:20,690 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:40:20,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:40:20,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:40:20,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440007983] [2022-07-14 06:40:20,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440007983] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:20,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:20,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:40:20,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35303965] [2022-07-14 06:40:20,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:20,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:40:20,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:40:20,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:40:20,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:40:20,691 INFO L87 Difference]: Start difference. First operand 103 states and 114 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:20,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:20,703 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2022-07-14 06:40:20,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:40:20,703 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-14 06:40:20,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:20,704 INFO L225 Difference]: With dead ends: 105 [2022-07-14 06:40:20,704 INFO L226 Difference]: Without dead ends: 105 [2022-07-14 06:40:20,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:40:20,705 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 0 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:20,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:40:20,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-14 06:40:20,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-07-14 06:40:20,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.3647058823529412) internal successors, (116), 104 states have internal predecessors, (116), 0 states have call successors, (0), 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:40:20,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2022-07-14 06:40:20,707 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 20 [2022-07-14 06:40:20,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:20,707 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2022-07-14 06:40:20,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:20,707 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2022-07-14 06:40:20,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:40:20,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:20,708 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:40:20,727 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:40:20,908 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:40:20,909 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:20,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:20,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1772093387, now seen corresponding path program 1 times [2022-07-14 06:40:20,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:40:20,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367771495] [2022-07-14 06:40:20,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:20,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:40:20,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:40:20,911 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:40:20,916 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:40:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:21,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 06:40:21,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:21,020 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:40:21,037 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:40:21,037 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:40:21,037 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:40:21,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367771495] [2022-07-14 06:40:21,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367771495] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:21,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:21,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:40:21,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071828196] [2022-07-14 06:40:21,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:21,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:40:21,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:40:21,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:40:21,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:40:21,040 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:21,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:21,222 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2022-07-14 06:40:21,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:40:21,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-14 06:40:21,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:21,224 INFO L225 Difference]: With dead ends: 104 [2022-07-14 06:40:21,224 INFO L226 Difference]: Without dead ends: 104 [2022-07-14 06:40:21,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:40:21,224 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 27 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:21,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 157 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:40:21,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-14 06:40:21,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-14 06:40:21,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 103 states have internal predecessors, (114), 0 states have call successors, (0), 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:40:21,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2022-07-14 06:40:21,227 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 21 [2022-07-14 06:40:21,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:21,228 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2022-07-14 06:40:21,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:21,228 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2022-07-14 06:40:21,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:40:21,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:21,229 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:40:21,238 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-14 06:40:21,436 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:40:21,436 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:21,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:21,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1772093388, now seen corresponding path program 1 times [2022-07-14 06:40:21,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:40:21,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941656938] [2022-07-14 06:40:21,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:21,437 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:40:21,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:40:21,438 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:40:21,439 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:40:21,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:21,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-14 06:40:21,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:21,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-14 06:40:21,575 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 34 treesize of output 18 [2022-07-14 06:40:21,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:21,600 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:40:21,601 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:40:21,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941656938] [2022-07-14 06:40:21,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941656938] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:21,601 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:21,601 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:40:21,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363349612] [2022-07-14 06:40:21,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:21,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:40:21,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:40:21,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:40:21,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:40:21,602 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:21,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:21,996 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2022-07-14 06:40:21,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:40:21,997 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-14 06:40:21,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:21,997 INFO L225 Difference]: With dead ends: 103 [2022-07-14 06:40:21,997 INFO L226 Difference]: Without dead ends: 103 [2022-07-14 06:40:21,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:40:21,998 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 24 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:21,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 161 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:40:21,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-14 06:40:21,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-07-14 06:40:22,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.3176470588235294) internal successors, (112), 102 states have internal predecessors, (112), 0 states have call successors, (0), 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:40:22,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 112 transitions. [2022-07-14 06:40:22,000 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 112 transitions. Word has length 21 [2022-07-14 06:40:22,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:22,000 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 112 transitions. [2022-07-14 06:40:22,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:22,001 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 112 transitions. [2022-07-14 06:40:22,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 06:40:22,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:22,001 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:40:22,008 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:40:22,208 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:40:22,208 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:22,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:22,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2133696844, now seen corresponding path program 1 times [2022-07-14 06:40:22,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:40:22,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1265432143] [2022-07-14 06:40:22,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:22,209 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:40:22,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:40:22,210 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:40:22,211 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:40:22,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:22,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-14 06:40:22,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:22,296 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:40:22,308 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:40:22,308 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:40:22,308 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:40:22,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1265432143] [2022-07-14 06:40:22,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1265432143] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:22,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:22,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:40:22,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152622345] [2022-07-14 06:40:22,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:22,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:40:22,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:40:22,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:40:22,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:40:22,310 INFO L87 Difference]: Start difference. First operand 103 states and 112 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:40:22,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:22,574 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2022-07-14 06:40:22,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:40:22,574 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-14 06:40:22,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:22,575 INFO L225 Difference]: With dead ends: 105 [2022-07-14 06:40:22,575 INFO L226 Difference]: Without dead ends: 105 [2022-07-14 06:40:22,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:40:22,575 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 68 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:22,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 145 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:40:22,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-14 06:40:22,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2022-07-14 06:40:22,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.3255813953488371) internal successors, (114), 103 states have internal predecessors, (114), 0 states have call successors, (0), 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:40:22,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2022-07-14 06:40:22,578 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 23 [2022-07-14 06:40:22,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:22,578 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2022-07-14 06:40:22,578 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:40:22,578 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2022-07-14 06:40:22,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 06:40:22,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:22,578 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:40:22,588 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:40:22,787 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:40:22,788 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:22,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:22,788 INFO L85 PathProgramCache]: Analyzing trace with hash 2133696845, now seen corresponding path program 1 times [2022-07-14 06:40:22,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:40:22,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2023627435] [2022-07-14 06:40:22,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:22,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:40:22,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:40:22,790 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:40:22,791 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:40:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:22,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-14 06:40:22,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:22,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-14 06:40:22,947 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 34 treesize of output 18 [2022-07-14 06:40:23,005 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:40:23,005 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:40:23,005 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:40:23,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2023627435] [2022-07-14 06:40:23,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2023627435] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:23,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:23,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:40:23,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676125918] [2022-07-14 06:40:23,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:23,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:40:23,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:40:23,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:40:23,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:40:23,006 INFO L87 Difference]: Start difference. First operand 104 states and 114 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:40:23,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:23,656 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2022-07-14 06:40:23,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:40:23,658 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-07-14 06:40:23,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:23,658 INFO L225 Difference]: With dead ends: 105 [2022-07-14 06:40:23,659 INFO L226 Difference]: Without dead ends: 105 [2022-07-14 06:40:23,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:40:23,659 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 57 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:23,659 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 161 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:40:23,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-14 06:40:23,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2022-07-14 06:40:23,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.313953488372093) internal successors, (113), 103 states have internal predecessors, (113), 0 states have call successors, (0), 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:40:23,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2022-07-14 06:40:23,661 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 23 [2022-07-14 06:40:23,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:23,661 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2022-07-14 06:40:23,662 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:40:23,662 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2022-07-14 06:40:23,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 06:40:23,662 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:23,662 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:40:23,671 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Ended with exit code 0 [2022-07-14 06:40:23,862 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:40:23,863 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:23,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:23,863 INFO L85 PathProgramCache]: Analyzing trace with hash -651056198, now seen corresponding path program 1 times [2022-07-14 06:40:23,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:40:23,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1772033407] [2022-07-14 06:40:23,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:23,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:40:23,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:40:23,865 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:40:23,869 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-14 06:40:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:23,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-14 06:40:23,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:23,978 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:40:23,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:40:23,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:40:23,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1772033407] [2022-07-14 06:40:23,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1772033407] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:23,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:23,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:40:23,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462979774] [2022-07-14 06:40:23,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:23,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:40:23,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:40:23,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:40:23,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:40:23,981 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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:40:24,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:24,013 INFO L93 Difference]: Finished difference Result 173 states and 186 transitions. [2022-07-14 06:40:24,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:40:24,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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:40:24,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:24,015 INFO L225 Difference]: With dead ends: 173 [2022-07-14 06:40:24,015 INFO L226 Difference]: Without dead ends: 173 [2022-07-14 06:40:24,015 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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:40:24,016 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 59 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:24,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 147 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:40:24,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-07-14 06:40:24,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 118. [2022-07-14 06:40:24,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 100 states have (on average 1.3) internal successors, (130), 117 states have internal predecessors, (130), 0 states have call successors, (0), 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:40:24,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 130 transitions. [2022-07-14 06:40:24,019 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 130 transitions. Word has length 23 [2022-07-14 06:40:24,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:24,020 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 130 transitions. [2022-07-14 06:40:24,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 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:40:24,020 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 130 transitions. [2022-07-14 06:40:24,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 06:40:24,020 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:24,021 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:24,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-07-14 06:40:24,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:40:24,226 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:24,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:24,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1303799964, now seen corresponding path program 1 times [2022-07-14 06:40:24,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:40:24,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974442616] [2022-07-14 06:40:24,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:24,227 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:40:24,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:40:24,228 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:40:24,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-14 06:40:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:24,344 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 31 conjunts are in the unsatisfiable core [2022-07-14 06:40:24,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:24,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-14 06:40:24,364 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:40:24,380 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:24,380 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:40:24,388 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:24,388 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:40:24,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:24,438 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:40:24,443 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:40:24,628 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:24,628 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 20 treesize of output 14 [2022-07-14 06:40:28,966 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:28,972 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:40:28,972 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 37 [2022-07-14 06:40:28,979 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:40:28,979 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 34 [2022-07-14 06:40:29,050 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:29,053 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:29,053 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 26 treesize of output 13 [2022-07-14 06:40:29,096 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:40:29,096 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:40:29,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:40:29,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974442616] [2022-07-14 06:40:29,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974442616] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:29,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:29,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-07-14 06:40:29,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597978196] [2022-07-14 06:40:29,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:29,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 06:40:29,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:40:29,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 06:40:29,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=148, Unknown=2, NotChecked=0, Total=182 [2022-07-14 06:40:29,098 INFO L87 Difference]: Start difference. First operand 118 states and 130 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:40:29,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:29,504 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2022-07-14 06:40:29,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 06:40:29,505 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:40:29,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:29,505 INFO L225 Difference]: With dead ends: 120 [2022-07-14 06:40:29,505 INFO L226 Difference]: Without dead ends: 120 [2022-07-14 06:40:29,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=56, Invalid=248, Unknown=2, NotChecked=0, Total=306 [2022-07-14 06:40:29,506 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 34 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 191 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:29,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 404 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 130 Invalid, 0 Unknown, 191 Unchecked, 0.3s Time] [2022-07-14 06:40:29,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-14 06:40:29,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 117. [2022-07-14 06:40:29,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 99 states have (on average 1.292929292929293) internal successors, (128), 116 states have internal predecessors, (128), 0 states have call successors, (0), 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:40:29,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 128 transitions. [2022-07-14 06:40:29,508 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 128 transitions. Word has length 24 [2022-07-14 06:40:29,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:29,508 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 128 transitions. [2022-07-14 06:40:29,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:40:29,508 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 128 transitions. [2022-07-14 06:40:29,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:40:29,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:29,509 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] [2022-07-14 06:40:29,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-14 06:40:29,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:40:29,721 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:29,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:29,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1783269649, now seen corresponding path program 1 times [2022-07-14 06:40:29,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:40:29,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2047887901] [2022-07-14 06:40:29,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:29,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:40:29,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:40:29,722 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:40:29,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-14 06:40:29,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:29,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-14 06:40:29,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:29,875 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 17 [2022-07-14 06:40:29,877 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 13 [2022-07-14 06:40:29,906 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:40:29,918 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:29,918 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 06:40:29,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:40:29,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2047887901] [2022-07-14 06:40:29,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2047887901] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:29,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:29,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:40:29,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304447866] [2022-07-14 06:40:29,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:29,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:40:29,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:40:29,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:40:29,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:40:29,919 INFO L87 Difference]: Start difference. First operand 117 states and 128 transitions. Second operand has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:30,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:30,395 INFO L93 Difference]: Finished difference Result 128 states and 139 transitions. [2022-07-14 06:40:30,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:40:30,396 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-14 06:40:30,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:30,396 INFO L225 Difference]: With dead ends: 128 [2022-07-14 06:40:30,396 INFO L226 Difference]: Without dead ends: 128 [2022-07-14 06:40:30,397 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:40:30,397 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 29 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:30,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 301 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:40:30,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-14 06:40:30,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2022-07-14 06:40:30,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 107 states have (on average 1.280373831775701) internal successors, (137), 124 states have internal predecessors, (137), 0 states have call successors, (0), 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:40:30,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 137 transitions. [2022-07-14 06:40:30,399 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 137 transitions. Word has length 25 [2022-07-14 06:40:30,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:30,400 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 137 transitions. [2022-07-14 06:40:30,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 9 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:30,400 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 137 transitions. [2022-07-14 06:40:30,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:40:30,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:30,400 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:30,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-14 06:40:30,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:40:30,607 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:30,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:30,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1432037180, now seen corresponding path program 1 times [2022-07-14 06:40:30,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:40:30,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1196857512] [2022-07-14 06:40:30,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:30,608 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:40:30,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:40:30,609 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:40:30,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-14 06:40:30,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:30,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-14 06:40:30,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:30,756 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:40:30,787 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:40:30,787 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:40:30,801 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:40:30,861 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:30,861 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:40:30,916 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:30,916 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 28 [2022-07-14 06:40:30,940 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:30,940 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 28 [2022-07-14 06:40:30,968 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:30,969 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:40:30,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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:40:31,009 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:40:31,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:40:31,030 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_818 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_818) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-14 06:40:31,046 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_818 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_818) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-14 06:40:31,050 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_818 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_818) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-14 06:40:31,059 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_815 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_815))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_818)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-14 06:40:31,069 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_818 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_815 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_815))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_818)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) is different from false [2022-07-14 06:40:31,080 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:31,081 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:40:31,094 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:31,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 128 [2022-07-14 06:40:31,107 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:31,107 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 112 treesize of output 111 [2022-07-14 06:40:31,113 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 102 treesize of output 98 [2022-07-14 06:40:31,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-14 06:40:31,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:40:31,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1196857512] [2022-07-14 06:40:31,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1196857512] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:40:31,277 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:40:31,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 20 [2022-07-14 06:40:31,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452277007] [2022-07-14 06:40:31,278 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:40:31,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-14 06:40:31,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:40:31,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-14 06:40:31,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=172, Unknown=5, NotChecked=150, Total=380 [2022-07-14 06:40:31,278 INFO L87 Difference]: Start difference. First operand 125 states and 137 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 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:40:31,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:31,984 INFO L93 Difference]: Finished difference Result 224 states and 246 transitions. [2022-07-14 06:40:31,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-14 06:40:31,984 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 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:40:31,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:31,985 INFO L225 Difference]: With dead ends: 224 [2022-07-14 06:40:31,985 INFO L226 Difference]: Without dead ends: 224 [2022-07-14 06:40:31,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=278, Unknown=5, NotChecked=190, Total=552 [2022-07-14 06:40:31,985 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 120 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 580 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:31,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 753 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 437 Invalid, 0 Unknown, 580 Unchecked, 0.6s Time] [2022-07-14 06:40:31,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-07-14 06:40:31,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 139. [2022-07-14 06:40:31,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 121 states have (on average 1.2727272727272727) internal successors, (154), 138 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:31,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 154 transitions. [2022-07-14 06:40:31,989 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 154 transitions. Word has length 25 [2022-07-14 06:40:31,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:31,989 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 154 transitions. [2022-07-14 06:40:31,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 0 states have call successors, (0), 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:40:31,989 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 154 transitions. [2022-07-14 06:40:31,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 06:40:31,990 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:31,990 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:40:31,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-14 06:40:32,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:40:32,190 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:40:32,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:32,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1443483791, now seen corresponding path program 1 times [2022-07-14 06:40:32,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:40:32,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [476327940] [2022-07-14 06:40:32,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:32,191 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:40:32,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:40:32,192 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:40:32,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-14 06:40:32,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:32,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-14 06:40:32,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:32,337 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:40:32,370 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-14 06:40:32,370 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-14 06:40:32,397 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:40:32,469 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:32,469 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:40:32,537 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:32,537 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 29 [2022-07-14 06:40:32,562 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:32,563 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 29 [2022-07-14 06:40:32,600 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:32,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:40:32,619 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:40:32,663 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:40:32,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:40:32,698 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_878) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-14 06:40:32,746 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_878) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-14 06:40:32,756 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_878 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_875))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_878)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-14 06:40:32,763 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_875 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_878 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_875))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_878)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-14 06:40:32,773 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:32,773 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 38 treesize of output 31 [2022-07-14 06:40:32,783 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:32,783 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 144 treesize of output 131 [2022-07-14 06:40:32,794 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:32,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 116 treesize of output 114 [2022-07-14 06:40:32,798 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 106 treesize of output 102 [2022-07-14 06:40:56,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-14 06:40:56,970 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:40:56,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [476327940] [2022-07-14 06:40:56,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [476327940] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:40:56,970 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:40:56,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2022-07-14 06:40:56,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893650584] [2022-07-14 06:40:56,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:40:56,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-14 06:40:56,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:40:56,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-14 06:40:56,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=256, Unknown=12, NotChecked=148, Total=506 [2022-07-14 06:40:56,972 INFO L87 Difference]: Start difference. First operand 139 states and 154 transitions. Second operand has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 23 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:41:04,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:41:04,002 INFO L93 Difference]: Finished difference Result 245 states and 274 transitions. [2022-07-14 06:41:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 06:41:04,003 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 23 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) Word has length 26 [2022-07-14 06:41:04,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:41:04,003 INFO L225 Difference]: With dead ends: 245 [2022-07-14 06:41:04,003 INFO L226 Difference]: Without dead ends: 245 [2022-07-14 06:41:04,004 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 32 SyntacticMatches, 7 SemanticMatches, 32 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 29.6s TimeCoverageRelationStatistics Valid=242, Invalid=629, Unknown=15, NotChecked=236, Total=1122 [2022-07-14 06:41:04,004 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 389 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1064 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:41:04,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [389 Valid, 430 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 371 Invalid, 0 Unknown, 1064 Unchecked, 0.6s Time] [2022-07-14 06:41:04,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-07-14 06:41:04,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 141. [2022-07-14 06:41:04,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 123 states have (on average 1.2764227642276422) internal successors, (157), 140 states have internal predecessors, (157), 0 states have call successors, (0), 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:41:04,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 157 transitions. [2022-07-14 06:41:04,006 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 157 transitions. Word has length 26 [2022-07-14 06:41:04,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:41:04,006 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 157 transitions. [2022-07-14 06:41:04,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 23 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:41:04,007 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 157 transitions. [2022-07-14 06:41:04,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 06:41:04,007 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:41:04,007 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:41:04,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2022-07-14 06:41:04,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:41:04,212 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:41:04,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:41:04,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1443483792, now seen corresponding path program 1 times [2022-07-14 06:41:04,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:41:04,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1119025292] [2022-07-14 06:41:04,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:41:04,212 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:41:04,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:41:04,213 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:41:04,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-14 06:41:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:41:04,361 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-14 06:41:04,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:41:04,365 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:41:04,390 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:41:04,390 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:41:04,394 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:41:04,421 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:41:04,430 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:41:04,497 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:41:04,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, 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:41:04,501 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:41:04,570 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:41:04,570 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 14 treesize of output 20 [2022-07-14 06:41:04,574 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:41:04,590 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:41:04,591 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 29 [2022-07-14 06:41:04,623 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:41:04,624 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 29 [2022-07-14 06:41:04,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:41:04,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-14 06:41:04,666 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:41:04,667 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:41:04,670 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:41:04,694 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:41:04,697 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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:41:04,739 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:41:04,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:41:04,930 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_944) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_943 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_944) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_943) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-14 06:41:04,986 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_943 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_944) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_943) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_944) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32)))))) is different from false [2022-07-14 06:41:05,018 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_944) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_943 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_944) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_943) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2022-07-14 06:41:05,112 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_943 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_937))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv12 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_938) .cse0 v_ArrVal_944) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store .cse1 .cse0 v_ArrVal_943) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) (forall ((v_ArrVal_938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_938) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_937) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_944) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse2) (bvadd (_ bv12 32) .cse2))))) is different from false [2022-07-14 06:41:05,327 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_938) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_937) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_944)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule (bvadd (_ bv8 32) .cse0) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_938 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_937 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_943 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_944 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_937))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_938) .cse3 v_ArrVal_944) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_943) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2022-07-14 06:41:05,364 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:41:05,364 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 73 treesize of output 66 [2022-07-14 06:41:05,370 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:41:05,371 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 57 treesize of output 50 [2022-07-14 06:41:05,373 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 84 treesize of output 72 [2022-07-14 06:41:05,400 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:41:05,400 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 232 treesize of output 215 [2022-07-14 06:41:05,411 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 166 treesize of output 158 [2022-07-14 06:41:05,419 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 192 treesize of output 172 [2022-07-14 06:41:05,428 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 142 treesize of output 130 [2022-07-14 06:41:05,645 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:41:05,645 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 73 treesize of output 74 [2022-07-14 06:41:05,667 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:41:05,668 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 65 treesize of output 50 [2022-07-14 06:41:05,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:41:05,671 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:41:05,674 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 74 treesize of output 50 [2022-07-14 06:41:05,677 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:41:05,680 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 42 treesize of output 30 [2022-07-14 06:41:05,685 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 11 [2022-07-14 06:41:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-14 06:41:05,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:41:05,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1119025292] [2022-07-14 06:41:05,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1119025292] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:41:05,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:41:05,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2022-07-14 06:41:05,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026383049] [2022-07-14 06:41:05,819 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:41:05,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-14 06:41:05,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:41:05,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-14 06:41:05,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=230, Unknown=5, NotChecked=170, Total=462 [2022-07-14 06:41:05,819 INFO L87 Difference]: Start difference. First operand 141 states and 157 transitions. Second operand has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 22 states have internal predecessors, (47), 0 states have call successors, (0), 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:41:08,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:41:08,722 INFO L93 Difference]: Finished difference Result 226 states and 248 transitions. [2022-07-14 06:41:08,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 06:41:08,724 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 22 states have internal predecessors, (47), 0 states have call successors, (0), 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:41:08,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:41:08,725 INFO L225 Difference]: With dead ends: 226 [2022-07-14 06:41:08,725 INFO L226 Difference]: Without dead ends: 226 [2022-07-14 06:41:08,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 28 SyntacticMatches, 6 SemanticMatches, 35 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=198, Invalid=809, Unknown=5, NotChecked=320, Total=1332 [2022-07-14 06:41:08,725 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 247 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 875 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 531 SdHoareTripleChecker+Invalid, 1565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 875 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 646 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-14 06:41:08,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 531 Invalid, 1565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 875 Invalid, 0 Unknown, 646 Unchecked, 1.8s Time] [2022-07-14 06:41:08,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-07-14 06:41:08,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 151. [2022-07-14 06:41:08,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 133 states have (on average 1.2857142857142858) internal successors, (171), 150 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:41:08,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 171 transitions. [2022-07-14 06:41:08,728 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 171 transitions. Word has length 26 [2022-07-14 06:41:08,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:41:08,728 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 171 transitions. [2022-07-14 06:41:08,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.238095238095238) internal successors, (47), 22 states have internal predecessors, (47), 0 states have call successors, (0), 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:41:08,728 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 171 transitions. [2022-07-14 06:41:08,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-14 06:41:08,729 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:41:08,729 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:41:08,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-14 06:41:08,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:41:08,929 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:41:08,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:41:08,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1787465436, now seen corresponding path program 1 times [2022-07-14 06:41:08,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:41:08,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1657456654] [2022-07-14 06:41:08,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:41:08,930 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:41:08,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:41:08,940 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:41:08,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-14 06:41:09,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:41:09,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-14 06:41:09,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:41:09,155 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-14 06:41:09,155 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 21 [2022-07-14 06:41:09,220 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-14 06:41:09,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-07-14 06:41:09,263 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:41:09,430 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:41:09,430 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 44 treesize of output 43 [2022-07-14 06:41:09,493 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 41 treesize of output 25 [2022-07-14 06:41:10,149 INFO L356 Elim1Store]: treesize reduction 61, result has 37.8 percent of original size [2022-07-14 06:41:10,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 36 treesize of output 63 [2022-07-14 06:41:10,319 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:41:11,380 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:41:11,380 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 52 treesize of output 49 [2022-07-14 06:41:11,974 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 49 treesize of output 29 [2022-07-14 06:41:12,696 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:41:12,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:41:12,756 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1014) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-14 06:41:12,766 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1014 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1014) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-14 06:41:12,775 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:41:12,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, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 21 [2022-07-14 06:41:12,777 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 34 treesize of output 26 [2022-07-14 06:41:12,780 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 11 treesize of output 9 [2022-07-14 06:41:28,741 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:41:28,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 47 treesize of output 39 [2022-07-14 06:41:28,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 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 60 [2022-07-14 06:41:28,752 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 41 treesize of output 37 [2022-07-14 06:41:48,664 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-14 06:41:48,664 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:41:48,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1657456654] [2022-07-14 06:41:48,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1657456654] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:41:48,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:41:48,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 28 [2022-07-14 06:41:48,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197994944] [2022-07-14 06:41:48,664 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:41:48,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-14 06:41:48,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:41:48,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-14 06:41:48,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=560, Unknown=26, NotChecked=102, Total=812 [2022-07-14 06:41:48,665 INFO L87 Difference]: Start difference. First operand 151 states and 171 transitions. Second operand has 29 states, 28 states have (on average 2.0) internal successors, (56), 29 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:41:49,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:41:49,288 INFO L93 Difference]: Finished difference Result 210 states and 233 transitions. [2022-07-14 06:41:49,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 06:41:49,289 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.0) internal successors, (56), 29 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:41:49,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:41:49,290 INFO L225 Difference]: With dead ends: 210 [2022-07-14 06:41:49,290 INFO L226 Difference]: Without dead ends: 210 [2022-07-14 06:41:49,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 26 SyntacticMatches, 6 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 36.4s TimeCoverageRelationStatistics Valid=202, Invalid=836, Unknown=26, NotChecked=126, Total=1190 [2022-07-14 06:41:49,290 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 194 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 667 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:41:49,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 629 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 224 Invalid, 0 Unknown, 667 Unchecked, 0.3s Time] [2022-07-14 06:41:49,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2022-07-14 06:41:49,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 150. [2022-07-14 06:41:49,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 133 states have (on average 1.2706766917293233) internal successors, (169), 149 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:41:49,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 169 transitions. [2022-07-14 06:41:49,293 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 169 transitions. Word has length 28 [2022-07-14 06:41:49,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:41:49,293 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 169 transitions. [2022-07-14 06:41:49,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.0) internal successors, (56), 29 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:41:49,293 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 169 transitions. [2022-07-14 06:41:49,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 06:41:49,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:41:49,294 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:41:49,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-07-14 06:41:49,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:41:49,502 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:41:49,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:41:49,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1072637933, now seen corresponding path program 1 times [2022-07-14 06:41:49,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:41:49,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1416024687] [2022-07-14 06:41:49,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:41:49,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:41:49,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:41:49,504 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:41:49,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-14 06:41:49,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:41:49,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 06:41:49,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:41:49,679 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 26 treesize of output 18 [2022-07-14 06:41:49,681 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 22 treesize of output 14 [2022-07-14 06:41:49,712 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 8 [2022-07-14 06:41:49,724 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:41:49,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:41:49,788 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-14 06:41:49,788 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 28 treesize of output 23 [2022-07-14 06:41:49,803 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:41:49,804 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:41:49,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1416024687] [2022-07-14 06:41:49,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1416024687] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:41:49,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:41:49,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2022-07-14 06:41:49,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233696847] [2022-07-14 06:41:49,804 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:41:49,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:41:49,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:41:49,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:41:49,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:41:49,805 INFO L87 Difference]: Start difference. First operand 150 states and 169 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:41:50,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:41:50,338 INFO L93 Difference]: Finished difference Result 181 states and 203 transitions. [2022-07-14 06:41:50,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:41:50,339 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-14 06:41:50,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:41:50,339 INFO L225 Difference]: With dead ends: 181 [2022-07-14 06:41:50,339 INFO L226 Difference]: Without dead ends: 181 [2022-07-14 06:41:50,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-07-14 06:41:50,340 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 112 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:41:50,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 312 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:41:50,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-07-14 06:41:50,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 155. [2022-07-14 06:41:50,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 138 states have (on average 1.2681159420289856) internal successors, (175), 154 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:41:50,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 175 transitions. [2022-07-14 06:41:50,343 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 175 transitions. Word has length 29 [2022-07-14 06:41:50,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:41:50,343 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 175 transitions. [2022-07-14 06:41:50,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:41:50,344 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 175 transitions. [2022-07-14 06:41:50,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 06:41:50,344 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:41:50,344 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:41:50,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-14 06:41:50,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:41:50,551 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:41:50,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:41:50,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1072637882, now seen corresponding path program 1 times [2022-07-14 06:41:50,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:41:50,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396189892] [2022-07-14 06:41:50,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:41:50,552 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:41:50,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:41:50,554 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:41:50,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-14 06:41:50,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:41:50,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-14 06:41:50,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:41:50,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-07-14 06:41:50,805 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 32 treesize of output 16 [2022-07-14 06:41:50,956 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:41:50,956 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:41:51,835 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:41:51,836 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 52 [2022-07-14 06:41:52,766 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:41:52,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:41:52,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396189892] [2022-07-14 06:41:52,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1396189892] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:41:52,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:41:52,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-07-14 06:41:52,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461513106] [2022-07-14 06:41:52,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:41:52,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-14 06:41:52,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:41:52,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-14 06:41:52,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:41:52,768 INFO L87 Difference]: Start difference. First operand 155 states and 175 transitions. Second operand has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 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:41:56,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:41:56,425 INFO L93 Difference]: Finished difference Result 177 states and 197 transitions. [2022-07-14 06:41:56,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 06:41:56,426 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 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:41:56,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:41:56,432 INFO L225 Difference]: With dead ends: 177 [2022-07-14 06:41:56,432 INFO L226 Difference]: Without dead ends: 177 [2022-07-14 06:41:56,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=94, Invalid=326, Unknown=0, NotChecked=0, Total=420 [2022-07-14 06:41:56,432 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 201 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-14 06:41:56,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 280 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-14 06:41:56,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-14 06:41:56,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 141. [2022-07-14 06:41:56,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 126 states have (on average 1.2380952380952381) internal successors, (156), 140 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:41:56,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 156 transitions. [2022-07-14 06:41:56,440 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 156 transitions. Word has length 29 [2022-07-14 06:41:56,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:41:56,440 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 156 transitions. [2022-07-14 06:41:56,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.166666666666667) internal successors, (50), 13 states have internal predecessors, (50), 0 states have call successors, (0), 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:41:56,441 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 156 transitions. [2022-07-14 06:41:56,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 06:41:56,441 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:41:56,442 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] [2022-07-14 06:41:56,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-07-14 06:41:56,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:41:56,650 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:41:56,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:41:56,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1840670327, now seen corresponding path program 1 times [2022-07-14 06:41:56,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:41:56,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2012152976] [2022-07-14 06:41:56,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:41:56,651 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:41:56,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:41:56,652 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:41:56,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-14 06:41:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:41:56,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 26 conjunts are in the unsatisfiable core [2022-07-14 06:41:56,810 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:41:56,816 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:41:56,828 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:41:56,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:41:56,844 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:41:56,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:41:56,855 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:41:56,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:41:56,893 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:41:57,312 INFO L356 Elim1Store]: treesize reduction 13, result has 18.8 percent of original size [2022-07-14 06:41:57,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 46 [2022-07-14 06:41:57,320 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:41:57,320 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 29 [2022-07-14 06:41:57,426 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:41:57,426 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:41:58,255 INFO L356 Elim1Store]: treesize reduction 4, result has 73.3 percent of original size [2022-07-14 06:41:58,256 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 67 [2022-07-14 06:42:02,975 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:42:02,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-14 06:42:02,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2012152976] [2022-07-14 06:42:02,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2012152976] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:42:02,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:42:02,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2022-07-14 06:42:02,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368845319] [2022-07-14 06:42:02,976 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:42:02,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-14 06:42:02,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-14 06:42:02,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-14 06:42:02,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=347, Unknown=1, NotChecked=0, Total=420 [2022-07-14 06:42:02,977 INFO L87 Difference]: Start difference. First operand 141 states and 156 transitions. Second operand has 21 states, 20 states have (on average 2.85) internal successors, (57), 21 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:42:04,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:42:04,129 INFO L93 Difference]: Finished difference Result 195 states and 213 transitions. [2022-07-14 06:42:04,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 06:42:04,129 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 21 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 29 [2022-07-14 06:42:04,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:42:04,130 INFO L225 Difference]: With dead ends: 195 [2022-07-14 06:42:04,130 INFO L226 Difference]: Without dead ends: 195 [2022-07-14 06:42:04,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=107, Invalid=492, Unknown=1, NotChecked=0, Total=600 [2022-07-14 06:42:04,131 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 131 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 589 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 239 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 06:42:04,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 589 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 293 Invalid, 0 Unknown, 239 Unchecked, 0.9s Time] [2022-07-14 06:42:04,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-07-14 06:42:04,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 146. [2022-07-14 06:42:04,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 131 states have (on average 1.2366412213740459) internal successors, (162), 145 states have internal predecessors, (162), 0 states have call successors, (0), 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:42:04,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 162 transitions. [2022-07-14 06:42:04,133 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 162 transitions. Word has length 29 [2022-07-14 06:42:04,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:42:04,133 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 162 transitions. [2022-07-14 06:42:04,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 21 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:42:04,133 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 162 transitions. [2022-07-14 06:42:04,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-14 06:42:04,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:42:04,134 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:42:04,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Ended with exit code 0 [2022-07-14 06:42:04,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-14 06:42:04,334 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2022-07-14 06:42:04,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:42:04,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1613135658, now seen corresponding path program 1 times [2022-07-14 06:42:04,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-14 06:42:04,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2132324692] [2022-07-14 06:42:04,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:42:04,335 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-14 06:42:04,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-14 06:42:04,337 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-14 06:42:04,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-07-14 06:42:04,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:42:04,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-14 06:42:04,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:42:04,498 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-14 06:42:04,498 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 21 [2022-07-14 06:42:04,559 INFO L356 Elim1Store]: treesize reduction 9, result has 64.0 percent of original size [2022-07-14 06:42:04,559 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 20 treesize of output 29 [2022-07-14 06:42:04,588 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:42:04,601 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:42:04,675 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:42:04,675 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 29 treesize of output 30 [2022-07-14 06:42:04,679 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:42:04,765 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:42:04,765 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 25 [2022-07-14 06:42:04,774 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 11 treesize of output 7 [2022-07-14 06:42:04,798 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-14 06:42:04,798 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 27 treesize of output 22 [2022-07-14 06:42:04,869 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-14 06:42:04,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2022-07-14 06:42:04,878 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 21 [2022-07-14 06:42:04,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:42:04,945 INFO L356 Elim1Store]: treesize reduction 53, result has 11.7 percent of original size [2022-07-14 06:42:04,945 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:42:04,949 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 33 treesize of output 33 [2022-07-14 06:42:04,986 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 18 [2022-07-14 06:42:05,132 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-07-14 06:42:05,132 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 14 [2022-07-14 06:42:05,152 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:42:05,152 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:42:05,258 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1167 (_ BitVec 32))) (= (bvadd (_ bv1 1) (bvneg (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1167)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1168) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (_ bv0 1))) is different from false [2022-07-14 06:42:05,311 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1167 (_ BitVec 32))) (= (bvadd (bvneg (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1167)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1168) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (_ bv1 1)) (_ bv0 1))) is different from false [2022-07-14 06:42:05,335 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1167 (_ BitVec 32))) (= (bvadd (_ bv1 1) (bvneg (select |c_#valid| (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| (store (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base|) |c_ULTIMATE.start_main_#t~mem5#1.offset| |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_#t~mem5#1.offset|) v_ArrVal_1167)))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_1168) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (_ bv0 1))) is different from false [2022-07-14 06:42:05,362 INFO L356 Elim1Store]: treesize reduction 5, result has 94.1 percent of original size [2022-07-14 06:42:05,362 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 92 treesize of output 91 [2022-07-14 06:42:05,377 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1167 (_ BitVec 32))) (= |c_ULTIMATE.start_main_~x~0#1.base| (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store (select |c_#memory_$Pointer$.base| .cse1) .cse2 |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) .cse2) v_ArrVal_1167))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_1168) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-14 06:42:05,412 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1160 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1167 (_ BitVec 32))) (= (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1160))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1159)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store (select .cse1 .cse2) .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd (_ bv8 32) .cse3) v_ArrVal_1167))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store .cse4 .cse2 v_ArrVal_1168) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) |c_ULTIMATE.start_main_~x~0#1.base|)) is different from false [2022-07-14 06:42:05,453 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1160 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1159 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1168 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1167 (_ BitVec 32))) (= (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (let ((.cse1 (store |c_#memory_$Pointer$.base| .cse5 v_ArrVal_1160))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| .cse5 v_ArrVal_1159)) (.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (select (let ((.cse0 (store .cse1 .cse2 (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store (select .cse1 .cse2) .cse3 |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd .cse3 (_ bv8 32)) v_ArrVal_1167))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (select (select (store .cse4 .cse2 v_ArrVal_1168) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) |c_ULTIMATE.start_main_~x~0#1.base|)) is different from false [2022-07-14 06:42:05,505 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:42:05,505 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 234 treesize of output 203 [2022-07-14 06:42:05,518 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:42:05,518 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 194 treesize of output 131 [2022-07-14 06:42:07,184 INFO L356 Elim1Store]: treesize reduction 204, result has 60.2 percent of original size [2022-07-14 06:42:07,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 13 new quantified variables, introduced 36 case distinctions, treesize of input 7950 treesize of output 7088 [2022-07-14 06:42:07,456 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:42:07,457 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 13332 treesize of output 11979 [2022-07-14 06:42:07,758 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:42:07,759 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 11964 treesize of output 11292 [2022-07-14 06:42:08,464 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:42:08,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 20659 treesize of output 19255 [2022-07-14 06:42:08,976 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 18554 treesize of output 18194