./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 26d01a9c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/sll2c_insert_unequal.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 b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-26d01a9 [2023-02-17 03:27:35,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-17 03:27:35,377 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-17 03:27:35,409 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-17 03:27:35,410 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-17 03:27:35,413 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-17 03:27:35,415 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-17 03:27:35,417 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-17 03:27:35,418 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-17 03:27:35,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-17 03:27:35,424 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-17 03:27:35,426 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-17 03:27:35,426 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-17 03:27:35,428 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-17 03:27:35,430 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-17 03:27:35,431 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-17 03:27:35,433 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-17 03:27:35,434 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-17 03:27:35,435 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-17 03:27:35,440 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-17 03:27:35,441 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-17 03:27:35,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-17 03:27:35,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-17 03:27:35,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-17 03:27:35,455 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-17 03:27:35,455 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-17 03:27:35,456 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-17 03:27:35,457 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-17 03:27:35,457 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-17 03:27:35,458 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-17 03:27:35,459 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-17 03:27:35,459 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-17 03:27:35,461 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-17 03:27:35,462 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-17 03:27:35,464 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-17 03:27:35,464 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-17 03:27:35,464 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-17 03:27:35,465 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-17 03:27:35,465 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-17 03:27:35,466 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-17 03:27:35,466 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-17 03:27:35,467 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-17 03:27:35,514 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-17 03:27:35,515 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-17 03:27:35,515 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-17 03:27:35,516 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-17 03:27:35,516 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-17 03:27:35,516 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-17 03:27:35,517 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-17 03:27:35,517 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-17 03:27:35,517 INFO L138 SettingsManager]: * Use SBE=true [2023-02-17 03:27:35,518 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-17 03:27:35,518 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-17 03:27:35,518 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-17 03:27:35,519 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-17 03:27:35,519 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-17 03:27:35,519 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-17 03:27:35,519 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-17 03:27:35,519 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-17 03:27:35,519 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-17 03:27:35,520 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-17 03:27:35,520 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-17 03:27:35,520 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-17 03:27:35,520 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-17 03:27:35,520 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-17 03:27:35,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-17 03:27:35,521 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-17 03:27:35,521 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 03:27:35,521 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-17 03:27:35,521 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-17 03:27:35,522 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-17 03:27:35,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-17 03:27:35,522 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-17 03:27:35,522 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-17 03:27:35,523 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-17 03:27:35,523 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-17 03:27:35,523 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b7b415e0519ab150e9247d3d9d0133f92cfd07c34f9918f9ebd19cf8109bf4e7 [2023-02-17 03:27:35,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-17 03:27:35,795 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-17 03:27:35,798 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-17 03:27:35,798 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-17 03:27:35,799 INFO L275 PluginConnector]: CDTParser initialized [2023-02-17 03:27:35,800 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2023-02-17 03:27:36,975 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-17 03:27:37,252 INFO L351 CDTParser]: Found 1 translation units. [2023-02-17 03:27:37,252 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i [2023-02-17 03:27:37,261 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cab71009b/f97ab89668be46a098e81b998aafb824/FLAG72fc518b4 [2023-02-17 03:27:37,272 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cab71009b/f97ab89668be46a098e81b998aafb824 [2023-02-17 03:27:37,274 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-17 03:27:37,275 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-17 03:27:37,276 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-17 03:27:37,277 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-17 03:27:37,279 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-17 03:27:37,280 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 03:27:37" (1/1) ... [2023-02-17 03:27:37,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ffab20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:27:37, skipping insertion in model container [2023-02-17 03:27:37,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.02 03:27:37" (1/1) ... [2023-02-17 03:27:37,287 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-17 03:27:37,325 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-17 03:27:37,595 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2023-02-17 03:27:37,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 03:27:37,608 INFO L203 MainTranslator]: Completed pre-run [2023-02-17 03:27:37,665 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_insert_unequal.i[24872,24885] [2023-02-17 03:27:37,668 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-17 03:27:37,690 INFO L208 MainTranslator]: Completed translation [2023-02-17 03:27:37,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:27:37 WrapperNode [2023-02-17 03:27:37,690 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-17 03:27:37,691 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-17 03:27:37,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-17 03:27:37,692 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-17 03:27:37,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:27:37" (1/1) ... [2023-02-17 03:27:37,712 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:27:37" (1/1) ... [2023-02-17 03:27:37,735 INFO L138 Inliner]: procedures = 127, calls = 48, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 178 [2023-02-17 03:27:37,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-17 03:27:37,736 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-17 03:27:37,736 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-17 03:27:37,736 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-17 03:27:37,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:27:37" (1/1) ... [2023-02-17 03:27:37,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:27:37" (1/1) ... [2023-02-17 03:27:37,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:27:37" (1/1) ... [2023-02-17 03:27:37,750 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:27:37" (1/1) ... [2023-02-17 03:27:37,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:27:37" (1/1) ... [2023-02-17 03:27:37,762 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:27:37" (1/1) ... [2023-02-17 03:27:37,764 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:27:37" (1/1) ... [2023-02-17 03:27:37,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:27:37" (1/1) ... [2023-02-17 03:27:37,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-17 03:27:37,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-17 03:27:37,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-17 03:27:37,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-17 03:27:37,770 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:27:37" (1/1) ... [2023-02-17 03:27:37,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-17 03:27:37,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:27:37,806 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-17 03:27:37,808 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-17 03:27:37,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-02-17 03:27:37,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-02-17 03:27:37,834 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-02-17 03:27:37,835 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-02-17 03:27:37,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-17 03:27:37,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-17 03:27:37,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-17 03:27:37,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-17 03:27:37,835 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-17 03:27:37,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-17 03:27:37,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-17 03:27:37,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-02-17 03:27:37,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-17 03:27:37,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-17 03:27:37,935 INFO L235 CfgBuilder]: Building ICFG [2023-02-17 03:27:37,937 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-17 03:27:38,322 INFO L276 CfgBuilder]: Performing block encoding [2023-02-17 03:27:38,329 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-17 03:27:38,329 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-17 03:27:38,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 03:27:38 BoogieIcfgContainer [2023-02-17 03:27:38,331 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-17 03:27:38,333 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-17 03:27:38,333 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-17 03:27:38,336 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-17 03:27:38,336 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.02 03:27:37" (1/3) ... [2023-02-17 03:27:38,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6daf3d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 03:27:38, skipping insertion in model container [2023-02-17 03:27:38,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.02 03:27:37" (2/3) ... [2023-02-17 03:27:38,337 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6daf3d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.02 03:27:38, skipping insertion in model container [2023-02-17 03:27:38,337 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.02 03:27:38" (3/3) ... [2023-02-17 03:27:38,338 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_insert_unequal.i [2023-02-17 03:27:38,353 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-17 03:27:38,353 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2023-02-17 03:27:38,395 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-17 03:27:38,400 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@491edf49, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-17 03:27:38,401 INFO L358 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2023-02-17 03:27:38,404 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 74 states have (on average 2.081081081081081) internal successors, (154), 136 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:27:38,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-17 03:27:38,410 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:27:38,410 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-17 03:27:38,411 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-17 03:27:38,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:27:38,416 INFO L85 PathProgramCache]: Analyzing trace with hash 896568277, now seen corresponding path program 1 times [2023-02-17 03:27:38,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:27:38,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279208542] [2023-02-17 03:27:38,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:27:38,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:27:38,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:38,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:27:38,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:27:38,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279208542] [2023-02-17 03:27:38,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279208542] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:27:38,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:27:38,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 03:27:38,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874272614] [2023-02-17 03:27:38,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:27:38,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 03:27:38,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:27:38,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 03:27:38,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 03:27:38,701 INFO L87 Difference]: Start difference. First operand has 141 states, 74 states have (on average 2.081081081081081) internal successors, (154), 136 states have internal predecessors, (154), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:27:38,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:27:38,861 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2023-02-17 03:27:38,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 03:27:38,863 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-17 03:27:38,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:27:38,875 INFO L225 Difference]: With dead ends: 139 [2023-02-17 03:27:38,875 INFO L226 Difference]: Without dead ends: 136 [2023-02-17 03:27:38,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 03:27:38,881 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 8 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:27:38,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 225 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:27:38,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-17 03:27:38,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2023-02-17 03:27:38,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 72 states have (on average 1.9722222222222223) internal successors, (142), 131 states have internal predecessors, (142), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:27:38,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 148 transitions. [2023-02-17 03:27:38,920 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 148 transitions. Word has length 6 [2023-02-17 03:27:38,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:27:38,921 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 148 transitions. [2023-02-17 03:27:38,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:27:38,921 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 148 transitions. [2023-02-17 03:27:38,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-17 03:27:38,922 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:27:38,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-17 03:27:38,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-02-17 03:27:38,922 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-17 03:27:38,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:27:38,923 INFO L85 PathProgramCache]: Analyzing trace with hash 896568278, now seen corresponding path program 1 times [2023-02-17 03:27:38,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:27:38,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949049431] [2023-02-17 03:27:38,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:27:38,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:27:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:39,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:27:39,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:27:39,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949049431] [2023-02-17 03:27:39,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949049431] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:27:39,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:27:39,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-17 03:27:39,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090975685] [2023-02-17 03:27:39,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:27:39,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-17 03:27:39,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:27:39,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-17 03:27:39,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 03:27:39,025 INFO L87 Difference]: Start difference. First operand 136 states and 148 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:27:39,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:27:39,119 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2023-02-17 03:27:39,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-17 03:27:39,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-17 03:27:39,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:27:39,125 INFO L225 Difference]: With dead ends: 134 [2023-02-17 03:27:39,125 INFO L226 Difference]: Without dead ends: 134 [2023-02-17 03:27:39,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-17 03:27:39,129 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 4 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:27:39,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 227 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:27:39,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-17 03:27:39,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2023-02-17 03:27:39,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 72 states have (on average 1.9444444444444444) internal successors, (140), 129 states have internal predecessors, (140), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:27:39,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2023-02-17 03:27:39,148 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 6 [2023-02-17 03:27:39,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:27:39,148 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2023-02-17 03:27:39,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-17 03:27:39,149 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2023-02-17 03:27:39,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-17 03:27:39,151 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:27:39,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:27:39,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-02-17 03:27:39,152 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-17 03:27:39,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:27:39,154 INFO L85 PathProgramCache]: Analyzing trace with hash 24922967, now seen corresponding path program 1 times [2023-02-17 03:27:39,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:27:39,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852481984] [2023-02-17 03:27:39,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:27:39,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:27:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:39,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:27:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:39,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:27:39,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:27:39,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852481984] [2023-02-17 03:27:39,287 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852481984] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:27:39,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:27:39,287 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:27:39,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897418714] [2023-02-17 03:27:39,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:27:39,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:27:39,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:27:39,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:27:39,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:27:39,290 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:27:39,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:27:39,419 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2023-02-17 03:27:39,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 03:27:39,420 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-02-17 03:27:39,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:27:39,422 INFO L225 Difference]: With dead ends: 141 [2023-02-17 03:27:39,422 INFO L226 Difference]: Without dead ends: 141 [2023-02-17 03:27:39,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:27:39,428 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 5 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:27:39,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 338 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:27:39,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-02-17 03:27:39,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 135. [2023-02-17 03:27:39,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 73 states have (on average 1.9315068493150684) internal successors, (141), 130 states have internal predecessors, (141), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:27:39,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2023-02-17 03:27:39,452 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 13 [2023-02-17 03:27:39,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:27:39,452 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2023-02-17 03:27:39,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-17 03:27:39,453 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2023-02-17 03:27:39,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 03:27:39,454 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:27:39,454 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:27:39,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-02-17 03:27:39,454 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-17 03:27:39,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:27:39,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1284022556, now seen corresponding path program 1 times [2023-02-17 03:27:39,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:27:39,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601508125] [2023-02-17 03:27:39,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:27:39,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:27:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:39,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:27:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:39,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 03:27:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:39,641 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-17 03:27:39,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:27:39,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601508125] [2023-02-17 03:27:39,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601508125] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:27:39,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:27:39,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 03:27:39,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751137543] [2023-02-17 03:27:39,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:27:39,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 03:27:39,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:27:39,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 03:27:39,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 03:27:39,646 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 03:27:39,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:27:39,885 INFO L93 Difference]: Finished difference Result 135 states and 148 transitions. [2023-02-17 03:27:39,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 03:27:39,885 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-02-17 03:27:39,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:27:39,907 INFO L225 Difference]: With dead ends: 135 [2023-02-17 03:27:39,907 INFO L226 Difference]: Without dead ends: 135 [2023-02-17 03:27:39,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-17 03:27:39,929 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 13 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 03:27:39,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 488 Invalid, 377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 03:27:39,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-17 03:27:39,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2023-02-17 03:27:39,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 73 states have (on average 1.917808219178082) internal successors, (140), 129 states have internal predecessors, (140), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:27:39,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2023-02-17 03:27:39,946 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 22 [2023-02-17 03:27:39,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:27:39,946 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2023-02-17 03:27:39,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 03:27:39,947 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2023-02-17 03:27:39,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-17 03:27:39,948 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:27:39,948 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:27:39,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-02-17 03:27:39,948 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-17 03:27:39,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:27:39,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1284022557, now seen corresponding path program 1 times [2023-02-17 03:27:39,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:27:39,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757575454] [2023-02-17 03:27:39,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:27:39,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:27:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:40,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:27:40,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:40,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 03:27:40,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 03:27:40,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:27:40,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757575454] [2023-02-17 03:27:40,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757575454] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:27:40,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:27:40,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 03:27:40,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160869109] [2023-02-17 03:27:40,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:27:40,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 03:27:40,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:27:40,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 03:27:40,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 03:27:40,200 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 03:27:40,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:27:40,423 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2023-02-17 03:27:40,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 03:27:40,424 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-02-17 03:27:40,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:27:40,425 INFO L225 Difference]: With dead ends: 134 [2023-02-17 03:27:40,425 INFO L226 Difference]: Without dead ends: 134 [2023-02-17 03:27:40,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-17 03:27:40,426 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 11 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-17 03:27:40,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 512 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-17 03:27:40,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-02-17 03:27:40,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2023-02-17 03:27:40,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 73 states have (on average 1.904109589041096) internal successors, (139), 128 states have internal predecessors, (139), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:27:40,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2023-02-17 03:27:40,431 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 22 [2023-02-17 03:27:40,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:27:40,431 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2023-02-17 03:27:40,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-17 03:27:40,432 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2023-02-17 03:27:40,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 03:27:40,432 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:27:40,432 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:27:40,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-02-17 03:27:40,433 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-17 03:27:40,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:27:40,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1337216453, now seen corresponding path program 1 times [2023-02-17 03:27:40,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:27:40,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83016156] [2023-02-17 03:27:40,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:27:40,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:27:40,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:40,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:27:40,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:40,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 03:27:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:40,664 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-17 03:27:40,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:27:40,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83016156] [2023-02-17 03:27:40,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83016156] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:27:40,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796531837] [2023-02-17 03:27:40,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:27:40,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:27:40,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:27:40,669 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 03:27:40,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-02-17 03:27:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:40,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-17 03:27:40,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:27:40,832 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:27:40,853 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_256))) is different from true [2023-02-17 03:27:40,860 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_256 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_256))) is different from true [2023-02-17 03:27:40,868 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:27:40,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2023-02-17 03:27:40,912 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 6 not checked. [2023-02-17 03:27:40,912 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:27:41,104 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 03:27:41,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796531837] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-17 03:27:41,105 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-02-17 03:27:41,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2023-02-17 03:27:41,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146795103] [2023-02-17 03:27:41,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-02-17 03:27:41,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-17 03:27:41,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:27:41,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-17 03:27:41,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=219, Unknown=2, NotChecked=62, Total=342 [2023-02-17 03:27:41,107 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 03:27:41,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:27:41,491 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2023-02-17 03:27:41,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 03:27:41,492 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 25 [2023-02-17 03:27:41,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:27:41,493 INFO L225 Difference]: With dead ends: 150 [2023-02-17 03:27:41,493 INFO L226 Difference]: Without dead ends: 150 [2023-02-17 03:27:41,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=271, Unknown=2, NotChecked=70, Total=420 [2023-02-17 03:27:41,494 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 242 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 280 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 03:27:41,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 581 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 527 Invalid, 0 Unknown, 280 Unchecked, 0.3s Time] [2023-02-17 03:27:41,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-02-17 03:27:41,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 132. [2023-02-17 03:27:41,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 73 states have (on average 1.8904109589041096) internal successors, (138), 127 states have internal predecessors, (138), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:27:41,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 144 transitions. [2023-02-17 03:27:41,501 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 144 transitions. Word has length 25 [2023-02-17 03:27:41,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:27:41,501 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 144 transitions. [2023-02-17 03:27:41,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 13 states have internal predecessors, (40), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-17 03:27:41,501 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 144 transitions. [2023-02-17 03:27:41,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-17 03:27:41,502 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:27:41,502 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:27:41,516 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-02-17 03:27:41,715 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,SelfDestructingSolverStorable5 [2023-02-17 03:27:41,716 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-17 03:27:41,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:27:41,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1337216454, now seen corresponding path program 1 times [2023-02-17 03:27:41,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:27:41,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633562018] [2023-02-17 03:27:41,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:27:41,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:27:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:41,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:27:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:41,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 03:27:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-17 03:27:42,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:27:42,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633562018] [2023-02-17 03:27:42,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633562018] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:27:42,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1083509740] [2023-02-17 03:27:42,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:27:42,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:27:42,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:27:42,047 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 03:27:42,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-02-17 03:27:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:42,162 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-17 03:27:42,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:27:42,171 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:27:42,310 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:27:42,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2023-02-17 03:27:42,314 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2023-02-17 03:27:42,343 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-17 03:27:42,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:27:42,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1083509740] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:27:42,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:27:42,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2023-02-17 03:27:42,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1969002840] [2023-02-17 03:27:42,402 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 03:27:42,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-17 03:27:42,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:27:42,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-17 03:27:42,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2023-02-17 03:27:42,405 INFO L87 Difference]: Start difference. First operand 132 states and 144 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 03:27:42,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:27:42,936 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2023-02-17 03:27:42,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 03:27:42,936 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2023-02-17 03:27:42,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:27:42,937 INFO L225 Difference]: With dead ends: 133 [2023-02-17 03:27:42,937 INFO L226 Difference]: Without dead ends: 133 [2023-02-17 03:27:42,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2023-02-17 03:27:42,938 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 131 mSDsluCounter, 666 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-17 03:27:42,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 751 Invalid, 948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 940 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-17 03:27:42,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-02-17 03:27:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2023-02-17 03:27:42,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 73 states have (on average 1.8767123287671232) internal successors, (137), 126 states have internal predecessors, (137), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:27:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 143 transitions. [2023-02-17 03:27:42,941 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 143 transitions. Word has length 25 [2023-02-17 03:27:42,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:27:42,941 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 143 transitions. [2023-02-17 03:27:42,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 15 states have internal predecessors, (37), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-17 03:27:42,942 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 143 transitions. [2023-02-17 03:27:42,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-17 03:27:42,942 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:27:42,942 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:27:42,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-02-17 03:27:43,143 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,SelfDestructingSolverStorable6 [2023-02-17 03:27:43,143 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-17 03:27:43,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:27:43,144 INFO L85 PathProgramCache]: Analyzing trace with hash -148939745, now seen corresponding path program 1 times [2023-02-17 03:27:43,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:27:43,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153744766] [2023-02-17 03:27:43,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:27:43,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:27:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:43,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:27:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:43,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 03:27:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:43,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 03:27:43,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:43,552 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-17 03:27:43,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:27:43,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153744766] [2023-02-17 03:27:43,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153744766] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:27:43,553 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496661505] [2023-02-17 03:27:43,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:27:43,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:27:43,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:27:43,554 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 03:27:43,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-02-17 03:27:43,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:43,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 22 conjunts are in the unsatisfiable core [2023-02-17 03:27:43,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:27:43,692 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:27:43,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-17 03:27:43,713 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_521 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_521))) (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|))) is different from true [2023-02-17 03:27:43,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:27:43,749 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:27:43,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-17 03:27:43,764 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_522 Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| v_ArrVal_522))))) is different from true [2023-02-17 03:27:43,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:27:43,793 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:27:43,798 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2023-02-17 03:27:43,803 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:27:43,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2023-02-17 03:27:43,813 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 18 not checked. [2023-02-17 03:27:43,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:27:43,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496661505] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:27:43,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:27:43,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2023-02-17 03:27:43,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112492993] [2023-02-17 03:27:43,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 03:27:43,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 03:27:43,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:27:43,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 03:27:43,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=122, Unknown=3, NotChecked=72, Total=240 [2023-02-17 03:27:43,886 INFO L87 Difference]: Start difference. First operand 131 states and 143 transitions. Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-17 03:27:44,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:27:44,210 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2023-02-17 03:27:44,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 03:27:44,211 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 37 [2023-02-17 03:27:44,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:27:44,212 INFO L225 Difference]: With dead ends: 140 [2023-02-17 03:27:44,212 INFO L226 Difference]: Without dead ends: 140 [2023-02-17 03:27:44,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=163, Unknown=3, NotChecked=84, Total=306 [2023-02-17 03:27:44,212 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 222 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 438 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 03:27:44,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 409 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 457 Invalid, 0 Unknown, 438 Unchecked, 0.3s Time] [2023-02-17 03:27:44,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-02-17 03:27:44,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2023-02-17 03:27:44,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 73 states have (on average 1.7534246575342465) internal successors, (128), 117 states have internal predecessors, (128), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:27:44,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 134 transitions. [2023-02-17 03:27:44,216 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 134 transitions. Word has length 37 [2023-02-17 03:27:44,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:27:44,216 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 134 transitions. [2023-02-17 03:27:44,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 12 states have internal predecessors, (43), 2 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-17 03:27:44,216 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 134 transitions. [2023-02-17 03:27:44,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-17 03:27:44,217 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:27:44,217 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:27:44,225 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-02-17 03:27:44,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:27:44,424 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-17 03:27:44,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:27:44,424 INFO L85 PathProgramCache]: Analyzing trace with hash -148939744, now seen corresponding path program 1 times [2023-02-17 03:27:44,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:27:44,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445496720] [2023-02-17 03:27:44,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:27:44,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:27:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:44,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:27:44,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:44,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 03:27:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:44,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 03:27:44,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:44,837 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-17 03:27:44,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:27:44,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445496720] [2023-02-17 03:27:44,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445496720] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:27:44,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:27:44,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-17 03:27:44,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493951801] [2023-02-17 03:27:44,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:27:44,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-17 03:27:44,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:27:44,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-17 03:27:44,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-17 03:27:44,841 INFO L87 Difference]: Start difference. First operand 122 states and 134 transitions. Second operand has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:27:45,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:27:45,132 INFO L93 Difference]: Finished difference Result 131 states and 144 transitions. [2023-02-17 03:27:45,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-17 03:27:45,133 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 37 [2023-02-17 03:27:45,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:27:45,134 INFO L225 Difference]: With dead ends: 131 [2023-02-17 03:27:45,134 INFO L226 Difference]: Without dead ends: 131 [2023-02-17 03:27:45,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-02-17 03:27:45,135 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 420 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 03:27:45,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 193 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-17 03:27:45,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-17 03:27:45,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 113. [2023-02-17 03:27:45,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 73 states have (on average 1.63013698630137) internal successors, (119), 108 states have internal predecessors, (119), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:27:45,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2023-02-17 03:27:45,138 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 37 [2023-02-17 03:27:45,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:27:45,138 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2023-02-17 03:27:45,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:27:45,138 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2023-02-17 03:27:45,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-17 03:27:45,139 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:27:45,139 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:27:45,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-02-17 03:27:45,139 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-17 03:27:45,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:27:45,140 INFO L85 PathProgramCache]: Analyzing trace with hash -362722266, now seen corresponding path program 1 times [2023-02-17 03:27:45,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:27:45,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671874992] [2023-02-17 03:27:45,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:27:45,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:27:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:45,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:27:45,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:45,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 03:27:45,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:45,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 03:27:45,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:45,570 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-02-17 03:27:45,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:27:45,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671874992] [2023-02-17 03:27:45,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671874992] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:27:45,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344032713] [2023-02-17 03:27:45,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:27:45,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:27:45,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:27:45,573 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 03:27:45,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-02-17 03:27:45,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:45,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-17 03:27:45,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:27:45,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2023-02-17 03:27:45,870 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int) (v_ArrVal_782 (Array Int Int))) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (<= |node_create_~temp~0#1.base| (+ (- 1) |c_#StackHeapBarrier|)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_782)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2023-02-17 03:27:45,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:27:45,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-17 03:27:45,886 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:27:45,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 56 [2023-02-17 03:27:45,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-02-17 03:27:45,905 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-02-17 03:27:45,905 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:27:45,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344032713] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:27:45,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 03:27:45,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 24 [2023-02-17 03:27:45,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985849565] [2023-02-17 03:27:45,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:27:45,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-17 03:27:45,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:27:45,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-17 03:27:45,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=483, Unknown=1, NotChecked=44, Total=600 [2023-02-17 03:27:45,907 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 03:27:46,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:27:46,288 INFO L93 Difference]: Finished difference Result 222 states and 246 transitions. [2023-02-17 03:27:46,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-17 03:27:46,288 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2023-02-17 03:27:46,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:27:46,290 INFO L225 Difference]: With dead ends: 222 [2023-02-17 03:27:46,290 INFO L226 Difference]: Without dead ends: 222 [2023-02-17 03:27:46,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=716, Unknown=1, NotChecked=56, Total=930 [2023-02-17 03:27:46,291 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 774 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 774 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-17 03:27:46,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [774 Valid, 388 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 468 Invalid, 0 Unknown, 128 Unchecked, 0.3s Time] [2023-02-17 03:27:46,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-02-17 03:27:46,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 115. [2023-02-17 03:27:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 75 states have (on average 1.64) internal successors, (123), 110 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:27:46,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2023-02-17 03:27:46,294 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 40 [2023-02-17 03:27:46,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:27:46,294 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2023-02-17 03:27:46,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 03:27:46,295 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2023-02-17 03:27:46,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-17 03:27:46,295 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:27:46,295 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:27:46,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-02-17 03:27:46,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:27:46,496 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-17 03:27:46,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:27:46,496 INFO L85 PathProgramCache]: Analyzing trace with hash -362722265, now seen corresponding path program 1 times [2023-02-17 03:27:46,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:27:46,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361780605] [2023-02-17 03:27:46,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:27:46,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:27:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:46,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:27:46,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:46,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 03:27:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:46,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 03:27:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:47,150 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-17 03:27:47,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:27:47,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361780605] [2023-02-17 03:27:47,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361780605] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:27:47,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862248193] [2023-02-17 03:27:47,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:27:47,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:27:47,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:27:47,152 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 03:27:47,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-02-17 03:27:47,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:47,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 78 conjunts are in the unsatisfiable core [2023-02-17 03:27:47,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:27:47,315 INFO L350 Elim1Store]: Elim1 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 [2023-02-17 03:27:47,348 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_938 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_938))) is different from true [2023-02-17 03:27:47,351 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_938 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_938))) is different from true [2023-02-17 03:27:47,354 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:27:47,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 28 [2023-02-17 03:27:47,463 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:27:47,464 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 59 [2023-02-17 03:27:47,912 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (exists ((v_ArrVal_943 (Array Int Int))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |node_create_~temp~0#1.base| v_ArrVal_943))) (exists ((v_ArrVal_940 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_940) |c_#length|)) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (exists ((v_ArrVal_944 (Array Int Int))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |node_create_~temp~0#1.base| v_ArrVal_944))))) is different from true [2023-02-17 03:27:47,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:27:47,940 INFO L350 Elim1Store]: Elim1 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 22 treesize of output 24 [2023-02-17 03:27:47,947 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:27:47,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 137 treesize of output 139 [2023-02-17 03:27:47,956 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:27:47,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 107 treesize of output 261 [2023-02-17 03:27:47,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:27:47,968 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2023-02-17 03:27:48,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2023-02-17 03:27:48,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2023-02-17 03:27:48,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2023-02-17 03:27:48,143 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 15 not checked. [2023-02-17 03:27:48,144 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-17 03:27:48,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862248193] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:27:48,325 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-17 03:27:48,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 24] total 40 [2023-02-17 03:27:48,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267141902] [2023-02-17 03:27:48,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-17 03:27:48,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-17 03:27:48,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:27:48,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-17 03:27:48,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1598, Unknown=4, NotChecked=246, Total=1980 [2023-02-17 03:27:48,327 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand has 41 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 35 states have internal predecessors, (67), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 03:27:50,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:27:50,354 INFO L93 Difference]: Finished difference Result 240 states and 264 transitions. [2023-02-17 03:27:50,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-17 03:27:50,354 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 35 states have internal predecessors, (67), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2023-02-17 03:27:50,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:27:50,356 INFO L225 Difference]: With dead ends: 240 [2023-02-17 03:27:50,356 INFO L226 Difference]: Without dead ends: 240 [2023-02-17 03:27:50,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 620 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=349, Invalid=2739, Unknown=4, NotChecked=330, Total=3422 [2023-02-17 03:27:50,358 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 1479 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 1652 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1479 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 2400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 726 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-02-17 03:27:50,358 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1479 Valid, 828 Invalid, 2400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1652 Invalid, 0 Unknown, 726 Unchecked, 1.4s Time] [2023-02-17 03:27:50,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2023-02-17 03:27:50,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 115. [2023-02-17 03:27:50,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 75 states have (on average 1.6266666666666667) internal successors, (122), 110 states have internal predecessors, (122), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:27:50,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 128 transitions. [2023-02-17 03:27:50,362 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 128 transitions. Word has length 40 [2023-02-17 03:27:50,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:27:50,362 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 128 transitions. [2023-02-17 03:27:50,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.8108108108108107) internal successors, (67), 35 states have internal predecessors, (67), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-17 03:27:50,363 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 128 transitions. [2023-02-17 03:27:50,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-17 03:27:50,363 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:27:50,363 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:27:50,370 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-02-17 03:27:50,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-02-17 03:27:50,571 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-17 03:27:50,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:27:50,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1640510023, now seen corresponding path program 1 times [2023-02-17 03:27:50,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:27:50,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697122075] [2023-02-17 03:27:50,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:27:50,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:27:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:50,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:27:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:50,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 03:27:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:50,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 03:27:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:50,642 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-17 03:27:50,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:27:50,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697122075] [2023-02-17 03:27:50,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697122075] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:27:50,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:27:50,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:27:50,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788639716] [2023-02-17 03:27:50,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:27:50,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:27:50,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:27:50,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:27:50,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:27:50,646 INFO L87 Difference]: Start difference. First operand 115 states and 128 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-17 03:27:50,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:27:50,725 INFO L93 Difference]: Finished difference Result 177 states and 196 transitions. [2023-02-17 03:27:50,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 03:27:50,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2023-02-17 03:27:50,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:27:50,727 INFO L225 Difference]: With dead ends: 177 [2023-02-17 03:27:50,727 INFO L226 Difference]: Without dead ends: 177 [2023-02-17 03:27:50,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-17 03:27:50,728 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 85 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:27:50,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 273 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:27:50,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-02-17 03:27:50,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 116. [2023-02-17 03:27:50,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 76 states have (on average 1.618421052631579) internal successors, (123), 111 states have internal predecessors, (123), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:27:50,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 129 transitions. [2023-02-17 03:27:50,734 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 129 transitions. Word has length 41 [2023-02-17 03:27:50,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:27:50,735 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 129 transitions. [2023-02-17 03:27:50,735 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-17 03:27:50,736 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 129 transitions. [2023-02-17 03:27:50,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-17 03:27:50,740 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:27:50,740 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:27:50,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-02-17 03:27:50,740 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-17 03:27:50,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:27:50,741 INFO L85 PathProgramCache]: Analyzing trace with hash 277382184, now seen corresponding path program 1 times [2023-02-17 03:27:50,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:27:50,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225655792] [2023-02-17 03:27:50,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:27:50,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:27:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:50,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:27:50,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:50,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 03:27:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:50,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 03:27:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:50,847 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-02-17 03:27:50,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:27:50,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225655792] [2023-02-17 03:27:50,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225655792] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:27:50,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:27:50,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 03:27:50,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721043586] [2023-02-17 03:27:50,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:27:50,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 03:27:50,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:27:50,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 03:27:50,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 03:27:50,850 INFO L87 Difference]: Start difference. First operand 116 states and 129 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-17 03:27:51,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:27:51,008 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2023-02-17 03:27:51,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 03:27:51,009 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2023-02-17 03:27:51,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:27:51,009 INFO L225 Difference]: With dead ends: 131 [2023-02-17 03:27:51,010 INFO L226 Difference]: Without dead ends: 131 [2023-02-17 03:27:51,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-17 03:27:51,010 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 90 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:27:51,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 337 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:27:51,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-17 03:27:51,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 113. [2023-02-17 03:27:51,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 76 states have (on average 1.5789473684210527) internal successors, (120), 108 states have internal predecessors, (120), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:27:51,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 126 transitions. [2023-02-17 03:27:51,014 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 126 transitions. Word has length 43 [2023-02-17 03:27:51,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:27:51,014 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 126 transitions. [2023-02-17 03:27:51,014 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-17 03:27:51,015 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 126 transitions. [2023-02-17 03:27:51,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-17 03:27:51,015 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:27:51,015 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:27:51,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-02-17 03:27:51,016 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-17 03:27:51,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:27:51,016 INFO L85 PathProgramCache]: Analyzing trace with hash 277382185, now seen corresponding path program 1 times [2023-02-17 03:27:51,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:27:51,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902229107] [2023-02-17 03:27:51,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:27:51,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:27:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:51,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:27:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:51,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 03:27:51,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:51,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 03:27:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-17 03:27:51,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:27:51,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902229107] [2023-02-17 03:27:51,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902229107] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:27:51,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [682643070] [2023-02-17 03:27:51,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:27:51,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:27:51,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:27:51,156 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 03:27:51,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-02-17 03:27:51,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:51,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-17 03:27:51,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:27:51,376 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-17 03:27:51,376 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:27:51,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [682643070] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:27:51,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 03:27:51,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2023-02-17 03:27:51,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584957707] [2023-02-17 03:27:51,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:27:51,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-17 03:27:51,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:27:51,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-17 03:27:51,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-17 03:27:51,378 INFO L87 Difference]: Start difference. First operand 113 states and 126 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 03:27:51,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:27:51,391 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2023-02-17 03:27:51,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-17 03:27:51,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2023-02-17 03:27:51,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:27:51,393 INFO L225 Difference]: With dead ends: 112 [2023-02-17 03:27:51,393 INFO L226 Difference]: Without dead ends: 112 [2023-02-17 03:27:51,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-02-17 03:27:51,393 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 104 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:27:51,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 234 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:27:51,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-17 03:27:51,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-02-17 03:27:51,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 75 states have (on average 1.5733333333333333) internal successors, (118), 107 states have internal predecessors, (118), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:27:51,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2023-02-17 03:27:51,400 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 43 [2023-02-17 03:27:51,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:27:51,400 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2023-02-17 03:27:51,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 03:27:51,400 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2023-02-17 03:27:51,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-17 03:27:51,401 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:27:51,401 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:27:51,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-02-17 03:27:51,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:27:51,608 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-17 03:27:51,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:27:51,609 INFO L85 PathProgramCache]: Analyzing trace with hash 278707084, now seen corresponding path program 1 times [2023-02-17 03:27:51,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:27:51,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839947371] [2023-02-17 03:27:51,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:27:51,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:27:51,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:51,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:27:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:51,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 03:27:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:51,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 03:27:51,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:51,819 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-17 03:27:51,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:27:51,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839947371] [2023-02-17 03:27:51,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1839947371] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:27:51,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767229016] [2023-02-17 03:27:51,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:27:51,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:27:51,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:27:51,824 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 03:27:51,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-02-17 03:27:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:52,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-17 03:27:52,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:27:52,041 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-17 03:27:52,041 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-17 03:27:52,041 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767229016] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:27:52,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-17 03:27:52,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2023-02-17 03:27:52,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413754295] [2023-02-17 03:27:52,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:27:52,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:27:52,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:27:52,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:27:52,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-17 03:27:52,043 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 03:27:52,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:27:52,061 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2023-02-17 03:27:52,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-17 03:27:52,062 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 43 [2023-02-17 03:27:52,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:27:52,062 INFO L225 Difference]: With dead ends: 109 [2023-02-17 03:27:52,063 INFO L226 Difference]: Without dead ends: 109 [2023-02-17 03:27:52,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-02-17 03:27:52,063 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 187 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-17 03:27:52,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 169 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-17 03:27:52,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-02-17 03:27:52,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-02-17 03:27:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 74 states have (on average 1.5405405405405406) internal successors, (114), 104 states have internal predecessors, (114), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:27:52,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2023-02-17 03:27:52,067 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 43 [2023-02-17 03:27:52,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:27:52,067 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2023-02-17 03:27:52,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-17 03:27:52,068 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2023-02-17 03:27:52,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-17 03:27:52,068 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:27:52,068 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:27:52,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-02-17 03:27:52,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:27:52,276 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-17 03:27:52,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:27:52,276 INFO L85 PathProgramCache]: Analyzing trace with hash 49983393, now seen corresponding path program 1 times [2023-02-17 03:27:52,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:27:52,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531301366] [2023-02-17 03:27:52,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:27:52,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:27:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:52,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:27:52,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:52,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 03:27:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:52,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 03:27:52,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:52,354 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-17 03:27:52,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:27:52,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531301366] [2023-02-17 03:27:52,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531301366] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:27:52,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:27:52,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:27:52,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681969279] [2023-02-17 03:27:52,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:27:52,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:27:52,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:27:52,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:27:52,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:27:52,357 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-17 03:27:52,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:27:52,468 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2023-02-17 03:27:52,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 03:27:52,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2023-02-17 03:27:52,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:27:52,469 INFO L225 Difference]: With dead ends: 126 [2023-02-17 03:27:52,469 INFO L226 Difference]: Without dead ends: 126 [2023-02-17 03:27:52,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 03:27:52,470 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 84 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:27:52,470 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 225 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:27:52,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-02-17 03:27:52,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 108. [2023-02-17 03:27:52,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 74 states have (on average 1.527027027027027) internal successors, (113), 103 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:27:52,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2023-02-17 03:27:52,473 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 44 [2023-02-17 03:27:52,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:27:52,473 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2023-02-17 03:27:52,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-17 03:27:52,474 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2023-02-17 03:27:52,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-17 03:27:52,474 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:27:52,474 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:27:52,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-02-17 03:27:52,474 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-17 03:27:52,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:27:52,475 INFO L85 PathProgramCache]: Analyzing trace with hash 49983394, now seen corresponding path program 1 times [2023-02-17 03:27:52,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:27:52,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506090421] [2023-02-17 03:27:52,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:27:52,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:27:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:52,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:27:52,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:52,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 03:27:52,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:52,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 03:27:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:52,579 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-02-17 03:27:52,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:27:52,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506090421] [2023-02-17 03:27:52,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506090421] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:27:52,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:27:52,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-17 03:27:52,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425985033] [2023-02-17 03:27:52,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:27:52,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-17 03:27:52,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:27:52,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-17 03:27:52,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-17 03:27:52,581 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-17 03:27:52,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:27:52,695 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2023-02-17 03:27:52,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-17 03:27:52,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 44 [2023-02-17 03:27:52,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:27:52,696 INFO L225 Difference]: With dead ends: 107 [2023-02-17 03:27:52,696 INFO L226 Difference]: Without dead ends: 107 [2023-02-17 03:27:52,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-17 03:27:52,697 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 87 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:27:52,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 218 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:27:52,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-02-17 03:27:52,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-02-17 03:27:52,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 74 states have (on average 1.5135135135135136) internal successors, (112), 102 states have internal predecessors, (112), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:27:52,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2023-02-17 03:27:52,699 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 44 [2023-02-17 03:27:52,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:27:52,700 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2023-02-17 03:27:52,700 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-17 03:27:52,700 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2023-02-17 03:27:52,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-17 03:27:52,700 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:27:52,700 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:27:52,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-02-17 03:27:52,701 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-17 03:27:52,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:27:52,701 INFO L85 PathProgramCache]: Analyzing trace with hash 1549485211, now seen corresponding path program 1 times [2023-02-17 03:27:52,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:27:52,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915283230] [2023-02-17 03:27:52,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:27:52,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:27:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:52,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:27:52,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:52,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 03:27:52,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:52,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 03:27:52,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:52,892 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-02-17 03:27:52,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:27:52,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915283230] [2023-02-17 03:27:52,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915283230] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-17 03:27:52,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-17 03:27:52,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-17 03:27:52,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789172924] [2023-02-17 03:27:52,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-17 03:27:52,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-17 03:27:52,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-02-17 03:27:52,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-17 03:27:52,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-17 03:27:52,894 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-17 03:27:53,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-17 03:27:53,040 INFO L93 Difference]: Finished difference Result 104 states and 115 transitions. [2023-02-17 03:27:53,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-17 03:27:53,040 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 45 [2023-02-17 03:27:53,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-17 03:27:53,041 INFO L225 Difference]: With dead ends: 104 [2023-02-17 03:27:53,041 INFO L226 Difference]: Without dead ends: 104 [2023-02-17 03:27:53,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-17 03:27:53,042 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 84 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-17 03:27:53,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 340 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-17 03:27:53,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-02-17 03:27:53,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-02-17 03:27:53,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 74 states have (on average 1.472972972972973) internal successors, (109), 99 states have internal predecessors, (109), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-17 03:27:53,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2023-02-17 03:27:53,044 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 45 [2023-02-17 03:27:53,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-17 03:27:53,045 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2023-02-17 03:27:53,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.5) internal successors, (33), 5 states have internal predecessors, (33), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-17 03:27:53,045 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2023-02-17 03:27:53,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-17 03:27:53,045 INFO L187 NwaCegarLoop]: Found error trace [2023-02-17 03:27:53,045 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-17 03:27:53,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-02-17 03:27:53,046 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-02-17 03:27:53,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-17 03:27:53,046 INFO L85 PathProgramCache]: Analyzing trace with hash 2108722015, now seen corresponding path program 1 times [2023-02-17 03:27:53,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-02-17 03:27:53,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109529332] [2023-02-17 03:27:53,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:27:53,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-02-17 03:27:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:53,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-02-17 03:27:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:53,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-02-17 03:27:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:53,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-02-17 03:27:53,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:53,651 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-02-17 03:27:53,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-02-17 03:27:53,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109529332] [2023-02-17 03:27:53,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109529332] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-17 03:27:53,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813852542] [2023-02-17 03:27:53,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-17 03:27:53,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-17 03:27:53,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-17 03:27:53,653 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-17 03:27:53,656 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-02-17 03:27:53,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-17 03:27:53,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 70 conjunts are in the unsatisfiable core [2023-02-17 03:27:53,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-17 03:27:54,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-17 03:27:54,089 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:27:54,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 40 [2023-02-17 03:27:54,093 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2023-02-17 03:27:54,211 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:27:54,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 69 [2023-02-17 03:27:54,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2023-02-17 03:27:54,229 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 03:27:54,230 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 03:27:54,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-02-17 03:27:54,236 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 03:27:54,243 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 03:27:54,244 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 03:27:54,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-17 03:27:54,351 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:27:54,352 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 75 treesize of output 116 [2023-02-17 03:27:54,367 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 03:27:54,370 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 03:27:54,380 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 03:27:54,385 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 03:27:54,390 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 03:27:54,394 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-17 03:27:55,542 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-17 03:27:55,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 19 select indices, 19 select index equivalence classes, 0 disjoint index pairs (out of 171 index pairs), introduced 28 new quantified variables, introduced 189 case distinctions, treesize of input 910 treesize of output 2274