./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02c908c5-53ef-4206-9ad9-cd8263265cfc/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02c908c5-53ef-4206-9ad9-cd8263265cfc/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02c908c5-53ef-4206-9ad9-cd8263265cfc/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02c908c5-53ef-4206-9ad9-cd8263265cfc/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02c908c5-53ef-4206-9ad9-cd8263265cfc/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02c908c5-53ef-4206-9ad9-cd8263265cfc/bin/uautomizer-uyxdKDjOR8 --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 e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 16:13:33,403 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 16:13:33,404 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 16:13:33,422 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 16:13:33,422 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 16:13:33,423 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 16:13:33,425 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 16:13:33,426 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 16:13:33,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 16:13:33,428 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 16:13:33,429 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 16:13:33,430 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 16:13:33,430 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 16:13:33,431 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 16:13:33,432 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 16:13:33,433 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 16:13:33,434 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 16:13:33,435 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 16:13:33,436 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 16:13:33,438 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 16:13:33,439 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 16:13:33,440 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 16:13:33,441 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 16:13:33,442 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 16:13:33,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 16:13:33,445 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 16:13:33,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 16:13:33,446 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 16:13:33,447 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 16:13:33,448 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 16:13:33,448 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 16:13:33,449 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 16:13:33,449 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 16:13:33,450 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 16:13:33,451 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 16:13:33,451 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 16:13:33,451 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 16:13:33,452 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 16:13:33,452 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 16:13:33,453 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 16:13:33,453 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 16:13:33,454 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02c908c5-53ef-4206-9ad9-cd8263265cfc/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 16:13:33,473 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 16:13:33,473 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 16:13:33,474 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 16:13:33,474 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 16:13:33,475 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 16:13:33,475 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 16:13:33,475 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 16:13:33,476 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 16:13:33,476 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 16:13:33,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 16:13:33,476 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 16:13:33,476 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 16:13:33,476 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 16:13:33,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 16:13:33,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 16:13:33,477 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 16:13:33,477 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 16:13:33,477 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 16:13:33,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 16:13:33,477 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 16:13:33,478 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 16:13:33,478 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 16:13:33,478 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 16:13:33,478 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 16:13:33,478 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 16:13:33,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:13:33,479 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 16:13:33,479 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 16:13:33,479 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 16:13:33,479 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 16:13:33,479 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 16:13:33,479 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 16:13:33,479 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 16:13:33,480 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 16:13:33,480 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02c908c5-53ef-4206-9ad9-cd8263265cfc/bin/uautomizer-uyxdKDjOR8/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02c908c5-53ef-4206-9ad9-cd8263265cfc/bin/uautomizer-uyxdKDjOR8 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 -> e174a1790a7df4dcba920aa7097618d66c8703aa13de1aa6af1a2c5f7cb0971c [2022-12-13 16:13:33,677 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 16:13:33,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 16:13:33,698 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 16:13:33,699 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 16:13:33,699 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 16:13:33,701 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02c908c5-53ef-4206-9ad9-cd8263265cfc/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2022-12-13 16:13:36,164 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 16:13:36,315 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 16:13:36,316 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02c908c5-53ef-4206-9ad9-cd8263265cfc/sv-benchmarks/c/memsafety-ext/tree_of_cslls.i [2022-12-13 16:13:36,323 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02c908c5-53ef-4206-9ad9-cd8263265cfc/bin/uautomizer-uyxdKDjOR8/data/09b76df92/907dad58ebe94a41a378c20dcdcebc36/FLAGec0b82252 [2022-12-13 16:13:36,334 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02c908c5-53ef-4206-9ad9-cd8263265cfc/bin/uautomizer-uyxdKDjOR8/data/09b76df92/907dad58ebe94a41a378c20dcdcebc36 [2022-12-13 16:13:36,336 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 16:13:36,337 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 16:13:36,338 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 16:13:36,338 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 16:13:36,341 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 16:13:36,342 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:13:36" (1/1) ... [2022-12-13 16:13:36,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21b09f81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:13:36, skipping insertion in model container [2022-12-13 16:13:36,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 04:13:36" (1/1) ... [2022-12-13 16:13:36,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 16:13:36,372 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 16:13:36,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:13:36,570 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 16:13:36,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 16:13:36,618 INFO L208 MainTranslator]: Completed translation [2022-12-13 16:13:36,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:13:36 WrapperNode [2022-12-13 16:13:36,618 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 16:13:36,619 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 16:13:36,619 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 16:13:36,619 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 16:13:36,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:13:36" (1/1) ... [2022-12-13 16:13:36,635 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:13:36" (1/1) ... [2022-12-13 16:13:36,653 INFO L138 Inliner]: procedures = 123, calls = 63, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 216 [2022-12-13 16:13:36,653 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 16:13:36,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 16:13:36,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 16:13:36,654 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 16:13:36,660 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:13:36" (1/1) ... [2022-12-13 16:13:36,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:13:36" (1/1) ... [2022-12-13 16:13:36,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:13:36" (1/1) ... [2022-12-13 16:13:36,663 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:13:36" (1/1) ... [2022-12-13 16:13:36,670 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:13:36" (1/1) ... [2022-12-13 16:13:36,673 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:13:36" (1/1) ... [2022-12-13 16:13:36,674 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:13:36" (1/1) ... [2022-12-13 16:13:36,675 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:13:36" (1/1) ... [2022-12-13 16:13:36,677 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 16:13:36,678 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 16:13:36,678 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 16:13:36,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 16:13:36,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:13:36" (1/1) ... [2022-12-13 16:13:36,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 16:13:36,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02c908c5-53ef-4206-9ad9-cd8263265cfc/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:13:36,706 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02c908c5-53ef-4206-9ad9-cd8263265cfc/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 16:13:36,708 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02c908c5-53ef-4206-9ad9-cd8263265cfc/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 16:13:36,743 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-13 16:13:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 16:13:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-12-13 16:13:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-12-13 16:13:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 16:13:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 16:13:36,744 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 16:13:36,745 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 16:13:36,840 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 16:13:36,842 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 16:13:37,281 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 16:13:37,289 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 16:13:37,289 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2022-12-13 16:13:37,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:13:37 BoogieIcfgContainer [2022-12-13 16:13:37,292 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 16:13:37,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 16:13:37,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 16:13:37,298 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 16:13:37,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 04:13:36" (1/3) ... [2022-12-13 16:13:37,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e469b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:13:37, skipping insertion in model container [2022-12-13 16:13:37,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 04:13:36" (2/3) ... [2022-12-13 16:13:37,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e469b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 04:13:37, skipping insertion in model container [2022-12-13 16:13:37,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 04:13:37" (3/3) ... [2022-12-13 16:13:37,301 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_of_cslls.i [2022-12-13 16:13:37,320 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 16:13:37,320 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 104 error locations. [2022-12-13 16:13:37,359 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 16:13:37,364 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;@67f942c6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 16:13:37,365 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2022-12-13 16:13:37,369 INFO L276 IsEmpty]: Start isEmpty. Operand has 210 states, 105 states have (on average 2.219047619047619) internal successors, (233), 209 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:37,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-13 16:13:37,373 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:13:37,374 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-13 16:13:37,374 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 16:13:37,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:13:37,378 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-12-13 16:13:37,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:13:37,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827721556] [2022-12-13 16:13:37,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:13:37,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:13:37,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:13:37,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:13:37,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:13:37,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827721556] [2022-12-13 16:13:37,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827721556] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:13:37,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:13:37,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:13:37,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975715676] [2022-12-13 16:13:37,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:13:37,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:13:37,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:13:37,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:13:37,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:13:37,587 INFO L87 Difference]: Start difference. First operand has 210 states, 105 states have (on average 2.219047619047619) internal successors, (233), 209 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:37,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:13:37,798 INFO L93 Difference]: Finished difference Result 282 states and 304 transitions. [2022-12-13 16:13:37,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:13:37,800 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-13 16:13:37,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:13:37,807 INFO L225 Difference]: With dead ends: 282 [2022-12-13 16:13:37,807 INFO L226 Difference]: Without dead ends: 278 [2022-12-13 16:13:37,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:13:37,811 INFO L413 NwaCegarLoop]: 151 mSDtfsCounter, 200 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:13:37,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 199 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:13:37,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2022-12-13 16:13:37,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 199. [2022-12-13 16:13:37,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 104 states have (on average 2.0673076923076925) internal successors, (215), 198 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:37,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 215 transitions. [2022-12-13 16:13:37,841 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 215 transitions. Word has length 3 [2022-12-13 16:13:37,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:13:37,842 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 215 transitions. [2022-12-13 16:13:37,842 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:37,842 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 215 transitions. [2022-12-13 16:13:37,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-13 16:13:37,842 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:13:37,842 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-13 16:13:37,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 16:13:37,843 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 16:13:37,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:13:37,843 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-12-13 16:13:37,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:13:37,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389827344] [2022-12-13 16:13:37,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:13:37,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:13:37,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:13:37,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:13:37,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:13:37,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389827344] [2022-12-13 16:13:37,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389827344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:13:37,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:13:37,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:13:37,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174785091] [2022-12-13 16:13:37,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:13:37,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:13:37,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:13:37,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:13:37,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:13:37,899 INFO L87 Difference]: Start difference. First operand 199 states and 215 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:38,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:13:38,021 INFO L93 Difference]: Finished difference Result 197 states and 213 transitions. [2022-12-13 16:13:38,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:13:38,021 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-13 16:13:38,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:13:38,023 INFO L225 Difference]: With dead ends: 197 [2022-12-13 16:13:38,023 INFO L226 Difference]: Without dead ends: 197 [2022-12-13 16:13:38,023 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:13:38,024 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 2 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:13:38,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 319 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:13:38,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-12-13 16:13:38,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2022-12-13 16:13:38,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 104 states have (on average 2.048076923076923) internal successors, (213), 196 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:38,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 213 transitions. [2022-12-13 16:13:38,035 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 213 transitions. Word has length 3 [2022-12-13 16:13:38,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:13:38,036 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 213 transitions. [2022-12-13 16:13:38,036 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:38,036 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 213 transitions. [2022-12-13 16:13:38,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-13 16:13:38,036 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:13:38,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-13 16:13:38,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 16:13:38,037 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 16:13:38,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:13:38,038 INFO L85 PathProgramCache]: Analyzing trace with hash 889446153, now seen corresponding path program 1 times [2022-12-13 16:13:38,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:13:38,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528661619] [2022-12-13 16:13:38,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:13:38,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:13:38,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:13:38,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:13:38,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:13:38,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528661619] [2022-12-13 16:13:38,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528661619] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:13:38,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:13:38,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:13:38,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175127829] [2022-12-13 16:13:38,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:13:38,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:13:38,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:13:38,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:13:38,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:13:38,185 INFO L87 Difference]: Start difference. First operand 197 states and 213 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:38,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:13:38,474 INFO L93 Difference]: Finished difference Result 354 states and 382 transitions. [2022-12-13 16:13:38,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 16:13:38,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-13 16:13:38,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:13:38,476 INFO L225 Difference]: With dead ends: 354 [2022-12-13 16:13:38,476 INFO L226 Difference]: Without dead ends: 354 [2022-12-13 16:13:38,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:13:38,477 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 279 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:13:38,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 232 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 16:13:38,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2022-12-13 16:13:38,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 190. [2022-12-13 16:13:38,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 104 states have (on average 1.9807692307692308) internal successors, (206), 189 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:38,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 206 transitions. [2022-12-13 16:13:38,485 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 206 transitions. Word has length 6 [2022-12-13 16:13:38,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:13:38,485 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 206 transitions. [2022-12-13 16:13:38,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:38,486 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 206 transitions. [2022-12-13 16:13:38,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-13 16:13:38,486 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:13:38,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:13:38,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 16:13:38,486 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 16:13:38,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:13:38,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924364, now seen corresponding path program 1 times [2022-12-13 16:13:38,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:13:38,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699358895] [2022-12-13 16:13:38,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:13:38,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:13:38,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:13:38,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:13:38,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:13:38,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699358895] [2022-12-13 16:13:38,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699358895] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:13:38,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:13:38,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:13:38,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639095764] [2022-12-13 16:13:38,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:13:38,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:13:38,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:13:38,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:13:38,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:13:38,587 INFO L87 Difference]: Start difference. First operand 190 states and 206 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:38,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:13:38,753 INFO L93 Difference]: Finished difference Result 189 states and 205 transitions. [2022-12-13 16:13:38,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:13:38,754 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-13 16:13:38,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:13:38,755 INFO L225 Difference]: With dead ends: 189 [2022-12-13 16:13:38,755 INFO L226 Difference]: Without dead ends: 189 [2022-12-13 16:13:38,756 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:13:38,756 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 6 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:13:38,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 508 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:13:38,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-12-13 16:13:38,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-12-13 16:13:38,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 104 states have (on average 1.9711538461538463) internal successors, (205), 188 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:38,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 205 transitions. [2022-12-13 16:13:38,762 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 205 transitions. Word has length 10 [2022-12-13 16:13:38,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:13:38,762 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 205 transitions. [2022-12-13 16:13:38,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:38,762 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 205 transitions. [2022-12-13 16:13:38,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-13 16:13:38,763 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:13:38,763 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:13:38,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 16:13:38,763 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 16:13:38,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:13:38,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1113924365, now seen corresponding path program 1 times [2022-12-13 16:13:38,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:13:38,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130400698] [2022-12-13 16:13:38,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:13:38,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:13:38,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:13:38,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:13:38,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:13:38,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130400698] [2022-12-13 16:13:38,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2130400698] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:13:38,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:13:38,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:13:38,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493750657] [2022-12-13 16:13:38,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:13:38,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:13:38,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:13:38,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:13:38,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:13:38,878 INFO L87 Difference]: Start difference. First operand 189 states and 205 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:39,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:13:39,073 INFO L93 Difference]: Finished difference Result 188 states and 204 transitions. [2022-12-13 16:13:39,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 16:13:39,073 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-13 16:13:39,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:13:39,074 INFO L225 Difference]: With dead ends: 188 [2022-12-13 16:13:39,074 INFO L226 Difference]: Without dead ends: 188 [2022-12-13 16:13:39,074 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:13:39,075 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 4 mSDsluCounter, 329 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:13:39,075 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 529 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:13:39,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-12-13 16:13:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2022-12-13 16:13:39,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 104 states have (on average 1.9615384615384615) internal successors, (204), 187 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 204 transitions. [2022-12-13 16:13:39,079 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 204 transitions. Word has length 10 [2022-12-13 16:13:39,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:13:39,079 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 204 transitions. [2022-12-13 16:13:39,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:39,080 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 204 transitions. [2022-12-13 16:13:39,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 16:13:39,080 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:13:39,080 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:13:39,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 16:13:39,080 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 16:13:39,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:13:39,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1114596085, now seen corresponding path program 1 times [2022-12-13 16:13:39,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:13:39,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097455468] [2022-12-13 16:13:39,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:13:39,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:13:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:13:39,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:13:39,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:13:39,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097455468] [2022-12-13 16:13:39,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097455468] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:13:39,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:13:39,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:13:39,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228646879] [2022-12-13 16:13:39,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:13:39,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:13:39,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:13:39,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:13:39,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:13:39,287 INFO L87 Difference]: Start difference. First operand 188 states and 204 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:39,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:13:39,711 INFO L93 Difference]: Finished difference Result 353 states and 389 transitions. [2022-12-13 16:13:39,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:13:39,711 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-13 16:13:39,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:13:39,713 INFO L225 Difference]: With dead ends: 353 [2022-12-13 16:13:39,713 INFO L226 Difference]: Without dead ends: 353 [2022-12-13 16:13:39,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-12-13 16:13:39,715 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 474 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 639 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:13:39,715 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 675 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 639 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 16:13:39,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2022-12-13 16:13:39,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 192. [2022-12-13 16:13:39,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 108 states have (on average 1.9444444444444444) internal successors, (210), 191 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:39,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 210 transitions. [2022-12-13 16:13:39,719 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 210 transitions. Word has length 15 [2022-12-13 16:13:39,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:13:39,720 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 210 transitions. [2022-12-13 16:13:39,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:39,720 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 210 transitions. [2022-12-13 16:13:39,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 16:13:39,720 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:13:39,720 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:13:39,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 16:13:39,721 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 16:13:39,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:13:39,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1114596086, now seen corresponding path program 1 times [2022-12-13 16:13:39,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:13:39,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692720154] [2022-12-13 16:13:39,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:13:39,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:13:39,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:13:39,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:13:39,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:13:39,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692720154] [2022-12-13 16:13:39,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692720154] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:13:39,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:13:39,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:13:39,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896554254] [2022-12-13 16:13:39,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:13:39,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:13:39,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:13:39,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:13:39,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:13:39,953 INFO L87 Difference]: Start difference. First operand 192 states and 210 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:40,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:13:40,474 INFO L93 Difference]: Finished difference Result 347 states and 383 transitions. [2022-12-13 16:13:40,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 16:13:40,475 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-13 16:13:40,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:13:40,476 INFO L225 Difference]: With dead ends: 347 [2022-12-13 16:13:40,476 INFO L226 Difference]: Without dead ends: 347 [2022-12-13 16:13:40,476 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-12-13 16:13:40,476 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 454 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:13:40,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 490 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 16:13:40,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-12-13 16:13:40,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 192. [2022-12-13 16:13:40,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 108 states have (on average 1.9351851851851851) internal successors, (209), 191 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:40,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 209 transitions. [2022-12-13 16:13:40,480 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 209 transitions. Word has length 15 [2022-12-13 16:13:40,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:13:40,480 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 209 transitions. [2022-12-13 16:13:40,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:40,481 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 209 transitions. [2022-12-13 16:13:40,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 16:13:40,481 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:13:40,481 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:13:40,481 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 16:13:40,481 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 16:13:40,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:13:40,482 INFO L85 PathProgramCache]: Analyzing trace with hash 192740277, now seen corresponding path program 1 times [2022-12-13 16:13:40,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:13:40,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578370234] [2022-12-13 16:13:40,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:13:40,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:13:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:13:40,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:13:40,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:13:40,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578370234] [2022-12-13 16:13:40,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578370234] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:13:40,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:13:40,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:13:40,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360822196] [2022-12-13 16:13:40,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:13:40,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:13:40,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:13:40,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:13:40,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:13:40,518 INFO L87 Difference]: Start difference. First operand 192 states and 209 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:40,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:13:40,677 INFO L93 Difference]: Finished difference Result 316 states and 348 transitions. [2022-12-13 16:13:40,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:13:40,678 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-13 16:13:40,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:13:40,680 INFO L225 Difference]: With dead ends: 316 [2022-12-13 16:13:40,680 INFO L226 Difference]: Without dead ends: 316 [2022-12-13 16:13:40,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:13:40,681 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 168 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:13:40,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 348 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:13:40,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2022-12-13 16:13:40,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 189. [2022-12-13 16:13:40,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 108 states have (on average 1.9074074074074074) internal successors, (206), 188 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:40,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 206 transitions. [2022-12-13 16:13:40,685 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 206 transitions. Word has length 16 [2022-12-13 16:13:40,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:13:40,686 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 206 transitions. [2022-12-13 16:13:40,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:40,686 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 206 transitions. [2022-12-13 16:13:40,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 16:13:40,686 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:13:40,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:13:40,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 16:13:40,687 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 16:13:40,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:13:40,687 INFO L85 PathProgramCache]: Analyzing trace with hash 192740278, now seen corresponding path program 1 times [2022-12-13 16:13:40,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:13:40,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038786298] [2022-12-13 16:13:40,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:13:40,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:13:40,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:13:40,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:13:40,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:13:40,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038786298] [2022-12-13 16:13:40,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038786298] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:13:40,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:13:40,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 16:13:40,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444068426] [2022-12-13 16:13:40,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:13:40,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:13:40,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:13:40,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:13:40,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:13:40,737 INFO L87 Difference]: Start difference. First operand 189 states and 206 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:40,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:13:40,880 INFO L93 Difference]: Finished difference Result 293 states and 325 transitions. [2022-12-13 16:13:40,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:13:40,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-12-13 16:13:40,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:13:40,882 INFO L225 Difference]: With dead ends: 293 [2022-12-13 16:13:40,882 INFO L226 Difference]: Without dead ends: 293 [2022-12-13 16:13:40,883 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:13:40,883 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 139 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 16:13:40,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 359 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 16:13:40,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2022-12-13 16:13:40,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 187. [2022-12-13 16:13:40,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 108 states have (on average 1.8888888888888888) internal successors, (204), 186 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:40,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 204 transitions. [2022-12-13 16:13:40,888 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 204 transitions. Word has length 16 [2022-12-13 16:13:40,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:13:40,889 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 204 transitions. [2022-12-13 16:13:40,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:40,889 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 204 transitions. [2022-12-13 16:13:40,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-13 16:13:40,889 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:13:40,889 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:13:40,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 16:13:40,890 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 16:13:40,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:13:40,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1678809590, now seen corresponding path program 1 times [2022-12-13 16:13:40,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:13:40,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360372591] [2022-12-13 16:13:40,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:13:40,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:13:40,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:13:40,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:13:40,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:13:40,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360372591] [2022-12-13 16:13:40,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360372591] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:13:40,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:13:40,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:13:40,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855106554] [2022-12-13 16:13:40,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:13:40,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 16:13:40,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:13:40,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 16:13:40,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 16:13:40,923 INFO L87 Difference]: Start difference. First operand 187 states and 204 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:41,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:13:41,119 INFO L93 Difference]: Finished difference Result 254 states and 278 transitions. [2022-12-13 16:13:41,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 16:13:41,119 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-13 16:13:41,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:13:41,121 INFO L225 Difference]: With dead ends: 254 [2022-12-13 16:13:41,121 INFO L226 Difference]: Without dead ends: 254 [2022-12-13 16:13:41,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:13:41,122 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 327 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 16:13:41,122 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 153 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 16:13:41,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-12-13 16:13:41,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 176. [2022-12-13 16:13:41,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 112 states have (on average 1.7589285714285714) internal successors, (197), 175 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:41,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 197 transitions. [2022-12-13 16:13:41,125 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 197 transitions. Word has length 17 [2022-12-13 16:13:41,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:13:41,125 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 197 transitions. [2022-12-13 16:13:41,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:41,126 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 197 transitions. [2022-12-13 16:13:41,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-13 16:13:41,126 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:13:41,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:13:41,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 16:13:41,126 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 16:13:41,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:13:41,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1678809591, now seen corresponding path program 1 times [2022-12-13 16:13:41,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:13:41,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302552198] [2022-12-13 16:13:41,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:13:41,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:13:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:13:41,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:13:41,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:13:41,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302552198] [2022-12-13 16:13:41,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302552198] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:13:41,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:13:41,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 16:13:41,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685818723] [2022-12-13 16:13:41,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:13:41,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 16:13:41,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:13:41,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 16:13:41,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 16:13:41,193 INFO L87 Difference]: Start difference. First operand 176 states and 197 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:41,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:13:41,506 INFO L93 Difference]: Finished difference Result 438 states and 492 transitions. [2022-12-13 16:13:41,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 16:13:41,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-13 16:13:41,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:13:41,508 INFO L225 Difference]: With dead ends: 438 [2022-12-13 16:13:41,508 INFO L226 Difference]: Without dead ends: 438 [2022-12-13 16:13:41,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-12-13 16:13:41,508 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 710 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 710 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-13 16:13:41,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [710 Valid, 293 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-13 16:13:41,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-12-13 16:13:41,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 318. [2022-12-13 16:13:41,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 254 states have (on average 1.7598425196850394) internal successors, (447), 317 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:41,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 447 transitions. [2022-12-13 16:13:41,514 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 447 transitions. Word has length 17 [2022-12-13 16:13:41,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:13:41,514 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 447 transitions. [2022-12-13 16:13:41,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:41,514 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 447 transitions. [2022-12-13 16:13:41,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 16:13:41,515 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:13:41,515 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:13:41,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 16:13:41,515 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 16:13:41,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:13:41,515 INFO L85 PathProgramCache]: Analyzing trace with hash -445669701, now seen corresponding path program 1 times [2022-12-13 16:13:41,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:13:41,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559568655] [2022-12-13 16:13:41,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:13:41,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:13:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:13:41,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:13:41,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:13:41,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559568655] [2022-12-13 16:13:41,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559568655] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:13:41,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:13:41,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 16:13:41,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880227279] [2022-12-13 16:13:41,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:13:41,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 16:13:41,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:13:41,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 16:13:41,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 16:13:41,606 INFO L87 Difference]: Start difference. First operand 318 states and 447 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:42,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:13:42,077 INFO L93 Difference]: Finished difference Result 784 states and 1126 transitions. [2022-12-13 16:13:42,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 16:13:42,078 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-13 16:13:42,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:13:42,080 INFO L225 Difference]: With dead ends: 784 [2022-12-13 16:13:42,080 INFO L226 Difference]: Without dead ends: 784 [2022-12-13 16:13:42,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-12-13 16:13:42,080 INFO L413 NwaCegarLoop]: 224 mSDtfsCounter, 370 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 894 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:13:42,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 1218 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 894 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 16:13:42,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2022-12-13 16:13:42,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 317. [2022-12-13 16:13:42,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 254 states have (on average 1.7559055118110236) internal successors, (446), 316 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:42,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 446 transitions. [2022-12-13 16:13:42,090 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 446 transitions. Word has length 19 [2022-12-13 16:13:42,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:13:42,090 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 446 transitions. [2022-12-13 16:13:42,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:42,090 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 446 transitions. [2022-12-13 16:13:42,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 16:13:42,090 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:13:42,091 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:13:42,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 16:13:42,091 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 16:13:42,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:13:42,091 INFO L85 PathProgramCache]: Analyzing trace with hash -445669700, now seen corresponding path program 1 times [2022-12-13 16:13:42,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:13:42,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324488274] [2022-12-13 16:13:42,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:13:42,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:13:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:13:42,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:13:42,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:13:42,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324488274] [2022-12-13 16:13:42,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324488274] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:13:42,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:13:42,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 16:13:42,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655612245] [2022-12-13 16:13:42,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:13:42,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 16:13:42,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:13:42,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 16:13:42,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-12-13 16:13:42,354 INFO L87 Difference]: Start difference. First operand 317 states and 446 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:42,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:13:42,884 INFO L93 Difference]: Finished difference Result 603 states and 842 transitions. [2022-12-13 16:13:42,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-12-13 16:13:42,885 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-13 16:13:42,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:13:42,886 INFO L225 Difference]: With dead ends: 603 [2022-12-13 16:13:42,887 INFO L226 Difference]: Without dead ends: 603 [2022-12-13 16:13:42,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2022-12-13 16:13:42,887 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 391 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-13 16:13:42,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 926 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-13 16:13:42,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-12-13 16:13:42,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 321. [2022-12-13 16:13:42,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 258 states have (on average 1.744186046511628) internal successors, (450), 320 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:42,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 450 transitions. [2022-12-13 16:13:42,894 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 450 transitions. Word has length 19 [2022-12-13 16:13:42,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:13:42,894 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 450 transitions. [2022-12-13 16:13:42,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:42,894 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 450 transitions. [2022-12-13 16:13:42,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 16:13:42,895 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:13:42,895 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:13:42,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 16:13:42,895 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 16:13:42,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:13:42,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1571609538, now seen corresponding path program 1 times [2022-12-13 16:13:42,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:13:42,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200093845] [2022-12-13 16:13:42,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:13:42,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:13:42,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:13:42,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:13:42,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:13:42,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200093845] [2022-12-13 16:13:42,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200093845] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:13:42,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:13:42,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:13:42,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957172178] [2022-12-13 16:13:42,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:13:42,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:13:42,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:13:42,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:13:42,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:13:42,921 INFO L87 Difference]: Start difference. First operand 321 states and 450 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:42,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:13:42,937 INFO L93 Difference]: Finished difference Result 395 states and 528 transitions. [2022-12-13 16:13:42,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:13:42,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-12-13 16:13:42,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:13:42,940 INFO L225 Difference]: With dead ends: 395 [2022-12-13 16:13:42,940 INFO L226 Difference]: Without dead ends: 395 [2022-12-13 16:13:42,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:13:42,941 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 163 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:13:42,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 296 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:13:42,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2022-12-13 16:13:42,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 361. [2022-12-13 16:13:42,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 360 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:42,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 528 transitions. [2022-12-13 16:13:42,946 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 528 transitions. Word has length 19 [2022-12-13 16:13:42,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:13:42,947 INFO L495 AbstractCegarLoop]: Abstraction has 361 states and 528 transitions. [2022-12-13 16:13:42,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:42,947 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 528 transitions. [2022-12-13 16:13:42,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 16:13:42,947 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:13:42,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:13:42,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 16:13:42,947 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 16:13:42,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:13:42,948 INFO L85 PathProgramCache]: Analyzing trace with hash -727311539, now seen corresponding path program 1 times [2022-12-13 16:13:42,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:13:42,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695644225] [2022-12-13 16:13:42,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:13:42,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:13:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:13:42,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:13:42,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:13:42,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695644225] [2022-12-13 16:13:42,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695644225] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 16:13:42,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 16:13:42,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 16:13:42,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917297700] [2022-12-13 16:13:42,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 16:13:42,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 16:13:42,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:13:42,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 16:13:42,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:13:42,975 INFO L87 Difference]: Start difference. First operand 361 states and 528 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:42,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:13:42,982 INFO L93 Difference]: Finished difference Result 365 states and 532 transitions. [2022-12-13 16:13:42,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 16:13:42,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-12-13 16:13:42,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:13:42,984 INFO L225 Difference]: With dead ends: 365 [2022-12-13 16:13:42,985 INFO L226 Difference]: Without dead ends: 365 [2022-12-13 16:13:42,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 16:13:42,985 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 0 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 16:13:42,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 358 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 16:13:42,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-12-13 16:13:42,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2022-12-13 16:13:42,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 302 states have (on average 1.7615894039735098) internal successors, (532), 364 states have internal predecessors, (532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:42,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 532 transitions. [2022-12-13 16:13:42,993 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 532 transitions. Word has length 23 [2022-12-13 16:13:42,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:13:42,993 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 532 transitions. [2022-12-13 16:13:42,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:42,994 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 532 transitions. [2022-12-13 16:13:42,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 16:13:42,994 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:13:42,994 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:13:42,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 16:13:42,995 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 16:13:42,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:13:42,995 INFO L85 PathProgramCache]: Analyzing trace with hash 97933121, now seen corresponding path program 1 times [2022-12-13 16:13:42,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:13:42,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165555407] [2022-12-13 16:13:42,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:13:42,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:13:43,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:13:43,309 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:13:43,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:13:43,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165555407] [2022-12-13 16:13:43,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165555407] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:13:43,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9589910] [2022-12-13 16:13:43,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:13:43,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:13:43,310 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02c908c5-53ef-4206-9ad9-cd8263265cfc/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:13:43,311 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02c908c5-53ef-4206-9ad9-cd8263265cfc/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:13:43,312 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02c908c5-53ef-4206-9ad9-cd8263265cfc/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 16:13:43,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:13:43,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 31 conjunts are in the unsatisfiable core [2022-12-13 16:13:43,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:13:43,446 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 [2022-12-13 16:13:43,461 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 16:13:43,462 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 11 [2022-12-13 16:13:43,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 16:13:43,530 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:13:43,531 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 26 [2022-12-13 16:13:43,562 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-13 16:13:43,563 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 17 treesize of output 21 [2022-12-13 16:13:43,618 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 17 treesize of output 19 [2022-12-13 16:13:43,741 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:13:43,742 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 34 treesize of output 35 [2022-12-13 16:13:43,816 INFO L321 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2022-12-13 16:13:43,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 45 [2022-12-13 16:13:43,830 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 31 treesize of output 13 [2022-12-13 16:13:43,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:13:43,854 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:13:44,302 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:13:44,302 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 90 treesize of output 70 [2022-12-13 16:13:44,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-13 16:13:44,311 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 380 treesize of output 320 [2022-12-13 16:13:44,374 INFO L321 Elim1Store]: treesize reduction 124, result has 23.0 percent of original size [2022-12-13 16:13:44,374 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 851 treesize of output 821 [2022-12-13 16:13:44,435 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 653 treesize of output 565 [2022-12-13 16:13:44,445 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 577 treesize of output 449 [2022-12-13 16:13:48,321 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:13:48,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9589910] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 16:13:48,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 16:13:48,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10, 12] total 26 [2022-12-13 16:13:48,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718826071] [2022-12-13 16:13:48,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 16:13:48,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-13 16:13:48,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 16:13:48,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-13 16:13:48,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=572, Unknown=6, NotChecked=0, Total=702 [2022-12-13 16:13:48,323 INFO L87 Difference]: Start difference. First operand 365 states and 532 transitions. Second operand has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:49,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 16:13:49,385 INFO L93 Difference]: Finished difference Result 701 states and 997 transitions. [2022-12-13 16:13:49,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 16:13:49,386 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-12-13 16:13:49,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 16:13:49,388 INFO L225 Difference]: With dead ends: 701 [2022-12-13 16:13:49,388 INFO L226 Difference]: Without dead ends: 701 [2022-12-13 16:13:49,388 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 252 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=214, Invalid=836, Unknown=6, NotChecked=0, Total=1056 [2022-12-13 16:13:49,389 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 464 mSDsluCounter, 1721 mSDsCounter, 0 mSdLazyCounter, 1377 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 464 SdHoareTripleChecker+Valid, 1917 SdHoareTripleChecker+Invalid, 1403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 16:13:49,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [464 Valid, 1917 Invalid, 1403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1377 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 16:13:49,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 701 states. [2022-12-13 16:13:49,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 701 to 364. [2022-12-13 16:13:49,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 364 states, 302 states have (on average 1.7582781456953642) internal successors, (531), 363 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:49,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 531 transitions. [2022-12-13 16:13:49,395 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 531 transitions. Word has length 24 [2022-12-13 16:13:49,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 16:13:49,395 INFO L495 AbstractCegarLoop]: Abstraction has 364 states and 531 transitions. [2022-12-13 16:13:49,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3846153846153846) internal successors, (62), 27 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 16:13:49,395 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 531 transitions. [2022-12-13 16:13:49,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 16:13:49,395 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 16:13:49,395 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 16:13:49,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02c908c5-53ef-4206-9ad9-cd8263265cfc/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 16:13:49,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02c908c5-53ef-4206-9ad9-cd8263265cfc/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-13 16:13:49,596 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2022-12-13 16:13:49,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 16:13:49,597 INFO L85 PathProgramCache]: Analyzing trace with hash 97933122, now seen corresponding path program 1 times [2022-12-13 16:13:49,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 16:13:49,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216274728] [2022-12-13 16:13:49,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:13:49,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 16:13:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:13:50,145 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:13:50,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 16:13:50,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216274728] [2022-12-13 16:13:50,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216274728] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 16:13:50,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1648995328] [2022-12-13 16:13:50,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 16:13:50,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 16:13:50,146 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02c908c5-53ef-4206-9ad9-cd8263265cfc/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 16:13:50,147 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02c908c5-53ef-4206-9ad9-cd8263265cfc/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 16:13:50,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_02c908c5-53ef-4206-9ad9-cd8263265cfc/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 16:13:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 16:13:50,221 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 43 conjunts are in the unsatisfiable core [2022-12-13 16:13:50,225 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 16:13:50,227 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 [2022-12-13 16:13:50,241 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 16:13:50,242 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 11 [2022-12-13 16:13:50,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-13 16:13:50,260 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 13 treesize of output 9 [2022-12-13 16:13:50,316 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:13:50,316 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 35 treesize of output 36 [2022-12-13 16:13:50,319 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 22 treesize of output 24 [2022-12-13 16:13:50,342 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-12-13 16:13:50,343 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 11 [2022-12-13 16:13:50,428 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 39 treesize of output 37 [2022-12-13 16:13:50,431 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 [2022-12-13 16:13:50,499 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 16:13:50,500 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 57 treesize of output 54 [2022-12-13 16:13:50,505 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 22 treesize of output 24 [2022-12-13 16:13:50,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 16:13:50,531 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-12-13 16:13:50,537 INFO L321 Elim1Store]: treesize reduction 4, result has 71.4 percent of original size [2022-12-13 16:13:50,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-12-13 16:13:50,564 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 31 treesize of output 13 [2022-12-13 16:13:50,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-12-13 16:13:50,592 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 16:13:50,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 16:13:50,927 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (or (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_561) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_24| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_24|) 0)))) (forall ((|v_ULTIMATE.start_main_~tmpList~0#1.base_24| Int) (v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (or (forall ((v_ArrVal_564 Int)) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_561) .cse1 v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 4) (select (store |c_#length| |v_ULTIMATE.start_main_~tmpList~0#1.base_24| v_ArrVal_564) (select (select (store .cse2 .cse1 v_ArrVal_563) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0)))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~tmpList~0#1.base_24|) 0)))))) is different from false [2022-12-13 16:13:50,945 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:13:50,945 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 171 treesize of output 175 [2022-12-13 16:13:50,964 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:13:50,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 149 treesize of output 167 [2022-12-13 16:13:51,039 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_561) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (forall ((v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_2) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_prenex_3) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 1)) (forall ((v_prenex_2 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem9#1.base| (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_2))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))))) is different from false [2022-12-13 16:13:51,053 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~tree~0#1.offset| 8))) (and (forall ((v_ArrVal_560 (Array Int Int)) (v_ArrVal_562 (Array Int Int)) (v_ArrVal_561 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_561) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_ArrVal_560) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_562) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (forall ((v_prenex_2 (Array Int Int)) (v_ArrVal_563 (Array Int Int))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_2))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_ArrVal_563)) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0))) (forall ((v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_4) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~tmpList~0#1.base| v_prenex_2) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) v_prenex_3) |c_ULTIMATE.start_main_~tree~0#1.base|) .cse0) 1)))) is different from false [2022-12-13 16:13:53,762 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:13:53,762 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 182 [2022-12-13 16:13:53,772 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:13:53,773 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 132 [2022-12-13 16:13:53,782 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 19678 treesize of output 17590 [2022-12-13 16:13:54,405 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 19068 treesize of output 18906 [2022-12-13 16:13:54,530 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 18901 treesize of output 18829 [2022-12-13 16:13:54,599 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 18829 treesize of output 18685 [2022-12-13 16:13:54,666 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 18685 treesize of output 18621 [2022-12-13 16:13:54,735 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 18621 treesize of output 18493 [2022-12-13 16:13:54,802 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 18493 treesize of output 18461 [2022-12-13 16:13:54,868 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 18461 treesize of output 18173 [2022-12-13 16:13:54,969 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 18173 treesize of output 17997 [2022-12-13 16:13:55,038 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 17997 treesize of output 17805 [2022-12-13 16:13:55,106 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 17805 treesize of output 17677 [2022-12-13 16:13:55,172 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 17677 treesize of output 17613 [2022-12-13 16:13:55,283 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-13 16:13:55,283 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 17620 treesize of output 17660 [2022-12-13 16:13:55,422 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 17607 treesize of output 16231 [2022-12-13 16:13:55,497 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 16231 treesize of output 14247 [2022-12-13 16:13:55,568 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 14247 treesize of output 13735