./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R --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 e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 --- 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-38b53e6 [2022-11-25 18:16:46,971 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:16:46,974 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:16:47,002 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:16:47,006 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:16:47,010 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:16:47,013 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:16:47,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:16:47,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:16:47,027 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:16:47,029 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:16:47,032 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:16:47,032 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:16:47,038 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:16:47,040 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:16:47,044 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:16:47,046 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:16:47,047 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:16:47,049 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:16:47,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:16:47,060 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:16:47,063 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:16:47,065 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:16:47,066 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:16:47,079 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:16:47,079 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:16:47,080 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:16:47,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:16:47,084 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:16:47,085 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:16:47,086 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:16:47,088 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:16:47,090 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:16:47,091 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:16:47,093 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:16:47,094 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:16:47,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:16:47,095 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:16:47,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:16:47,098 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:16:47,099 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:16:47,100 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 18:16:47,155 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:16:47,156 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:16:47,157 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:16:47,157 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:16:47,158 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:16:47,158 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:16:47,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:16:47,160 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:16:47,160 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:16:47,160 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:16:47,162 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 18:16:47,162 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 18:16:47,162 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:16:47,163 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 18:16:47,163 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:16:47,163 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 18:16:47,164 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 18:16:47,164 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 18:16:47,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:16:47,164 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 18:16:47,165 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 18:16:47,165 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:16:47,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:16:47,166 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:16:47,166 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:16:47,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:16:47,167 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:16:47,167 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:16:47,168 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:16:47,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:16:47,168 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:16:47,169 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:16:47,169 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:16:47,169 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_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/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_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R 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 -> e4cb0386e6b22b9d67dd4f4c4c33eb167dcf1836f99794e4424c5e73e6fc14d4 [2022-11-25 18:16:47,547 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:16:47,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:16:47,597 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:16:47,598 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:16:47,599 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:16:47,600 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2022-11-25 18:16:50,997 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:16:51,392 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:16:51,393 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i [2022-11-25 18:16:51,414 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/data/d9638ea82/7cb67a06fcd64430b0bb9a448592f994/FLAGac8877527 [2022-11-25 18:16:51,437 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/data/d9638ea82/7cb67a06fcd64430b0bb9a448592f994 [2022-11-25 18:16:51,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:16:51,445 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:16:51,449 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:16:51,449 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:16:51,453 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:16:51,454 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:16:51" (1/1) ... [2022-11-25 18:16:51,456 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4714d11a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:51, skipping insertion in model container [2022-11-25 18:16:51,456 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:16:51" (1/1) ... [2022-11-25 18:16:51,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:16:51,512 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:16:51,912 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2022-11-25 18:16:51,919 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:16:51,935 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:16:51,987 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/sv-benchmarks/c/list-simple/sll2n_prepend_equal.i[24076,24089] [2022-11-25 18:16:51,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:16:52,025 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:16:52,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:52 WrapperNode [2022-11-25 18:16:52,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:16:52,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:16:52,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:16:52,028 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:16:52,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:52" (1/1) ... [2022-11-25 18:16:52,064 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:52" (1/1) ... [2022-11-25 18:16:52,097 INFO L138 Inliner]: procedures = 127, calls = 30, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 106 [2022-11-25 18:16:52,098 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:16:52,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:16:52,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:16:52,100 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:16:52,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:52" (1/1) ... [2022-11-25 18:16:52,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:52" (1/1) ... [2022-11-25 18:16:52,116 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:52" (1/1) ... [2022-11-25 18:16:52,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:52" (1/1) ... [2022-11-25 18:16:52,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:52" (1/1) ... [2022-11-25 18:16:52,132 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:52" (1/1) ... [2022-11-25 18:16:52,134 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:52" (1/1) ... [2022-11-25 18:16:52,136 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:52" (1/1) ... [2022-11-25 18:16:52,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:16:52,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:16:52,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:16:52,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:16:52,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:52" (1/1) ... [2022-11-25 18:16:52,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:16:52,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:16:52,183 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:16:52,203 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:16:52,257 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:16:52,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:16:52,258 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-11-25 18:16:52,258 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-11-25 18:16:52,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 18:16:52,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:16:52,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 18:16:52,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 18:16:52,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 18:16:52,263 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:16:52,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 18:16:52,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:16:52,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:16:52,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:16:52,455 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:16:52,457 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:16:52,811 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:16:52,819 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:16:52,819 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-25 18:16:52,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:16:52 BoogieIcfgContainer [2022-11-25 18:16:52,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:16:52,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:16:52,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:16:52,829 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:16:52,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:16:51" (1/3) ... [2022-11-25 18:16:52,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d6addc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:16:52, skipping insertion in model container [2022-11-25 18:16:52,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:16:52" (2/3) ... [2022-11-25 18:16:52,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53d6addc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:16:52, skipping insertion in model container [2022-11-25 18:16:52,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:16:52" (3/3) ... [2022-11-25 18:16:52,834 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_equal.i [2022-11-25 18:16:52,870 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:16:52,870 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 27 error locations. [2022-11-25 18:16:52,953 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:16:52,967 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;@587fe06d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:16:52,968 INFO L358 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2022-11-25 18:16:52,977 INFO L276 IsEmpty]: Start isEmpty. Operand has 73 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 69 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:16:52,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 18:16:52,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:16:52,987 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:16:52,989 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:16:53,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:16:53,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1813073593, now seen corresponding path program 1 times [2022-11-25 18:16:53,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:16:53,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628257582] [2022-11-25 18:16:53,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:53,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:16:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:53,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:16:53,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:16:53,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628257582] [2022-11-25 18:16:53,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628257582] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:16:53,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:16:53,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:16:53,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882421347] [2022-11-25 18:16:53,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:16:53,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:16:53,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:16:53,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:16:53,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:16:53,535 INFO L87 Difference]: Start difference. First operand has 73 states, 42 states have (on average 1.8571428571428572) internal successors, (78), 69 states have internal predecessors, (78), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:16:53,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:16:53,669 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-11-25 18:16:53,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:16:53,672 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 18:16:53,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:16:53,681 INFO L225 Difference]: With dead ends: 71 [2022-11-25 18:16:53,681 INFO L226 Difference]: Without dead ends: 68 [2022-11-25 18:16:53,683 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-11-25 18:16:53,687 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 8 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:16:53,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 108 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:16:53,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-25 18:16:53,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-25 18:16:53,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 40 states have (on average 1.7) internal successors, (68), 64 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:16:53,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-11-25 18:16:53,735 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 7 [2022-11-25 18:16:53,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:16:53,736 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-11-25 18:16:53,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:16:53,737 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-11-25 18:16:53,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-25 18:16:53,738 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:16:53,738 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:16:53,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:16:53,739 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:16:53,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:16:53,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1813073594, now seen corresponding path program 1 times [2022-11-25 18:16:53,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:16:53,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117733189] [2022-11-25 18:16:53,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:53,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:16:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:53,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:16:53,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:16:53,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117733189] [2022-11-25 18:16:53,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117733189] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:16:53,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:16:53,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:16:53,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731946332] [2022-11-25 18:16:53,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:16:53,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:16:53,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:16:53,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:16:53,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:16:53,990 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:16:54,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:16:54,099 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2022-11-25 18:16:54,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:16:54,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-11-25 18:16:54,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:16:54,102 INFO L225 Difference]: With dead ends: 66 [2022-11-25 18:16:54,102 INFO L226 Difference]: Without dead ends: 66 [2022-11-25 18:16:54,102 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-11-25 18:16:54,104 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 4 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:16:54,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 108 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:16:54,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-25 18:16:54,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-11-25 18:16:54,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.65) internal successors, (66), 62 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:16:54,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-11-25 18:16:54,113 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 7 [2022-11-25 18:16:54,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:16:54,114 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-11-25 18:16:54,125 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:16:54,126 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-11-25 18:16:54,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 18:16:54,127 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:16:54,127 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:16:54,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:16:54,128 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:16:54,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:16:54,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1431584192, now seen corresponding path program 1 times [2022-11-25 18:16:54,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:16:54,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943198666] [2022-11-25 18:16:54,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:54,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:16:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:54,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:54,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:16:54,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:16:54,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943198666] [2022-11-25 18:16:54,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943198666] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:16:54,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:16:54,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:16:54,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628046432] [2022-11-25 18:16:54,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:16:54,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:16:54,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:16:54,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:16:54,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:16:54,451 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:16:54,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:16:54,725 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-11-25 18:16:54,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:16:54,727 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-25 18:16:54,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:16:54,731 INFO L225 Difference]: With dead ends: 70 [2022-11-25 18:16:54,733 INFO L226 Difference]: Without dead ends: 70 [2022-11-25 18:16:54,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:16:54,738 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 11 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:16:54,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 249 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:16:54,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-25 18:16:54,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2022-11-25 18:16:54,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 40 states have (on average 1.625) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:16:54,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-11-25 18:16:54,763 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 13 [2022-11-25 18:16:54,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:16:54,765 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-11-25 18:16:54,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:16:54,765 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-11-25 18:16:54,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 18:16:54,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:16:54,768 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:16:54,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:16:54,769 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:16:54,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:16:54,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1431584193, now seen corresponding path program 1 times [2022-11-25 18:16:54,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:16:54,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166576936] [2022-11-25 18:16:54,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:54,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:16:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:16:55,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:16:55,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166576936] [2022-11-25 18:16:55,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166576936] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:16:55,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:16:55,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:16:55,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755613539] [2022-11-25 18:16:55,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:16:55,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:16:55,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:16:55,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:16:55,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:16:55,259 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:16:55,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:16:55,547 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-11-25 18:16:55,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:16:55,548 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-11-25 18:16:55,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:16:55,549 INFO L225 Difference]: With dead ends: 69 [2022-11-25 18:16:55,549 INFO L226 Difference]: Without dead ends: 69 [2022-11-25 18:16:55,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:16:55,551 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 9 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:16:55,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 265 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:16:55,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-25 18:16:55,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 64. [2022-11-25 18:16:55,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.6) internal successors, (64), 60 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:16:55,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2022-11-25 18:16:55,560 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 13 [2022-11-25 18:16:55,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:16:55,560 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2022-11-25 18:16:55,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:16:55,561 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2022-11-25 18:16:55,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 18:16:55,562 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:16:55,562 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:16:55,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:16:55,563 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:16:55,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:16:55,564 INFO L85 PathProgramCache]: Analyzing trace with hash 869381824, now seen corresponding path program 1 times [2022-11-25 18:16:55,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:16:55,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828105194] [2022-11-25 18:16:55,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:55,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:16:55,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 18:16:55,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:16:55,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:16:55,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828105194] [2022-11-25 18:16:55,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828105194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:16:55,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:16:55,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 18:16:55,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117807649] [2022-11-25 18:16:55,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:16:55,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:16:55,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:16:55,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:16:55,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:16:55,650 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:16:55,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:16:55,747 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-11-25 18:16:55,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:16:55,748 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-11-25 18:16:55,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:16:55,749 INFO L225 Difference]: With dead ends: 70 [2022-11-25 18:16:55,749 INFO L226 Difference]: Without dead ends: 70 [2022-11-25 18:16:55,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:16:55,751 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 4 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:16:55,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 159 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:16:55,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-25 18:16:55,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2022-11-25 18:16:55,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 61 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:16:55,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-11-25 18:16:55,759 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 15 [2022-11-25 18:16:55,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:16:55,760 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-11-25 18:16:55,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:16:55,760 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-11-25 18:16:55,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 18:16:55,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:16:55,762 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:16:55,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:16:55,769 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:16:55,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:16:55,770 INFO L85 PathProgramCache]: Analyzing trace with hash -206453950, now seen corresponding path program 1 times [2022-11-25 18:16:55,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:16:55,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904401058] [2022-11-25 18:16:55,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:55,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:16:55,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-25 18:16:55,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:55,962 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 18:16:55,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:16:55,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904401058] [2022-11-25 18:16:55,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904401058] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:16:55,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909894621] [2022-11-25 18:16:55,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:55,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:16:55,966 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:16:55,975 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:16:55,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 18:16:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:56,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 18:16:56,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:16:56,263 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:16:56,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:16:56,341 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 18:16:56,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909894621] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:16:56,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:16:56,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-11-25 18:16:56,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757561684] [2022-11-25 18:16:56,343 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:16:56,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:16:56,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:16:56,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:16:56,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:16:56,347 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 18:16:56,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:16:56,451 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2022-11-25 18:16:56,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:16:56,452 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-11-25 18:16:56,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:16:56,455 INFO L225 Difference]: With dead ends: 71 [2022-11-25 18:16:56,456 INFO L226 Difference]: Without dead ends: 71 [2022-11-25 18:16:56,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:16:56,461 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 4 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:16:56,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 158 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:16:56,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-25 18:16:56,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-11-25 18:16:56,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 66 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 18:16:56,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2022-11-25 18:16:56,490 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 28 [2022-11-25 18:16:56,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:16:56,491 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2022-11-25 18:16:56,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-25 18:16:56,492 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-11-25 18:16:56,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 18:16:56,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:16:56,493 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:16:56,508 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 18:16:56,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-25 18:16:56,702 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:16:56,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:16:56,703 INFO L85 PathProgramCache]: Analyzing trace with hash 400923136, now seen corresponding path program 2 times [2022-11-25 18:16:56,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:16:56,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187977970] [2022-11-25 18:16:56,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:56,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:16:56,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:57,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:57,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:16:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:57,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 18:16:57,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:57,527 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-25 18:16:57,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:16:57,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187977970] [2022-11-25 18:16:57,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187977970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:16:57,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:16:57,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:16:57,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265751941] [2022-11-25 18:16:57,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:16:57,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:16:57,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:16:57,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:16:57,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:16:57,530 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:16:57,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:16:57,728 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2022-11-25 18:16:57,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:16:57,729 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2022-11-25 18:16:57,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:16:57,730 INFO L225 Difference]: With dead ends: 79 [2022-11-25 18:16:57,730 INFO L226 Difference]: Without dead ends: 79 [2022-11-25 18:16:57,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:16:57,732 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 84 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:16:57,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 147 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:16:57,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-25 18:16:57,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2022-11-25 18:16:57,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.434782608695652) internal successors, (66), 62 states have internal predecessors, (66), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 18:16:57,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2022-11-25 18:16:57,738 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 41 [2022-11-25 18:16:57,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:16:57,739 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2022-11-25 18:16:57,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:16:57,742 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2022-11-25 18:16:57,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 18:16:57,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:16:57,747 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:16:57,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:16:57,747 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:16:57,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:16:57,752 INFO L85 PathProgramCache]: Analyzing trace with hash 400923137, now seen corresponding path program 1 times [2022-11-25 18:16:57,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:16:57,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327235862] [2022-11-25 18:16:57,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:57,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:16:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:58,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:16:58,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:58,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:16:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:58,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 18:16:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:58,960 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 18:16:58,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:16:58,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327235862] [2022-11-25 18:16:58,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327235862] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:16:58,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596777230] [2022-11-25 18:16:58,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:16:58,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:16:58,962 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:16:58,963 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:16:58,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:16:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:16:59,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-25 18:16:59,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:16:59,216 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-11-25 18:16:59,266 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 18:16:59,309 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_452 Int)) (= |c_#length| (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_452))))) is different from true [2022-11-25 18:16:59,418 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:59,420 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 18:16:59,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 18:16:59,499 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_453 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_453) |c_#length|)))) is different from true [2022-11-25 18:16:59,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:59,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 18:16:59,667 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 18:16:59,685 WARN L859 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (< |node_create_~temp~0#1.base| |c_#StackHeapBarrier|) (exists ((v_ArrVal_454 Int)) (= (store |c_old(#length)| |node_create_~temp~0#1.base| v_ArrVal_454) |c_#length|)))) is different from true [2022-11-25 18:16:59,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:16:59,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-25 18:16:59,755 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 18 not checked. [2022-11-25 18:16:59,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:17:01,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596777230] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:17:01,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:17:01,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2022-11-25 18:17:01,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359322507] [2022-11-25 18:17:01,914 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:17:01,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-25 18:17:01,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:01,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-25 18:17:01,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=225, Unknown=3, NotChecked=96, Total=380 [2022-11-25 18:17:01,917 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 18 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 18:17:02,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:02,386 INFO L93 Difference]: Finished difference Result 75 states and 81 transitions. [2022-11-25 18:17:02,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:17:02,387 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 41 [2022-11-25 18:17:02,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:02,389 INFO L225 Difference]: With dead ends: 75 [2022-11-25 18:17:02,389 INFO L226 Difference]: Without dead ends: 75 [2022-11-25 18:17:02,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=88, Invalid=341, Unknown=3, NotChecked=120, Total=552 [2022-11-25 18:17:02,390 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 251 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 162 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:17:02,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 144 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 177 Invalid, 0 Unknown, 162 Unchecked, 0.3s Time] [2022-11-25 18:17:02,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-25 18:17:02,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 63. [2022-11-25 18:17:02,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 58 states have internal predecessors, (62), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 18:17:02,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2022-11-25 18:17:02,396 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 41 [2022-11-25 18:17:02,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:02,396 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2022-11-25 18:17:02,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 3.8125) internal successors, (61), 16 states have internal predecessors, (61), 4 states have call successors, (4), 2 states have call predecessors, (4), 6 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 18:17:02,397 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2022-11-25 18:17:02,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 18:17:02,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:02,398 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:17:02,413 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:17:02,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-25 18:17:02,598 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:17:02,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:02,599 INFO L85 PathProgramCache]: Analyzing trace with hash -456284671, now seen corresponding path program 1 times [2022-11-25 18:17:02,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:02,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93370702] [2022-11-25 18:17:02,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:02,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:02,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:02,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:17:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:02,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 18:17:02,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:02,985 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-25 18:17:02,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:02,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93370702] [2022-11-25 18:17:02,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93370702] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:17:02,986 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:17:02,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:17:02,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781703128] [2022-11-25 18:17:02,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:17:02,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:17:02,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:02,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:17:02,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:17:02,989 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:17:03,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:03,145 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2022-11-25 18:17:03,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:17:03,146 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-11-25 18:17:03,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:03,147 INFO L225 Difference]: With dead ends: 62 [2022-11-25 18:17:03,147 INFO L226 Difference]: Without dead ends: 62 [2022-11-25 18:17:03,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:17:03,148 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 39 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:17:03,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 181 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:17:03,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-25 18:17:03,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-25 18:17:03,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.326086956521739) internal successors, (61), 57 states have internal predecessors, (61), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 18:17:03,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2022-11-25 18:17:03,153 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 42 [2022-11-25 18:17:03,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:03,153 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2022-11-25 18:17:03,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:17:03,153 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2022-11-25 18:17:03,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 18:17:03,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:03,155 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:17:03,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:17:03,156 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:17:03,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:03,156 INFO L85 PathProgramCache]: Analyzing trace with hash -456284672, now seen corresponding path program 1 times [2022-11-25 18:17:03,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:03,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818624186] [2022-11-25 18:17:03,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:03,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:03,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:03,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:03,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:17:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:03,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 18:17:03,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:03,360 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-25 18:17:03,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:03,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818624186] [2022-11-25 18:17:03,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818624186] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:17:03,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:17:03,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:17:03,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335311279] [2022-11-25 18:17:03,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:17:03,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:17:03,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:03,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:17:03,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:17:03,364 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:17:03,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:03,536 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2022-11-25 18:17:03,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:17:03,537 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 42 [2022-11-25 18:17:03,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:03,541 INFO L225 Difference]: With dead ends: 73 [2022-11-25 18:17:03,541 INFO L226 Difference]: Without dead ends: 73 [2022-11-25 18:17:03,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:17:03,542 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 36 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:17:03,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 174 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:17:03,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-25 18:17:03,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 61. [2022-11-25 18:17:03,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 56 states have internal predecessors, (60), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 18:17:03,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2022-11-25 18:17:03,562 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 42 [2022-11-25 18:17:03,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:03,563 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2022-11-25 18:17:03,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 18:17:03,563 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-11-25 18:17:03,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-25 18:17:03,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:03,566 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:17:03,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 18:17:03,567 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:17:03,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:03,569 INFO L85 PathProgramCache]: Analyzing trace with hash 866562379, now seen corresponding path program 1 times [2022-11-25 18:17:03,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:03,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299786796] [2022-11-25 18:17:03,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:03,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:03,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:03,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:17:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:03,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 18:17:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:04,012 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-25 18:17:04,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:04,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299786796] [2022-11-25 18:17:04,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299786796] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:17:04,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:17:04,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:17:04,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259121956] [2022-11-25 18:17:04,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:17:04,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:17:04,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:04,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:17:04,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:17:04,015 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:17:04,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:04,287 INFO L93 Difference]: Finished difference Result 92 states and 100 transitions. [2022-11-25 18:17:04,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:17:04,288 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2022-11-25 18:17:04,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:04,289 INFO L225 Difference]: With dead ends: 92 [2022-11-25 18:17:04,289 INFO L226 Difference]: Without dead ends: 92 [2022-11-25 18:17:04,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:17:04,290 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 188 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:17:04,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 215 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:17:04,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-11-25 18:17:04,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 62. [2022-11-25 18:17:04,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.3125) internal successors, (63), 57 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 18:17:04,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2022-11-25 18:17:04,294 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 49 [2022-11-25 18:17:04,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:04,295 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2022-11-25 18:17:04,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:17:04,295 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2022-11-25 18:17:04,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-25 18:17:04,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:04,296 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:17:04,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:17:04,297 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:17:04,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:04,297 INFO L85 PathProgramCache]: Analyzing trace with hash 866562380, now seen corresponding path program 1 times [2022-11-25 18:17:04,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:04,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806749091] [2022-11-25 18:17:04,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:04,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:04,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:04,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:17:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:04,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 18:17:04,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,035 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-25 18:17:05,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:05,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806749091] [2022-11-25 18:17:05,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806749091] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:17:05,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:17:05,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:17:05,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718027442] [2022-11-25 18:17:05,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:17:05,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:17:05,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:05,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:17:05,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:17:05,039 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:17:05,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:05,354 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-11-25 18:17:05,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 18:17:05,355 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 49 [2022-11-25 18:17:05,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:05,355 INFO L225 Difference]: With dead ends: 84 [2022-11-25 18:17:05,355 INFO L226 Difference]: Without dead ends: 84 [2022-11-25 18:17:05,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:17:05,356 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 189 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:17:05,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 233 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:17:05,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-11-25 18:17:05,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 64. [2022-11-25 18:17:05,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.28) internal successors, (64), 59 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 18:17:05,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-11-25 18:17:05,360 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 49 [2022-11-25 18:17:05,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:05,361 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-11-25 18:17:05,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 9 states have internal predecessors, (32), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:17:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-11-25 18:17:05,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-25 18:17:05,362 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:05,362 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:17:05,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 18:17:05,362 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:17:05,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:05,370 INFO L85 PathProgramCache]: Analyzing trace with hash 1093628647, now seen corresponding path program 1 times [2022-11-25 18:17:05,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:05,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018477093] [2022-11-25 18:17:05,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:05,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:05,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:05,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:17:05,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 18:17:05,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-25 18:17:05,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:05,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018477093] [2022-11-25 18:17:05,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018477093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:17:05,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:17:05,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 18:17:05,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703040146] [2022-11-25 18:17:05,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:17:05,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:17:05,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:05,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:17:05,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:17:05,785 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:17:06,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:06,017 INFO L93 Difference]: Finished difference Result 67 states and 72 transitions. [2022-11-25 18:17:06,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:17:06,018 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-11-25 18:17:06,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:06,019 INFO L225 Difference]: With dead ends: 67 [2022-11-25 18:17:06,020 INFO L226 Difference]: Without dead ends: 67 [2022-11-25 18:17:06,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:17:06,021 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 82 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:17:06,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 291 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:17:06,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-25 18:17:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2022-11-25 18:17:06,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 50 states have (on average 1.26) internal successors, (63), 59 states have internal predecessors, (63), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 18:17:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2022-11-25 18:17:06,025 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 50 [2022-11-25 18:17:06,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:06,026 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2022-11-25 18:17:06,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:17:06,026 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2022-11-25 18:17:06,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-25 18:17:06,027 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:06,028 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:17:06,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 18:17:06,028 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:17:06,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:06,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1290611022, now seen corresponding path program 1 times [2022-11-25 18:17:06,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:06,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054313537] [2022-11-25 18:17:06,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:06,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:06,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:06,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:06,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:17:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:06,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 18:17:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:07,094 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2022-11-25 18:17:07,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:07,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054313537] [2022-11-25 18:17:07,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054313537] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:17:07,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:17:07,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-25 18:17:07,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821622222] [2022-11-25 18:17:07,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:17:07,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 18:17:07,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:07,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 18:17:07,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2022-11-25 18:17:07,097 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:17:07,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:07,634 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-11-25 18:17:07,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-25 18:17:07,635 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 53 [2022-11-25 18:17:07,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:07,636 INFO L225 Difference]: With dead ends: 65 [2022-11-25 18:17:07,636 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 18:17:07,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2022-11-25 18:17:07,638 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 155 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:17:07,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 277 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:17:07,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 18:17:07,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-25 18:17:07,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 51 states have (on average 1.2549019607843137) internal successors, (64), 60 states have internal predecessors, (64), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 18:17:07,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-11-25 18:17:07,641 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 53 [2022-11-25 18:17:07,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:07,642 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-11-25 18:17:07,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.769230769230769) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:17:07,642 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-11-25 18:17:07,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-25 18:17:07,643 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:07,643 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:17:07,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 18:17:07,644 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:17:07,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:07,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1354235562, now seen corresponding path program 1 times [2022-11-25 18:17:07,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:07,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146689852] [2022-11-25 18:17:07,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:07,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:09,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:09,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:17:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:09,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 18:17:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:09,804 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-25 18:17:09,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:09,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146689852] [2022-11-25 18:17:09,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146689852] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:17:09,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432671457] [2022-11-25 18:17:09,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:09,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:17:09,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:17:09,807 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:17:09,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:17:10,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:10,057 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 118 conjunts are in the unsatisfiable core [2022-11-25 18:17:10,063 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:17:10,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2022-11-25 18:17:10,677 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 7 treesize of output 3 [2022-11-25 18:17:11,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:11,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:11,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2022-11-25 18:17:11,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:11,247 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:11,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2022-11-25 18:17:11,271 INFO L321 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-11-25 18:17:11,272 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 21 treesize of output 29 [2022-11-25 18:17:11,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:11,653 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:17:11,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2022-11-25 18:17:11,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:11,680 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:17:11,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2022-11-25 18:17:11,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:11,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2022-11-25 18:17:11,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:11,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2022-11-25 18:17:12,385 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:17:12,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:12,390 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:17:12,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 40 [2022-11-25 18:17:12,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:12,408 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-25 18:17:12,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2022-11-25 18:17:12,759 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:17:12,760 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:17:16,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [432671457] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:17:16,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:17:16,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27] total 50 [2022-11-25 18:17:16,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672464663] [2022-11-25 18:17:16,655 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:17:16,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-25 18:17:16,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:16,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-25 18:17:16,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3687, Unknown=0, NotChecked=0, Total=3906 [2022-11-25 18:17:16,659 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 51 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 45 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 18:17:21,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:21,182 INFO L93 Difference]: Finished difference Result 105 states and 112 transitions. [2022-11-25 18:17:21,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-25 18:17:21,185 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 45 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 54 [2022-11-25 18:17:21,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:21,186 INFO L225 Difference]: With dead ends: 105 [2022-11-25 18:17:21,186 INFO L226 Difference]: Without dead ends: 105 [2022-11-25 18:17:21,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1672 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=659, Invalid=6651, Unknown=0, NotChecked=0, Total=7310 [2022-11-25 18:17:21,190 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 579 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 1254 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 579 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:17:21,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [579 Valid, 616 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1254 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-11-25 18:17:21,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-25 18:17:21,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 67. [2022-11-25 18:17:21,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 53 states have (on average 1.2830188679245282) internal successors, (68), 62 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 18:17:21,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2022-11-25 18:17:21,195 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 54 [2022-11-25 18:17:21,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:21,195 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2022-11-25 18:17:21,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 45 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 18:17:21,196 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2022-11-25 18:17:21,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-25 18:17:21,197 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:21,197 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:17:21,221 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:17:21,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-25 18:17:21,412 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:17:21,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:21,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1354235561, now seen corresponding path program 1 times [2022-11-25 18:17:21,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:21,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454581255] [2022-11-25 18:17:21,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:21,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:21,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:23,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:23,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:23,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:17:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:23,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 18:17:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:24,323 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 22 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 18:17:24,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:24,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454581255] [2022-11-25 18:17:24,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454581255] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:17:24,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105166288] [2022-11-25 18:17:24,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:24,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:17:24,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:17:24,326 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:17:24,344 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:17:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:24,616 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 112 conjunts are in the unsatisfiable core [2022-11-25 18:17:24,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:17:25,423 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 19 treesize of output 11 [2022-11-25 18:17:25,435 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 7 treesize of output 3 [2022-11-25 18:17:26,071 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:26,072 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 25 treesize of output 25 [2022-11-25 18:17:26,085 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 18:17:26,085 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 15 treesize of output 15 [2022-11-25 18:17:26,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 18:17:26,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:26,109 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 18:17:26,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:26,509 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-25 18:17:26,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:26,537 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2022-11-25 18:17:26,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:26,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 27 [2022-11-25 18:17:26,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:26,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2022-11-25 18:17:27,231 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:17:27,233 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:27,237 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:17:27,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 76 treesize of output 40 [2022-11-25 18:17:27,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:27,255 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-25 18:17:27,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2022-11-25 18:17:27,598 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 26 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:17:27,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:17:31,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105166288] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:17:31,724 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:17:31,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 48 [2022-11-25 18:17:31,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675571440] [2022-11-25 18:17:31,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:17:31,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-25 18:17:31,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:31,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-25 18:17:31,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=3468, Unknown=1, NotChecked=0, Total=3660 [2022-11-25 18:17:31,733 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand has 49 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 43 states have internal predecessors, (88), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 18:17:38,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:38,329 INFO L93 Difference]: Finished difference Result 91 states and 97 transitions. [2022-11-25 18:17:38,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-11-25 18:17:38,330 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 43 states have internal predecessors, (88), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 54 [2022-11-25 18:17:38,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:38,331 INFO L225 Difference]: With dead ends: 91 [2022-11-25 18:17:38,331 INFO L226 Difference]: Without dead ends: 91 [2022-11-25 18:17:38,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=572, Invalid=6735, Unknown=3, NotChecked=0, Total=7310 [2022-11-25 18:17:38,334 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 663 mSDsluCounter, 703 mSDsCounter, 0 mSdLazyCounter, 1351 mSolverCounterSat, 18 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 732 SdHoareTripleChecker+Invalid, 1371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1351 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:17:38,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 732 Invalid, 1371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1351 Invalid, 2 Unknown, 0 Unchecked, 1.9s Time] [2022-11-25 18:17:38,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-25 18:17:38,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 69. [2022-11-25 18:17:38,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.2545454545454546) internal successors, (69), 64 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 18:17:38,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2022-11-25 18:17:38,340 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 54 [2022-11-25 18:17:38,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:38,341 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2022-11-25 18:17:38,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 1.9130434782608696) internal successors, (88), 43 states have internal predecessors, (88), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 18:17:38,342 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2022-11-25 18:17:38,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 18:17:38,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:38,343 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:17:38,356 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:17:38,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-11-25 18:17:38,557 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:17:38,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:38,557 INFO L85 PathProgramCache]: Analyzing trace with hash 968369212, now seen corresponding path program 1 times [2022-11-25 18:17:38,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:38,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691285824] [2022-11-25 18:17:38,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:38,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:38,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:39,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:39,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:17:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:39,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 18:17:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:40,318 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 18:17:40,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:40,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691285824] [2022-11-25 18:17:40,319 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691285824] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:17:40,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896014894] [2022-11-25 18:17:40,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:40,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:17:40,319 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:17:40,323 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:17:40,346 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 18:17:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:40,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 422 conjuncts, 74 conjunts are in the unsatisfiable core [2022-11-25 18:17:40,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:17:41,146 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 8 treesize of output 4 [2022-11-25 18:17:41,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:41,461 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 12 [2022-11-25 18:17:41,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:41,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-25 18:17:41,894 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:17:41,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:41,902 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 22 [2022-11-25 18:17:42,000 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 15 treesize of output 7 [2022-11-25 18:17:42,243 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:17:42,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:42,247 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:17:42,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 19 [2022-11-25 18:17:42,379 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:17:42,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:17:42,606 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 114 treesize of output 106 [2022-11-25 18:17:43,740 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse3 (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (or (not .cse0) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| Int) (v_ArrVal_1695 (Array Int Int))) (or (not (< |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| |c_#StackHeapBarrier|)) (not (= (select (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (store v_ArrVal_1695 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| v_ArrVal_1695) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse2 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse2 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|))))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) 4) 0)))) (not .cse3)) (or (and .cse0 .cse3) (forall ((|v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| Int) (v_ArrVal_1695 (Array Int Int)) (v_arrayElimCell_55 Int)) (or (not (= (select (let ((.cse4 (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| (store v_ArrVal_1695 4 (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| v_ArrVal_1695) |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))))) (store .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset| |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19|))))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (+ 4 v_arrayElimCell_55)) 0)) (not (< |v_ULTIMATE.start_sll_prepend_#t~ret7#1.base_19| |c_#StackHeapBarrier|)) (<= (+ v_arrayElimCell_55 1) 0)))))) is different from false [2022-11-25 18:17:43,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896014894] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:17:43,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:17:43,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 42 [2022-11-25 18:17:43,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450206391] [2022-11-25 18:17:43,746 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:17:43,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-25 18:17:43,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:43,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-25 18:17:43,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2104, Unknown=1, NotChecked=92, Total=2352 [2022-11-25 18:17:43,749 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand has 42 states, 40 states have (on average 1.95) internal successors, (78), 36 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 18:17:46,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:46,154 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2022-11-25 18:17:46,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 18:17:46,155 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.95) internal successors, (78), 36 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 55 [2022-11-25 18:17:46,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:46,156 INFO L225 Difference]: With dead ends: 72 [2022-11-25 18:17:46,156 INFO L226 Difference]: Without dead ends: 72 [2022-11-25 18:17:46,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=508, Invalid=4051, Unknown=1, NotChecked=132, Total=4692 [2022-11-25 18:17:46,158 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 453 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:17:46,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 639 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-25 18:17:46,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-11-25 18:17:46,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-11-25 18:17:46,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 55 states have (on average 1.2363636363636363) internal successors, (68), 64 states have internal predecessors, (68), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 18:17:46,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2022-11-25 18:17:46,161 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 55 [2022-11-25 18:17:46,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:46,162 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2022-11-25 18:17:46,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.95) internal successors, (78), 36 states have internal predecessors, (78), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 18:17:46,163 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2022-11-25 18:17:46,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-25 18:17:46,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:46,164 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:17:46,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 18:17:46,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 18:17:46,372 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:17:46,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:46,372 INFO L85 PathProgramCache]: Analyzing trace with hash -567858883, now seen corresponding path program 1 times [2022-11-25 18:17:46,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:46,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208545888] [2022-11-25 18:17:46,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:46,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:46,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:48,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:17:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:48,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:17:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:48,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 18:17:48,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:49,853 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-25 18:17:49,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:49,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208545888] [2022-11-25 18:17:49,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208545888] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:17:49,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250492865] [2022-11-25 18:17:49,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:49,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:17:49,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:17:49,855 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:17:49,858 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 18:17:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:50,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 135 conjunts are in the unsatisfiable core [2022-11-25 18:17:50,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:17:50,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:17:50,795 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:50,796 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 21 treesize of output 20 [2022-11-25 18:17:51,343 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 30 treesize of output 18 [2022-11-25 18:17:51,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 18:17:51,359 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 7 treesize of output 3 [2022-11-25 18:17:51,368 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 7 treesize of output 3 [2022-11-25 18:17:51,979 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:51,980 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 11 [2022-11-25 18:17:52,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:52,001 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 38 treesize of output 29 [2022-11-25 18:17:52,029 INFO L321 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2022-11-25 18:17:52,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2022-11-25 18:17:52,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 18:17:52,063 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 18:17:52,064 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 15 treesize of output 15 [2022-11-25 18:17:52,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:52,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 33 [2022-11-25 18:17:52,641 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 18 treesize of output 20 [2022-11-25 18:17:52,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:52,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-25 18:17:52,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:52,943 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 34 [2022-11-25 18:17:52,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:52,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-11-25 18:17:52,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:52,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2022-11-25 18:17:53,645 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:17:53,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:53,651 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:17:53,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 47 [2022-11-25 18:17:53,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:17:53,671 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-25 18:17:53,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 16 [2022-11-25 18:17:54,150 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 15 treesize of output 7 [2022-11-25 18:17:54,253 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 14 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:17:54,253 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:17:57,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250492865] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:17:57,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:17:57,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 51 [2022-11-25 18:17:57,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464383578] [2022-11-25 18:17:57,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:17:57,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-25 18:17:57,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:57,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-25 18:17:57,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=3601, Unknown=0, NotChecked=0, Total=3782 [2022-11-25 18:17:57,376 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 51 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 45 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 18:18:02,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:18:02,887 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2022-11-25 18:18:02,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-25 18:18:02,888 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 45 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 58 [2022-11-25 18:18:02,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:18:02,889 INFO L225 Difference]: With dead ends: 70 [2022-11-25 18:18:02,889 INFO L226 Difference]: Without dead ends: 70 [2022-11-25 18:18:02,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=458, Invalid=6682, Unknown=0, NotChecked=0, Total=7140 [2022-11-25 18:18:02,891 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 292 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 1430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:18:02,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 801 Invalid, 1430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-11-25 18:18:02,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-25 18:18:02,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-25 18:18:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 65 states have internal predecessors, (69), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 18:18:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2022-11-25 18:18:02,895 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 58 [2022-11-25 18:18:02,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:18:02,895 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2022-11-25 18:18:02,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.8571428571428572) internal successors, (91), 45 states have internal predecessors, (91), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-11-25 18:18:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2022-11-25 18:18:02,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-25 18:18:02,896 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:18:02,897 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:18:02,915 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 18:18:03,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-25 18:18:03,098 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:18:03,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:18:03,098 INFO L85 PathProgramCache]: Analyzing trace with hash -423755733, now seen corresponding path program 2 times [2022-11-25 18:18:03,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:18:03,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826805834] [2022-11-25 18:18:03,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:18:03,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:18:03,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:05,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:18:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:05,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:18:05,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:06,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 18:18:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:06,993 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:18:06,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:18:06,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826805834] [2022-11-25 18:18:06,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826805834] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:18:06,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057772119] [2022-11-25 18:18:06,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:18:06,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:18:06,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:18:06,994 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:18:06,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 18:18:07,266 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:18:07,267 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:18:07,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 134 conjunts are in the unsatisfiable core [2022-11-25 18:18:07,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:18:07,880 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-25 18:18:07,881 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 19 treesize of output 16 [2022-11-25 18:18:08,130 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-11-25 18:18:08,751 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:18:08,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 23 [2022-11-25 18:18:08,763 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 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:18:08,771 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 7 treesize of output 3 [2022-11-25 18:18:09,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:09,509 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 14 treesize of output 16 [2022-11-25 18:18:09,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:09,533 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 18:18:09,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 50 [2022-11-25 18:18:09,588 INFO L321 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2022-11-25 18:18:09,588 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 34 treesize of output 57 [2022-11-25 18:18:10,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:10,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-25 18:18:10,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:10,240 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:18:10,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:10,255 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 18:18:10,255 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 85 treesize of output 54 [2022-11-25 18:18:10,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:10,524 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:18:10,524 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 82 treesize of output 51 [2022-11-25 18:18:10,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:10,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2022-11-25 18:18:11,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:11,309 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:18:11,310 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 21 [2022-11-25 18:18:12,328 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:18:12,329 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:18:12,355 INFO L321 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2022-11-25 18:18:12,355 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 125 treesize of output 56 [2022-11-25 18:18:13,011 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 29 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:18:13,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:18:16,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057772119] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:18:16,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:18:16,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 32] total 66 [2022-11-25 18:18:16,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365373255] [2022-11-25 18:18:16,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:18:16,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-25 18:18:16,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:18:16,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-25 18:18:16,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=6207, Unknown=2, NotChecked=0, Total=6480 [2022-11-25 18:18:16,938 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 67 states, 64 states have (on average 1.625) internal successors, (104), 59 states have internal predecessors, (104), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:18:29,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:18:29,189 INFO L93 Difference]: Finished difference Result 109 states and 117 transitions. [2022-11-25 18:18:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-11-25 18:18:29,191 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 64 states have (on average 1.625) internal successors, (104), 59 states have internal predecessors, (104), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 59 [2022-11-25 18:18:29,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:18:29,192 INFO L225 Difference]: With dead ends: 109 [2022-11-25 18:18:29,192 INFO L226 Difference]: Without dead ends: 109 [2022-11-25 18:18:29,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2396 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=1064, Invalid=11144, Unknown=2, NotChecked=0, Total=12210 [2022-11-25 18:18:29,196 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 831 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 1913 mSolverCounterSat, 44 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 1959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1913 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:18:29,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 747 Invalid, 1959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1913 Invalid, 2 Unknown, 0 Unchecked, 2.7s Time] [2022-11-25 18:18:29,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-25 18:18:29,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 72. [2022-11-25 18:18:29,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.2586206896551724) internal successors, (73), 67 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 18:18:29,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 79 transitions. [2022-11-25 18:18:29,200 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 79 transitions. Word has length 59 [2022-11-25 18:18:29,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:18:29,201 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 79 transitions. [2022-11-25 18:18:29,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 64 states have (on average 1.625) internal successors, (104), 59 states have internal predecessors, (104), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:18:29,201 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-11-25 18:18:29,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-11-25 18:18:29,202 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:18:29,202 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:18:29,212 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-25 18:18:29,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:18:29,407 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:18:29,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:18:29,407 INFO L85 PathProgramCache]: Analyzing trace with hash -423755732, now seen corresponding path program 2 times [2022-11-25 18:18:29,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:18:29,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175664157] [2022-11-25 18:18:29,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:18:29,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:18:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:32,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:18:32,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:32,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:18:32,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:32,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 18:18:32,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:18:33,638 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:18:33,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:18:33,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175664157] [2022-11-25 18:18:33,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175664157] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:18:33,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617119812] [2022-11-25 18:18:33,639 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:18:33,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:18:33,639 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:18:33,640 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:18:33,642 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 18:18:33,915 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:18:33,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:18:33,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 147 conjunts are in the unsatisfiable core [2022-11-25 18:18:33,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:18:33,939 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-11-25 18:18:34,034 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 18:18:34,105 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2288 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_2288))) is different from true [2022-11-25 18:18:34,118 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2288 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_2288))) is different from true [2022-11-25 18:18:34,143 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:18:34,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-25 18:18:34,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 18:18:34,640 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:18:34,640 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 7 [2022-11-25 18:18:34,979 INFO L321 Elim1Store]: treesize reduction 44, result has 30.2 percent of original size [2022-11-25 18:18:34,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 22 treesize of output 33 [2022-11-25 18:18:35,000 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 14 treesize of output 16 [2022-11-25 18:18:35,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:18:35,294 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:18:36,124 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:18:36,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 42 [2022-11-25 18:18:36,132 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-11-25 18:18:36,150 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:18:36,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 10 [2022-11-25 18:18:36,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:37,003 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 18:18:37,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 75 [2022-11-25 18:18:37,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:37,033 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-25 18:18:37,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 57 [2022-11-25 18:18:37,057 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-25 18:18:37,057 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 38 [2022-11-25 18:18:37,068 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 15 treesize of output 11 [2022-11-25 18:18:37,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:37,149 INFO L321 Elim1Store]: treesize reduction 24, result has 46.7 percent of original size [2022-11-25 18:18:37,150 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 33 [2022-11-25 18:18:37,879 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:37,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:37,892 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 18:18:37,892 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 61 [2022-11-25 18:18:37,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:37,915 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 52 [2022-11-25 18:18:38,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:38,190 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:18:38,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 60 [2022-11-25 18:18:38,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:38,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:38,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 68 [2022-11-25 18:18:38,225 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2022-11-25 18:18:40,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:18:40,046 INFO L321 Elim1Store]: treesize reduction 63, result has 20.3 percent of original size [2022-11-25 18:18:40,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 196 treesize of output 102 [2022-11-25 18:18:40,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:18:40,067 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:18:40,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 30 [2022-11-25 18:18:41,075 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 12 refuted. 6 times theorem prover too weak. 0 trivial. 12 not checked. [2022-11-25 18:18:41,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:18:52,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617119812] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:18:52,966 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:18:52,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 72 [2022-11-25 18:18:52,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869168379] [2022-11-25 18:18:52,967 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:18:52,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-11-25 18:18:52,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:18:52,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-11-25 18:18:52,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=7191, Unknown=19, NotChecked=342, Total=7832 [2022-11-25 18:18:52,970 INFO L87 Difference]: Start difference. First operand 72 states and 79 transitions. Second operand has 73 states, 70 states have (on average 1.5) internal successors, (105), 63 states have internal predecessors, (105), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:19:12,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:19:12,526 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2022-11-25 18:19:12,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-25 18:19:12,527 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 70 states have (on average 1.5) internal successors, (105), 63 states have internal predecessors, (105), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 59 [2022-11-25 18:19:12,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:19:12,528 INFO L225 Difference]: With dead ends: 124 [2022-11-25 18:19:12,528 INFO L226 Difference]: Without dead ends: 124 [2022-11-25 18:19:12,529 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2813 ImplicationChecksByTransitivity, 32.3s TimeCoverageRelationStatistics Valid=1004, Invalid=13505, Unknown=19, NotChecked=478, Total=15006 [2022-11-25 18:19:12,530 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 1002 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1002 SdHoareTripleChecker+Valid, 1074 SdHoareTripleChecker+Invalid, 2974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 208 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:19:12,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1002 Valid, 1074 Invalid, 2974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 2714 Invalid, 0 Unknown, 208 Unchecked, 4.7s Time] [2022-11-25 18:19:12,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-11-25 18:19:12,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 74. [2022-11-25 18:19:12,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 69 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 18:19:12,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 80 transitions. [2022-11-25 18:19:12,535 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 80 transitions. Word has length 59 [2022-11-25 18:19:12,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:19:12,535 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 80 transitions. [2022-11-25 18:19:12,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 70 states have (on average 1.5) internal successors, (105), 63 states have internal predecessors, (105), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:19:12,536 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 80 transitions. [2022-11-25 18:19:12,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-25 18:19:12,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:19:12,537 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:12,548 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 18:19:12,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:19:12,743 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:19:12,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:12,744 INFO L85 PathProgramCache]: Analyzing trace with hash -251527161, now seen corresponding path program 2 times [2022-11-25 18:19:12,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:12,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329431621] [2022-11-25 18:19:12,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:12,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:12,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:15,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:19:15,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:15,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:19:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:15,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 18:19:15,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:16,459 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 29 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:19:16,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:16,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329431621] [2022-11-25 18:19:16,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329431621] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:19:16,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446182312] [2022-11-25 18:19:16,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:19:16,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:19:16,460 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:19:16,460 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:19:16,463 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 18:19:16,731 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:19:16,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:19:16,735 INFO L263 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 141 conjunts are in the unsatisfiable core [2022-11-25 18:19:16,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:19:16,747 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-11-25 18:19:16,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 18:19:16,870 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_~temp~0#1.base| 0)) (exists ((v_ArrVal_2497 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| v_ArrVal_2497)))) is different from true [2022-11-25 18:19:16,892 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_node_create_#res#1.base| 0)) (exists ((v_ArrVal_2497 Int)) (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| v_ArrVal_2497)))) is different from true [2022-11-25 18:19:16,919 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:19:16,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-11-25 18:19:17,275 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:19:17,275 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 11 treesize of output 7 [2022-11-25 18:19:17,444 INFO L321 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-11-25 18:19:17,444 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 18:19:17,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:19:18,177 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:19:18,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 21 [2022-11-25 18:19:18,183 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 7 treesize of output 3 [2022-11-25 18:19:18,655 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:18,668 INFO L321 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2022-11-25 18:19:18,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 43 [2022-11-25 18:19:18,685 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 18:19:18,685 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 15 treesize of output 15 [2022-11-25 18:19:18,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:18,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2022-11-25 18:19:19,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:19,144 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:19:19,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:19,157 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 18:19:19,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 43 [2022-11-25 18:19:19,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:19,178 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-25 18:19:19,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:19,393 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:19:19,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 40 [2022-11-25 18:19:19,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:19,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2022-11-25 18:19:19,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:19,922 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-11-25 18:19:19,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 16 [2022-11-25 18:19:20,550 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:19:20,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:20,564 INFO L321 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-11-25 18:19:20,565 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 79 treesize of output 34 [2022-11-25 18:19:20,763 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 10 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2022-11-25 18:19:20,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:19:22,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446182312] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:19:22,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:19:22,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37] total 67 [2022-11-25 18:19:22,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851462021] [2022-11-25 18:19:22,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:19:22,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-11-25 18:19:22,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:19:22,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-11-25 18:19:22,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=5457, Unknown=2, NotChecked=298, Total=6006 [2022-11-25 18:19:22,897 INFO L87 Difference]: Start difference. First operand 74 states and 80 transitions. Second operand has 67 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 58 states have internal predecessors, (100), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:19:32,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:19:32,072 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2022-11-25 18:19:32,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-25 18:19:32,073 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 58 states have internal predecessors, (100), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 60 [2022-11-25 18:19:32,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:19:32,074 INFO L225 Difference]: With dead ends: 93 [2022-11-25 18:19:32,074 INFO L226 Difference]: Without dead ends: 93 [2022-11-25 18:19:32,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 109 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2827 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=913, Invalid=10865, Unknown=2, NotChecked=430, Total=12210 [2022-11-25 18:19:32,076 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 454 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 1941 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 2158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 181 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-25 18:19:32,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1031 Invalid, 2158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1941 Invalid, 0 Unknown, 181 Unchecked, 1.9s Time] [2022-11-25 18:19:32,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-25 18:19:32,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 74. [2022-11-25 18:19:32,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 69 states have internal predecessors, (73), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 18:19:32,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2022-11-25 18:19:32,080 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 60 [2022-11-25 18:19:32,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:19:32,080 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2022-11-25 18:19:32,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 65 states have (on average 1.5384615384615385) internal successors, (100), 58 states have internal predecessors, (100), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:19:32,080 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2022-11-25 18:19:32,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-25 18:19:32,081 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:19:32,081 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:19:32,095 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 18:19:32,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-25 18:19:32,282 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:19:32,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:19:32,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1512551826, now seen corresponding path program 2 times [2022-11-25 18:19:32,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:19:32,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265454166] [2022-11-25 18:19:32,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:19:32,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:19:32,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:35,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:19:35,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:36,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:19:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:36,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 18:19:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:19:37,746 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:19:37,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:19:37,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265454166] [2022-11-25 18:19:37,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265454166] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:19:37,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [421918292] [2022-11-25 18:19:37,747 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:19:37,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:19:37,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:19:37,748 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:19:37,751 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 18:19:38,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 18:19:38,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:19:38,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 464 conjuncts, 190 conjunts are in the unsatisfiable core [2022-11-25 18:19:38,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:19:38,069 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-11-25 18:19:38,182 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 18:19:38,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:19:38,665 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-25 18:19:38,665 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-11-25 18:19:38,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:38,942 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 18:19:39,235 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 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:19:39,825 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:19:39,825 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 18:19:39,839 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 18:19:39,875 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-25 18:19:39,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-25 18:19:40,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-25 18:19:40,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-11-25 18:19:40,216 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-11-25 18:19:41,070 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:19:41,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 35 [2022-11-25 18:19:41,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 5 treesize of output 3 [2022-11-25 18:19:41,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-11-25 18:19:41,214 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-11-25 18:19:42,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:42,046 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-11-25 18:19:42,046 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 66 [2022-11-25 18:19:42,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:42,074 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-11-25 18:19:42,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 38 [2022-11-25 18:19:42,108 INFO L321 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-11-25 18:19:42,109 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 15 treesize of output 15 [2022-11-25 18:19:42,134 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-25 18:19:42,135 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 36 [2022-11-25 18:19:42,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 18:19:42,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:42,914 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:19:42,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:42,929 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-11-25 18:19:42,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 100 treesize of output 61 [2022-11-25 18:19:42,965 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2022-11-25 18:19:42,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 48 [2022-11-25 18:19:42,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:42,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:42,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2022-11-25 18:19:43,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:43,322 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-25 18:19:43,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 58 [2022-11-25 18:19:43,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:43,334 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:43,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 43 [2022-11-25 18:19:43,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 48 [2022-11-25 18:19:46,723 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:19:46,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:46,758 INFO L321 Elim1Store]: treesize reduction 58, result has 21.6 percent of original size [2022-11-25 18:19:46,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 194 treesize of output 104 [2022-11-25 18:19:46,769 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:19:46,789 INFO L321 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2022-11-25 18:19:46,789 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 39 [2022-11-25 18:19:47,844 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:19:47,845 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 13 treesize of output 17 [2022-11-25 18:19:48,085 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 15 treesize of output 7 [2022-11-25 18:19:48,245 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 9 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 18:19:48,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:19:53,911 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 706 treesize of output 562 [2022-11-25 18:20:00,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [421918292] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:20:00,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:20:00,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 42] total 79 [2022-11-25 18:20:00,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254571536] [2022-11-25 18:20:00,154 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:20:00,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-11-25 18:20:00,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:00,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-11-25 18:20:00,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=8831, Unknown=14, NotChecked=0, Total=9120 [2022-11-25 18:20:00,159 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 79 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 69 states have internal predecessors, (112), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:20:21,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:20:21,892 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2022-11-25 18:20:21,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-11-25 18:20:21,893 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 69 states have internal predecessors, (112), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 63 [2022-11-25 18:20:21,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:20:21,893 INFO L225 Difference]: With dead ends: 91 [2022-11-25 18:20:21,894 INFO L226 Difference]: Without dead ends: 91 [2022-11-25 18:20:21,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2394 ImplicationChecksByTransitivity, 36.7s TimeCoverageRelationStatistics Valid=960, Invalid=16054, Unknown=16, NotChecked=0, Total=17030 [2022-11-25 18:20:21,896 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 569 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 3295 mSolverCounterSat, 49 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 1154 SdHoareTripleChecker+Invalid, 3346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 3295 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:20:21,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 1154 Invalid, 3346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 3295 Invalid, 2 Unknown, 0 Unchecked, 5.5s Time] [2022-11-25 18:20:21,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-25 18:20:21,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 75. [2022-11-25 18:20:21,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 61 states have (on average 1.2131147540983607) internal successors, (74), 70 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 18:20:21,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2022-11-25 18:20:21,899 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 63 [2022-11-25 18:20:21,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:20:21,900 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2022-11-25 18:20:21,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 69 states have internal predecessors, (112), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 18:20:21,900 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2022-11-25 18:20:21,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-25 18:20:21,901 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:20:21,901 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:20:21,909 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 18:20:22,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:20:22,102 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:20:22,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:20:22,103 INFO L85 PathProgramCache]: Analyzing trace with hash -355533194, now seen corresponding path program 3 times [2022-11-25 18:20:22,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:20:22,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241137645] [2022-11-25 18:20:22,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:20:22,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:20:22,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:25,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:20:25,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:26,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:20:26,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:26,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 18:20:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:20:27,561 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 36 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-25 18:20:27,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:20:27,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241137645] [2022-11-25 18:20:27,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241137645] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:20:27,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2066723930] [2022-11-25 18:20:27,561 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:20:27,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:20:27,562 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:20:27,563 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:20:27,586 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 18:20:28,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-25 18:20:28,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:20:28,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 190 conjunts are in the unsatisfiable core [2022-11-25 18:20:28,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:20:28,627 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-11-25 18:20:28,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-11-25 18:20:29,017 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-25 18:20:29,017 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-11-25 18:20:29,242 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-11-25 18:20:29,254 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-11-25 18:20:30,103 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 18:20:30,103 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-25 18:20:30,134 INFO L321 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-11-25 18:20:30,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2022-11-25 18:20:30,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-25 18:20:30,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-11-25 18:20:30,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2022-11-25 18:20:31,282 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-25 18:20:31,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 101 treesize of output 47 [2022-11-25 18:20:31,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:31,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-11-25 18:20:31,299 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 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-25 18:20:31,889 INFO L321 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-11-25 18:20:31,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-11-25 18:20:32,314 WARN L837 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (<= (+ 2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse0 (<= (+ 2 .cse2) |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse2))) (.cse3 (not (= .cse6 .cse2))) (.cse4 (not (= .cse6 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))) (.cse5 (= (select (select |c_#memory_$Pointer$.base| .cse6) 4) 0)) (.cse7 (not (= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (or (and .cse0 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) .cse1 (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) .cse3 .cse4 .cse5 (= (select (select |c_#memory_$Pointer$.offset| .cse6) 4) 0) .cse7) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse11 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse9 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_#memory_$Pointer$.base|)) (.cse10 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse9) 4))) (and (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse8 (select |c_#memory_$Pointer$.base| .cse8))) (not (= .cse9 .cse10)) (<= (+ .cse9 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse9) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse10) 4) 0) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse10) 4) 0) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse8) (not (= .cse10 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse9 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))))) (= .cse11 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse11 (select |c_#memory_$Pointer$.offset| .cse11))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) (and .cse0 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse12 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (= .cse12 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse2) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse6) 4) 0) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse12 (select |c_#memory_$Pointer$.offset| .cse12))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) .cse1 .cse3 .cse4 .cse5 .cse7)))))) is different from false [2022-11-25 18:20:32,322 WARN L859 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (<= (+ 2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse2) 4))) (let ((.cse0 (<= (+ 2 .cse2) |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse1 (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse2))) (.cse3 (not (= .cse6 .cse2))) (.cse4 (not (= .cse6 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|))) (.cse5 (= (select (select |c_#memory_$Pointer$.base| .cse6) 4) 0)) (.cse7 (not (= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (or (and .cse0 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) .cse1 (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) .cse3 .cse4 .cse5 (= (select (select |c_#memory_$Pointer$.offset| .cse6) 4) 0) .cse7) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse11 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse9 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse8 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_#memory_$Pointer$.base|)) (.cse10 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse9) 4))) (and (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse8 (select |c_#memory_$Pointer$.base| .cse8))) (not (= .cse9 .cse10)) (<= (+ .cse9 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse9) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse10) 4) 0) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse10) 4) 0) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse8) (not (= .cse10 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse10 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse9 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))))) (= .cse11 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse11 (select |c_#memory_$Pointer$.offset| .cse11))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) (and .cse0 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse12 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (= .cse12 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse2) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse6) 4) 0) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse12 (select |c_#memory_$Pointer$.offset| .cse12))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) .cse1 .cse3 .cse4 .cse5 .cse7)))))) is different from true [2022-11-25 18:20:32,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:32,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:32,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 52 [2022-11-25 18:20:32,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:32,862 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:20:32,885 INFO L321 Elim1Store]: treesize reduction 64, result has 19.0 percent of original size [2022-11-25 18:20:32,886 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 116 treesize of output 75 [2022-11-25 18:20:33,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:33,187 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:33,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:33,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 53 [2022-11-25 18:20:33,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:33,228 INFO L321 Elim1Store]: treesize reduction 96, result has 13.5 percent of original size [2022-11-25 18:20:33,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 113 treesize of output 72 [2022-11-25 18:20:36,949 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 18:20:37,027 INFO L321 Elim1Store]: treesize reduction 218, result has 6.0 percent of original size [2022-11-25 18:20:37,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 13 new quantified variables, introduced 21 case distinctions, treesize of input 246 treesize of output 113 [2022-11-25 18:20:37,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:37,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:20:37,061 INFO L321 Elim1Store]: treesize reduction 15, result has 40.0 percent of original size [2022-11-25 18:20:37,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 6 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 36 [2022-11-25 18:20:37,283 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 17 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 18:20:37,283 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:20:55,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2066723930] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:20:55,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 18:20:55,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 74 [2022-11-25 18:20:55,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540915058] [2022-11-25 18:20:55,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 18:20:55,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2022-11-25 18:20:55,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:20:55,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2022-11-25 18:20:55,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=7375, Unknown=6, NotChecked=172, Total=7832 [2022-11-25 18:20:55,866 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 74 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 65 states have internal predecessors, (103), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-25 18:20:59,996 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse13 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse6) 4)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse13)) (.cse1 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (.cse7 (= (select (select |c_#memory_$Pointer$.offset| .cse3) 4) 0)) (.cse12 (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0)) (.cse8 (not (= .cse4 .cse3))) (.cse11 (= (select (select |c_#memory_$Pointer$.base| .cse4) 4) 0)) (.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10)) (.cse17 (not (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) .cse1 (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (<= (+ 1 .cse3) |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| .cse2) 4) 0) (= (select |c_#valid| .cse4) 1) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse5)) (not (= .cse6 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse2)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) .cse7 (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) .cse8 (not (= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse11 (= (select (select |c_#memory_$Pointer$.base| .cse9) 4) 0) (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse9)) (= (select (select |c_#memory_$Pointer$.offset| .cse5) 4) 0) (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$.base| .cse5) 4) 0) (= (select |c_#valid| .cse3) 1) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ 2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse5) 1) (= (select (select |c_#memory_$Pointer$.base| .cse0) 4) 0) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) .cse12 (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| .cse6)) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse13) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse6) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|) (let ((.cse14 (<= (+ 2 .cse3) |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse15 (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse3))) (.cse16 (not (= .cse4 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))) (or (and .cse14 .cse1 .cse15 .cse7 .cse8 .cse16 .cse11 .cse12 .cse17) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse21 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse19 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse18 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_#memory_$Pointer$.base|)) (.cse20 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse19) 4))) (and (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse18 (select |c_#memory_$Pointer$.base| .cse18))) (not (= .cse19 .cse20)) (<= (+ .cse19 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse19) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse20) 4) 0) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse20) 4) 0) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse18) (not (= .cse20 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse19 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))))) (= .cse21 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse21 (select |c_#memory_$Pointer$.offset| .cse21))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) (and .cse14 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse22 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (= .cse22 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse3) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse4) 4) 0) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse22 (select |c_#memory_$Pointer$.offset| .cse22))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) .cse15 .cse8 .cse16 .cse11 .cse17))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse9) 4) 0) (<= (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_sll_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| .cse9) 1) .cse17 (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))))) is different from false [2022-11-25 18:21:00,012 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 4)) (.cse4 (select (select |c_#memory_$Pointer$.base| .cse3) 4)) (.cse13 (+ 4 |c_ULTIMATE.start_sll_create_~head~0#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse6) 4)) (.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_#res#1.base|) 4)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse13)) (.cse1 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)) (.cse7 (= (select (select |c_#memory_$Pointer$.offset| .cse3) 4) 0)) (.cse12 (= (select (select |c_#memory_$Pointer$.offset| .cse4) 4) 0)) (.cse8 (not (= .cse4 .cse3))) (.cse11 (= (select (select |c_#memory_$Pointer$.base| .cse4) 4) 0)) (.cse9 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10)) (.cse17 (not (= .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|)))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_#res#1.base|) 4) 0) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_#res#1.base|) 1) (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_create_~new_head~0#1.offset| 0) .cse1 (= (select (select |c_#memory_$Pointer$.offset| .cse2) 4) 0) (<= (+ 1 .cse3) |c_#StackHeapBarrier|) (= (select (select |c_#memory_$Pointer$.base| .cse2) 4) 0) (= (select |c_#valid| .cse4) 1) (not (= |c_ULTIMATE.start_sll_create_#res#1.base| .cse5)) (not (= .cse6 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse2)) (= |c_ULTIMATE.start_sll_create_#res#1.offset| 0) .cse7 (<= (+ |c_ULTIMATE.start_sll_create_~head~0#1.base| 1) |c_#StackHeapBarrier|) .cse8 (not (= .cse9 |c_ULTIMATE.start_main_~#s~0#1.base|)) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) .cse10) 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~head~0#1.base|) 1) .cse11 (= (select (select |c_#memory_$Pointer$.base| .cse9) 4) 0) (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse5 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_sll_create_~new_head~0#1.base| .cse9)) (= (select (select |c_#memory_$Pointer$.offset| .cse5) 4) 0) (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| .cse2)) (= (select (select |c_#memory_$Pointer$.base| .cse5) 4) 0) (= (select |c_#valid| .cse3) 1) (not (= .cse0 |c_ULTIMATE.start_sll_create_~head~0#1.base|)) (<= (+ 2 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| .cse5) 1) (= (select (select |c_#memory_$Pointer$.base| .cse0) 4) 0) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) .cse12 (not (= |c_ULTIMATE.start_sll_prepend_~head#1.base| .cse6)) (= |c_ULTIMATE.start_sll_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_create_~head~0#1.base|) .cse13) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse6) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| .cse0) 4) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_prepend_~head#1.base|) |c_ULTIMATE.start_sll_prepend_~head#1.offset|) |c_ULTIMATE.start_sll_prepend_#t~ret7#1.offset|) (let ((.cse14 (<= (+ 2 .cse3) |c_ULTIMATE.start_main_~#s~0#1.base|)) (.cse15 (not (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse3))) (.cse16 (not (= .cse4 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))) (or (and .cse14 .cse1 .cse15 .cse7 .cse8 .cse16 .cse11 .cse12 .cse17) (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse21 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (exists ((|v_old(#memory_$Pointer$.base)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse19 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse18 (@diff |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| |c_#memory_$Pointer$.base|)) (.cse20 (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse19) 4))) (and (= |c_#memory_$Pointer$.base| (store |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse18 (select |c_#memory_$Pointer$.base| .cse18))) (not (= .cse19 .cse20)) (<= (+ .cse19 2) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse19) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse20) 4) 0) (= (select (select |v_old(#memory_$Pointer$.base)_AFTER_CALL_32| .cse20) 4) 0) (= |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base| .cse18) (not (= .cse20 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)) (not (= .cse20 |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= .cse19 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|)))))) (= .cse21 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse21 (select |c_#memory_$Pointer$.offset| .cse21))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) (and .cse14 (exists ((|v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| (Array Int (Array Int Int)))) (let ((.cse22 (@diff |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_#memory_$Pointer$.offset|))) (and (= .cse22 |c_ULTIMATE.start_sll_prepend_#t~ret7#1.base|) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse3) 4) 0) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse4) 4) 0) (= |c_#memory_$Pointer$.offset| (store |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| .cse22 (select |c_#memory_$Pointer$.offset| .cse22))) (= (select (select |v_old(#memory_$Pointer$.offset)_AFTER_CALL_32| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) .cse15 .cse8 .cse16 .cse11 .cse17))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select (select |c_#memory_$Pointer$.offset| .cse9) 4) 0) (<= (+ |c_ULTIMATE.start_sll_create_~new_head~0#1.base| 1) |c_#StackHeapBarrier|) (<= (+ |c_ULTIMATE.start_sll_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_ULTIMATE.start_sll_create_~head~0#1.offset| 0) (= (select |c_#valid| .cse9) 1) .cse17 (= (select |c_#valid| |c_ULTIMATE.start_sll_create_~new_head~0#1.base|) 1))))) is different from true [2022-11-25 18:21:09,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:21:09,898 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2022-11-25 18:21:09,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-25 18:21:09,899 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 65 states have internal predecessors, (103), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 64 [2022-11-25 18:21:09,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:21:09,900 INFO L225 Difference]: With dead ends: 132 [2022-11-25 18:21:09,900 INFO L226 Difference]: Without dead ends: 132 [2022-11-25 18:21:09,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 39 SyntacticMatches, 10 SemanticMatches, 115 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3385 ImplicationChecksByTransitivity, 35.0s TimeCoverageRelationStatistics Valid=587, Invalid=12523, Unknown=8, NotChecked=454, Total=13572 [2022-11-25 18:21:09,902 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 226 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 2567 mSolverCounterSat, 25 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1541 SdHoareTripleChecker+Invalid, 2710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2567 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:21:09,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1541 Invalid, 2710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2567 Invalid, 1 Unknown, 117 Unchecked, 5.2s Time] [2022-11-25 18:21:09,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-11-25 18:21:09,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 108. [2022-11-25 18:21:09,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 92 states have (on average 1.1521739130434783) internal successors, (106), 101 states have internal predecessors, (106), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 18:21:09,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2022-11-25 18:21:09,913 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 64 [2022-11-25 18:21:09,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:21:09,913 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2022-11-25 18:21:09,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 72 states have (on average 1.4305555555555556) internal successors, (103), 65 states have internal predecessors, (103), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-11-25 18:21:09,914 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2022-11-25 18:21:09,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-11-25 18:21:09,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:21:09,915 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:21:09,933 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 18:21:10,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-25 18:21:10,134 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:21:10,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:10,134 INFO L85 PathProgramCache]: Analyzing trace with hash 1863371548, now seen corresponding path program 3 times [2022-11-25 18:21:10,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:10,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263811775] [2022-11-25 18:21:10,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:10,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:10,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:21:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:10,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:21:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:10,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 18:21:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:10,397 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-25 18:21:10,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:10,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263811775] [2022-11-25 18:21:10,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263811775] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:21:10,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [842382180] [2022-11-25 18:21:10,397 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 18:21:10,397 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:21:10,398 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:21:10,399 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:21:10,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 18:21:11,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-25 18:21:11,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:21:11,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 18:21:11,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:21:11,806 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-25 18:21:11,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:21:12,036 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2022-11-25 18:21:12,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [842382180] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:21:12,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:21:12,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 13 [2022-11-25 18:21:12,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78308369] [2022-11-25 18:21:12,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:21:12,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-25 18:21:12,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:12,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-25 18:21:12,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:21:12,040 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 18:21:12,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:21:12,218 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2022-11-25 18:21:12,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:21:12,219 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 65 [2022-11-25 18:21:12,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:21:12,221 INFO L225 Difference]: With dead ends: 119 [2022-11-25 18:21:12,221 INFO L226 Difference]: Without dead ends: 119 [2022-11-25 18:21:12,221 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:21:12,222 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 39 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:21:12,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 454 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:21:12,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-25 18:21:12,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2022-11-25 18:21:12,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 94 states have (on average 1.1595744680851063) internal successors, (109), 103 states have internal predecessors, (109), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 18:21:12,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2022-11-25 18:21:12,227 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 65 [2022-11-25 18:21:12,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:21:12,228 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2022-11-25 18:21:12,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-25 18:21:12,228 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2022-11-25 18:21:12,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-25 18:21:12,229 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:21:12,229 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:21:12,246 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-25 18:21:12,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:21:12,444 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:21:12,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:12,445 INFO L85 PathProgramCache]: Analyzing trace with hash -749426673, now seen corresponding path program 1 times [2022-11-25 18:21:12,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:12,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088447554] [2022-11-25 18:21:12,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:12,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:12,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:21:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:12,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:21:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:12,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 18:21:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:12,842 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2022-11-25 18:21:12,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:12,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088447554] [2022-11-25 18:21:12,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088447554] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:21:12,842 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:21:12,842 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:21:12,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501733659] [2022-11-25 18:21:12,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:21:12,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:21:12,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:12,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:21:12,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:21:12,844 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:21:13,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:21:13,152 INFO L93 Difference]: Finished difference Result 119 states and 129 transitions. [2022-11-25 18:21:13,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 18:21:13,152 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 68 [2022-11-25 18:21:13,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:21:13,153 INFO L225 Difference]: With dead ends: 119 [2022-11-25 18:21:13,154 INFO L226 Difference]: Without dead ends: 119 [2022-11-25 18:21:13,154 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-25 18:21:13,155 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 111 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:21:13,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 207 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:21:13,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-25 18:21:13,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2022-11-25 18:21:13,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 104 states have internal predecessors, (112), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 18:21:13,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 122 transitions. [2022-11-25 18:21:13,161 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 122 transitions. Word has length 68 [2022-11-25 18:21:13,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:21:13,162 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 122 transitions. [2022-11-25 18:21:13,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.333333333333333) internal successors, (39), 9 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:21:13,162 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 122 transitions. [2022-11-25 18:21:13,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-25 18:21:13,163 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:21:13,163 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:21:13,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-25 18:21:13,163 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:21:13,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:13,163 INFO L85 PathProgramCache]: Analyzing trace with hash -749426672, now seen corresponding path program 1 times [2022-11-25 18:21:13,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:13,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81981606] [2022-11-25 18:21:13,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:13,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:13,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:13,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:21:13,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:13,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:21:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:13,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 18:21:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:13,690 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-25 18:21:13,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:13,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81981606] [2022-11-25 18:21:13,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81981606] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:21:13,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:21:13,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:21:13,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912974494] [2022-11-25 18:21:13,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:21:13,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:21:13,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:13,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:21:13,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:21:13,693 INFO L87 Difference]: Start difference. First operand 111 states and 122 transitions. Second operand has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:21:13,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:21:13,999 INFO L93 Difference]: Finished difference Result 119 states and 128 transitions. [2022-11-25 18:21:14,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 18:21:14,000 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 68 [2022-11-25 18:21:14,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:21:14,001 INFO L225 Difference]: With dead ends: 119 [2022-11-25 18:21:14,001 INFO L226 Difference]: Without dead ends: 119 [2022-11-25 18:21:14,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:21:14,002 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 133 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:21:14,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 197 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:21:14,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-25 18:21:14,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2022-11-25 18:21:14,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 98 states have (on average 1.153061224489796) internal successors, (113), 106 states have internal predecessors, (113), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 18:21:14,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 123 transitions. [2022-11-25 18:21:14,017 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 123 transitions. Word has length 68 [2022-11-25 18:21:14,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:21:14,019 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 123 transitions. [2022-11-25 18:21:14,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.555555555555555) internal successors, (41), 9 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:21:14,019 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 123 transitions. [2022-11-25 18:21:14,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-25 18:21:14,022 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:21:14,022 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:21:14,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-25 18:21:14,023 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:21:14,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:14,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1757391830, now seen corresponding path program 1 times [2022-11-25 18:21:14,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:14,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823201713] [2022-11-25 18:21:14,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:14,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:14,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:21:14,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:14,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:21:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:14,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 18:21:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:14,279 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-25 18:21:14,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:14,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823201713] [2022-11-25 18:21:14,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823201713] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:21:14,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:21:14,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-25 18:21:14,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066117397] [2022-11-25 18:21:14,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:21:14,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:21:14,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:14,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:21:14,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:21:14,282 INFO L87 Difference]: Start difference. First operand 113 states and 123 transitions. Second operand has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:21:14,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:21:14,486 INFO L93 Difference]: Finished difference Result 116 states and 125 transitions. [2022-11-25 18:21:14,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:21:14,486 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 69 [2022-11-25 18:21:14,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:21:14,487 INFO L225 Difference]: With dead ends: 116 [2022-11-25 18:21:14,487 INFO L226 Difference]: Without dead ends: 116 [2022-11-25 18:21:14,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:21:14,488 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 90 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:21:14,488 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 268 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:21:14,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-11-25 18:21:14,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2022-11-25 18:21:14,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 98 states have (on average 1.1428571428571428) internal successors, (112), 106 states have internal predecessors, (112), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 18:21:14,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2022-11-25 18:21:14,492 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 69 [2022-11-25 18:21:14,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:21:14,493 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2022-11-25 18:21:14,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.2) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:21:14,493 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2022-11-25 18:21:14,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-25 18:21:14,493 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:21:14,494 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:21:14,494 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-25 18:21:14,494 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:21:14,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:14,495 INFO L85 PathProgramCache]: Analyzing trace with hash -929953077, now seen corresponding path program 1 times [2022-11-25 18:21:14,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:14,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891805168] [2022-11-25 18:21:14,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:14,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:14,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:21:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:14,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:21:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:14,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 18:21:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:14,786 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-25 18:21:14,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:14,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891805168] [2022-11-25 18:21:14,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891805168] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:21:14,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:21:14,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:21:14,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021478589] [2022-11-25 18:21:14,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:21:14,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:21:14,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:21:14,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:21:14,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:21:14,789 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:21:15,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:21:15,009 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2022-11-25 18:21:15,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 18:21:15,010 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 71 [2022-11-25 18:21:15,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:21:15,011 INFO L225 Difference]: With dead ends: 114 [2022-11-25 18:21:15,011 INFO L226 Difference]: Without dead ends: 114 [2022-11-25 18:21:15,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:21:15,012 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 114 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:21:15,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 227 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:21:15,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-25 18:21:15,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2022-11-25 18:21:15,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 99 states have (on average 1.1414141414141414) internal successors, (113), 107 states have internal predecessors, (113), 5 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 18:21:15,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 123 transitions. [2022-11-25 18:21:15,018 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 123 transitions. Word has length 71 [2022-11-25 18:21:15,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:21:15,019 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 123 transitions. [2022-11-25 18:21:15,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 4.888888888888889) internal successors, (44), 9 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 18:21:15,019 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2022-11-25 18:21:15,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-25 18:21:15,020 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:21:15,020 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:21:15,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-25 18:21:15,020 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 24 more)] === [2022-11-25 18:21:15,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:21:15,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1692934892, now seen corresponding path program 1 times [2022-11-25 18:21:15,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:21:15,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137561384] [2022-11-25 18:21:15,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:15,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:21:15,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:16,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:21:16,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:16,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-25 18:21:16,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:16,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-11-25 18:21:16,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 18 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-25 18:21:16,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:21:16,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137561384] [2022-11-25 18:21:16,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137561384] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:21:16,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837781567] [2022-11-25 18:21:16,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:21:16,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:21:16,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:21:16,711 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:21:16,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f5fa3c8-629d-4113-aa57-36d18468daa2/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 18:21:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:21:17,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 82 conjunts are in the unsatisfiable core [2022-11-25 18:21:17,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:21:17,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-25 18:21:17,549 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 11 treesize of output 7 [2022-11-25 18:21:18,946 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 18:21:18,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 114 [2022-11-25 18:21:21,406 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 325 treesize of output 269 [2022-11-25 18:21:22,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 18:21:24,053 INFO L321 Elim1Store]: treesize reduction 72, result has 90.9 percent of original size [2022-11-25 18:21:24,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 1 disjoint index pairs (out of 78 index pairs), introduced 22 new quantified variables, introduced 78 case distinctions, treesize of input 347 treesize of output 848