./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/forester-heap/dll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5237d83 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_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-token-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a --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 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 --- 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-b5237d8 [2022-11-21 17:24:53,269 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 17:24:53,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 17:24:53,309 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 17:24:53,310 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 17:24:53,317 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 17:24:53,320 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 17:24:53,322 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 17:24:53,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 17:24:53,326 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 17:24:53,328 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 17:24:53,329 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 17:24:53,330 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 17:24:53,332 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 17:24:53,333 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 17:24:53,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 17:24:53,344 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 17:24:53,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 17:24:53,359 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 17:24:53,364 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 17:24:53,366 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 17:24:53,374 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 17:24:53,376 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 17:24:53,377 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 17:24:53,381 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 17:24:53,382 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 17:24:53,382 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 17:24:53,383 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 17:24:53,384 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 17:24:53,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 17:24:53,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 17:24:53,386 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 17:24:53,397 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 17:24:53,398 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 17:24:53,400 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 17:24:53,400 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 17:24:53,401 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 17:24:53,402 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 17:24:53,402 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 17:24:53,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 17:24:53,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 17:24:53,407 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-21 17:24:53,462 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 17:24:53,462 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 17:24:53,462 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 17:24:53,467 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 17:24:53,468 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 17:24:53,468 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 17:24:53,469 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 17:24:53,469 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 17:24:53,470 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 17:24:53,470 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 17:24:53,470 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 17:24:53,470 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-21 17:24:53,471 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 17:24:53,471 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 17:24:53,471 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 17:24:53,471 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-21 17:24:53,472 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-21 17:24:53,472 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-21 17:24:53,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 17:24:53,472 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-21 17:24:53,473 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 17:24:53,473 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 17:24:53,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 17:24:53,473 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 17:24:53,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 17:24:53,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:24:53,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 17:24:53,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 17:24:53,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 17:24:53,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 17:24:53,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/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_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a 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 -> 26e745e5a6378d1005b5b65d8cf35b442871742f5efbed2506d4a18acf4ab9a5 [2022-11-21 17:24:53,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 17:24:53,933 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 17:24:53,937 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 17:24:53,940 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 17:24:53,940 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 17:24:53,942 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/forester-heap/dll-token-1.i [2022-11-21 17:24:57,884 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 17:24:58,227 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 17:24:58,227 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/sv-benchmarks/c/forester-heap/dll-token-1.i [2022-11-21 17:24:58,251 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/data/292a23606/e0875a7bb13044ab8518617022edd2aa/FLAGb9bd8f0c3 [2022-11-21 17:24:58,277 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/data/292a23606/e0875a7bb13044ab8518617022edd2aa [2022-11-21 17:24:58,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 17:24:58,288 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 17:24:58,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 17:24:58,293 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 17:24:58,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 17:24:58,299 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:24:58" (1/1) ... [2022-11-21 17:24:58,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@519513b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:24:58, skipping insertion in model container [2022-11-21 17:24:58,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:24:58" (1/1) ... [2022-11-21 17:24:58,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 17:24:58,354 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 17:24:58,782 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_8bc4310b-922b-4622-a0dd-6849d44f826c/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2022-11-21 17:24:58,791 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_8bc4310b-922b-4622-a0dd-6849d44f826c/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2022-11-21 17:24:58,793 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_8bc4310b-922b-4622-a0dd-6849d44f826c/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2022-11-21 17:24:58,794 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_8bc4310b-922b-4622-a0dd-6849d44f826c/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2022-11-21 17:24:58,796 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_8bc4310b-922b-4622-a0dd-6849d44f826c/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2022-11-21 17:24:58,800 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_8bc4310b-922b-4622-a0dd-6849d44f826c/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2022-11-21 17:24:58,804 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:24:58,817 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 17:24:58,859 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_8bc4310b-922b-4622-a0dd-6849d44f826c/sv-benchmarks/c/forester-heap/dll-token-1.i[22229,22242] [2022-11-21 17:24:58,862 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_8bc4310b-922b-4622-a0dd-6849d44f826c/sv-benchmarks/c/forester-heap/dll-token-1.i[22398,22411] [2022-11-21 17:24:58,863 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_8bc4310b-922b-4622-a0dd-6849d44f826c/sv-benchmarks/c/forester-heap/dll-token-1.i[22489,22502] [2022-11-21 17:24:58,865 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_8bc4310b-922b-4622-a0dd-6849d44f826c/sv-benchmarks/c/forester-heap/dll-token-1.i[22571,22584] [2022-11-21 17:24:58,867 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_8bc4310b-922b-4622-a0dd-6849d44f826c/sv-benchmarks/c/forester-heap/dll-token-1.i[22649,22662] [2022-11-21 17:24:58,869 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_8bc4310b-922b-4622-a0dd-6849d44f826c/sv-benchmarks/c/forester-heap/dll-token-1.i[22795,22808] [2022-11-21 17:24:58,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:24:58,904 INFO L208 MainTranslator]: Completed translation [2022-11-21 17:24:58,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:24:58 WrapperNode [2022-11-21 17:24:58,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 17:24:58,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 17:24:58,907 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 17:24:58,907 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 17:24:58,917 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:24:58" (1/1) ... [2022-11-21 17:24:58,933 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:24:58" (1/1) ... [2022-11-21 17:24:58,969 INFO L138 Inliner]: procedures = 119, calls = 36, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 139 [2022-11-21 17:24:58,975 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 17:24:58,976 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 17:24:58,977 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 17:24:58,977 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 17:24:58,989 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:24:58" (1/1) ... [2022-11-21 17:24:58,989 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:24:58" (1/1) ... [2022-11-21 17:24:58,994 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:24:58" (1/1) ... [2022-11-21 17:24:58,994 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:24:58" (1/1) ... [2022-11-21 17:24:59,004 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:24:58" (1/1) ... [2022-11-21 17:24:59,025 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:24:58" (1/1) ... [2022-11-21 17:24:59,028 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:24:58" (1/1) ... [2022-11-21 17:24:59,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:24:58" (1/1) ... [2022-11-21 17:24:59,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 17:24:59,034 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 17:24:59,034 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 17:24:59,035 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 17:24:59,036 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:24:58" (1/1) ... [2022-11-21 17:24:59,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:24:59,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:24:59,100 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 17:24:59,102 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 17:24:59,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 17:24:59,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 17:24:59,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 17:24:59,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 17:24:59,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 17:24:59,163 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 17:24:59,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 17:24:59,163 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 17:24:59,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 17:24:59,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 17:24:59,315 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 17:24:59,318 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 17:24:59,966 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 17:24:59,975 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 17:24:59,976 INFO L300 CfgBuilder]: Removed 15 assume(true) statements. [2022-11-21 17:24:59,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:24:59 BoogieIcfgContainer [2022-11-21 17:24:59,979 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 17:24:59,982 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 17:24:59,982 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 17:24:59,987 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 17:24:59,987 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 05:24:58" (1/3) ... [2022-11-21 17:24:59,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634633b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:24:59, skipping insertion in model container [2022-11-21 17:24:59,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:24:58" (2/3) ... [2022-11-21 17:24:59,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634633b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:24:59, skipping insertion in model container [2022-11-21 17:24:59,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:24:59" (3/3) ... [2022-11-21 17:24:59,992 INFO L112 eAbstractionObserver]: Analyzing ICFG dll-token-1.i [2022-11-21 17:25:00,018 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 17:25:00,019 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2022-11-21 17:25:00,096 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 17:25:00,104 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3e0bc271, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 17:25:00,104 INFO L358 AbstractCegarLoop]: Starting to check reachability of 64 error locations. [2022-11-21 17:25:00,110 INFO L276 IsEmpty]: Start isEmpty. Operand has 136 states, 71 states have (on average 2.23943661971831) internal successors, (159), 135 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:00,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-21 17:25:00,119 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:00,120 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-21 17:25:00,121 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:25:00,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:00,129 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-11-21 17:25:00,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:00,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708274999] [2022-11-21 17:25:00,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:00,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:00,510 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-21 17:25:00,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:00,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708274999] [2022-11-21 17:25:00,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708274999] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:00,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:00,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:25:00,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308007862] [2022-11-21 17:25:00,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:00,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:25:00,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:00,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:25:00,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:25:00,594 INFO L87 Difference]: Start difference. First operand has 136 states, 71 states have (on average 2.23943661971831) internal successors, (159), 135 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:00,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:00,861 INFO L93 Difference]: Finished difference Result 153 states and 156 transitions. [2022-11-21 17:25:00,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:25:00,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-21 17:25:00,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:00,877 INFO L225 Difference]: With dead ends: 153 [2022-11-21 17:25:00,878 INFO L226 Difference]: Without dead ends: 151 [2022-11-21 17:25:00,880 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-21 17:25:00,884 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 110 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:00,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 103 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:25:00,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-21 17:25:00,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 131. [2022-11-21 17:25:00,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 70 states have (on average 1.9) internal successors, (133), 130 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:00,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 133 transitions. [2022-11-21 17:25:00,949 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 133 transitions. Word has length 3 [2022-11-21 17:25:00,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:00,950 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 133 transitions. [2022-11-21 17:25:00,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:00,951 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 133 transitions. [2022-11-21 17:25:00,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-21 17:25:00,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:00,951 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-21 17:25:00,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 17:25:00,952 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:25:00,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:00,953 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-11-21 17:25:00,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:00,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131788720] [2022-11-21 17:25:00,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:00,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:01,179 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-21 17:25:01,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:01,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131788720] [2022-11-21 17:25:01,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131788720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:01,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:01,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-21 17:25:01,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372678820] [2022-11-21 17:25:01,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:01,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:25:01,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:01,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:25:01,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-21 17:25:01,194 INFO L87 Difference]: Start difference. First operand 131 states and 133 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:01,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:01,403 INFO L93 Difference]: Finished difference Result 156 states and 158 transitions. [2022-11-21 17:25:01,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:25:01,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-21 17:25:01,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:01,406 INFO L225 Difference]: With dead ends: 156 [2022-11-21 17:25:01,406 INFO L226 Difference]: Without dead ends: 156 [2022-11-21 17:25:01,407 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-21 17:25:01,408 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 115 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:01,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 105 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:25:01,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-11-21 17:25:01,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2022-11-21 17:25:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 70 states have (on average 1.8571428571428572) internal successors, (130), 127 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:01,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 130 transitions. [2022-11-21 17:25:01,421 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 130 transitions. Word has length 3 [2022-11-21 17:25:01,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:01,422 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 130 transitions. [2022-11-21 17:25:01,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:01,422 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 130 transitions. [2022-11-21 17:25:01,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 17:25:01,423 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:01,423 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:01,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 17:25:01,424 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:25:01,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:01,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112020, now seen corresponding path program 1 times [2022-11-21 17:25:01,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:01,425 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025561269] [2022-11-21 17:25:01,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:01,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:01,787 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-21 17:25:01,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:01,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025561269] [2022-11-21 17:25:01,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025561269] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:01,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:01,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:25:01,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523098460] [2022-11-21 17:25:01,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:01,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:25:01,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:01,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:25:01,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:25:01,792 INFO L87 Difference]: Start difference. First operand 128 states and 130 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:02,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:02,219 INFO L93 Difference]: Finished difference Result 241 states and 245 transitions. [2022-11-21 17:25:02,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:25:02,221 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-21 17:25:02,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:02,223 INFO L225 Difference]: With dead ends: 241 [2022-11-21 17:25:02,223 INFO L226 Difference]: Without dead ends: 241 [2022-11-21 17:25:02,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:25:02,225 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 273 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:02,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 113 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 17:25:02,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-11-21 17:25:02,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 167. [2022-11-21 17:25:02,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 109 states have (on average 1.81651376146789) internal successors, (198), 166 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:02,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 198 transitions. [2022-11-21 17:25:02,244 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 198 transitions. Word has length 9 [2022-11-21 17:25:02,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:02,245 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 198 transitions. [2022-11-21 17:25:02,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:02,246 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 198 transitions. [2022-11-21 17:25:02,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-21 17:25:02,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:02,247 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:02,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 17:25:02,248 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:25:02,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:02,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112019, now seen corresponding path program 1 times [2022-11-21 17:25:02,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:02,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760497365] [2022-11-21 17:25:02,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:02,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:02,378 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-21 17:25:02,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:02,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760497365] [2022-11-21 17:25:02,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760497365] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:02,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:02,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:25:02,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580114593] [2022-11-21 17:25:02,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:02,385 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:25:02,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:02,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:25:02,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:25:02,387 INFO L87 Difference]: Start difference. First operand 167 states and 198 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:02,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:02,628 INFO L93 Difference]: Finished difference Result 157 states and 168 transitions. [2022-11-21 17:25:02,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:25:02,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-21 17:25:02,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:02,633 INFO L225 Difference]: With dead ends: 157 [2022-11-21 17:25:02,633 INFO L226 Difference]: Without dead ends: 157 [2022-11-21 17:25:02,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:25:02,645 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 184 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:02,645 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 74 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:25:02,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-11-21 17:25:02,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 152. [2022-11-21 17:25:02,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 109 states have (on average 1.5321100917431192) internal successors, (167), 151 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:02,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 167 transitions. [2022-11-21 17:25:02,666 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 167 transitions. Word has length 9 [2022-11-21 17:25:02,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:02,667 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 167 transitions. [2022-11-21 17:25:02,667 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:02,667 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 167 transitions. [2022-11-21 17:25:02,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 17:25:02,668 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:02,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:02,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 17:25:02,669 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:25:02,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:02,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2022-11-21 17:25:02,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:02,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246672015] [2022-11-21 17:25:02,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:02,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:02,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:03,059 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-21 17:25:03,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:03,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246672015] [2022-11-21 17:25:03,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246672015] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:03,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:03,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:25:03,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710816168] [2022-11-21 17:25:03,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:03,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:25:03,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:03,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:25:03,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:25:03,062 INFO L87 Difference]: Start difference. First operand 152 states and 167 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:03,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:03,315 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2022-11-21 17:25:03,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:25:03,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-21 17:25:03,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:03,318 INFO L225 Difference]: With dead ends: 151 [2022-11-21 17:25:03,318 INFO L226 Difference]: Without dead ends: 151 [2022-11-21 17:25:03,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:25:03,319 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 7 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 278 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.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:03,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 278 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:25:03,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-11-21 17:25:03,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2022-11-21 17:25:03,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 109 states have (on average 1.5137614678899083) internal successors, (165), 150 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:03,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 165 transitions. [2022-11-21 17:25:03,331 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 165 transitions. Word has length 12 [2022-11-21 17:25:03,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:03,331 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 165 transitions. [2022-11-21 17:25:03,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:03,332 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 165 transitions. [2022-11-21 17:25:03,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-21 17:25:03,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:03,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:03,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 17:25:03,334 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:25:03,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:03,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2022-11-21 17:25:03,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:03,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812370209] [2022-11-21 17:25:03,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:03,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:03,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:03,501 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-21 17:25:03,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:03,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812370209] [2022-11-21 17:25:03,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812370209] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:03,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:03,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:25:03,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136931396] [2022-11-21 17:25:03,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:03,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:25:03,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:03,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:25:03,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:25:03,505 INFO L87 Difference]: Start difference. First operand 151 states and 165 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:03,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:03,736 INFO L93 Difference]: Finished difference Result 150 states and 163 transitions. [2022-11-21 17:25:03,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:25:03,737 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-11-21 17:25:03,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:03,738 INFO L225 Difference]: With dead ends: 150 [2022-11-21 17:25:03,738 INFO L226 Difference]: Without dead ends: 150 [2022-11-21 17:25:03,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:25:03,740 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 8 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:03,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 283 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:25:03,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-21 17:25:03,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-11-21 17:25:03,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 109 states have (on average 1.4954128440366972) internal successors, (163), 149 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 163 transitions. [2022-11-21 17:25:03,748 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 163 transitions. Word has length 12 [2022-11-21 17:25:03,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:03,749 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 163 transitions. [2022-11-21 17:25:03,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:03,749 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 163 transitions. [2022-11-21 17:25:03,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 17:25:03,750 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:03,750 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:03,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 17:25:03,751 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:25:03,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:03,752 INFO L85 PathProgramCache]: Analyzing trace with hash -896738186, now seen corresponding path program 1 times [2022-11-21 17:25:03,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:03,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653502588] [2022-11-21 17:25:03,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:03,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:03,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:03,911 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-21 17:25:03,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:03,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653502588] [2022-11-21 17:25:03,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653502588] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:03,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:03,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:25:03,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062223008] [2022-11-21 17:25:03,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:03,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:25:03,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:03,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:25:03,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:25:03,915 INFO L87 Difference]: Start difference. First operand 150 states and 163 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:04,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:04,134 INFO L93 Difference]: Finished difference Result 149 states and 161 transitions. [2022-11-21 17:25:04,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:25:04,135 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 17:25:04,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:04,136 INFO L225 Difference]: With dead ends: 149 [2022-11-21 17:25:04,137 INFO L226 Difference]: Without dead ends: 149 [2022-11-21 17:25:04,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:25:04,138 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 12 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:04,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 275 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:25:04,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-21 17:25:04,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-11-21 17:25:04,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 109 states have (on average 1.4770642201834863) internal successors, (161), 148 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:04,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 161 transitions. [2022-11-21 17:25:04,145 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 161 transitions. Word has length 14 [2022-11-21 17:25:04,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:04,146 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 161 transitions. [2022-11-21 17:25:04,146 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:04,147 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 161 transitions. [2022-11-21 17:25:04,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-21 17:25:04,160 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:04,160 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:04,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 17:25:04,161 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:25:04,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:04,161 INFO L85 PathProgramCache]: Analyzing trace with hash -896738185, now seen corresponding path program 1 times [2022-11-21 17:25:04,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:04,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141742755] [2022-11-21 17:25:04,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:04,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:04,489 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-21 17:25:04,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:04,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141742755] [2022-11-21 17:25:04,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141742755] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:04,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:04,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:25:04,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270355865] [2022-11-21 17:25:04,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:04,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:25:04,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:04,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:25:04,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:25:04,492 INFO L87 Difference]: Start difference. First operand 149 states and 161 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:04,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:04,733 INFO L93 Difference]: Finished difference Result 148 states and 159 transitions. [2022-11-21 17:25:04,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:25:04,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-21 17:25:04,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:04,735 INFO L225 Difference]: With dead ends: 148 [2022-11-21 17:25:04,736 INFO L226 Difference]: Without dead ends: 148 [2022-11-21 17:25:04,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:25:04,737 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 5 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:04,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 273 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:25:04,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-11-21 17:25:04,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2022-11-21 17:25:04,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 109 states have (on average 1.4587155963302751) internal successors, (159), 147 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:04,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 159 transitions. [2022-11-21 17:25:04,742 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 159 transitions. Word has length 14 [2022-11-21 17:25:04,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:04,743 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 159 transitions. [2022-11-21 17:25:04,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:04,744 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 159 transitions. [2022-11-21 17:25:04,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 17:25:04,745 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:04,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:04,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 17:25:04,746 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:25:04,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:04,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2022-11-21 17:25:04,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:04,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063423087] [2022-11-21 17:25:04,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:04,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:05,116 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-21 17:25:05,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:05,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063423087] [2022-11-21 17:25:05,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063423087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:05,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:05,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 17:25:05,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100394327] [2022-11-21 17:25:05,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:05,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 17:25:05,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:05,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 17:25:05,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-21 17:25:05,120 INFO L87 Difference]: Start difference. First operand 148 states and 159 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:05,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:05,564 INFO L93 Difference]: Finished difference Result 152 states and 159 transitions. [2022-11-21 17:25:05,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 17:25:05,565 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-21 17:25:05,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:05,566 INFO L225 Difference]: With dead ends: 152 [2022-11-21 17:25:05,566 INFO L226 Difference]: Without dead ends: 152 [2022-11-21 17:25:05,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-11-21 17:25:05,567 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 190 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:05,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 188 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 17:25:05,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-21 17:25:05,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 147. [2022-11-21 17:25:05,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 109 states have (on average 1.4495412844036697) internal successors, (158), 146 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:05,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 158 transitions. [2022-11-21 17:25:05,572 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 158 transitions. Word has length 16 [2022-11-21 17:25:05,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:05,573 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 158 transitions. [2022-11-21 17:25:05,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:05,573 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 158 transitions. [2022-11-21 17:25:05,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-21 17:25:05,574 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:05,574 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:05,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 17:25:05,575 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:25:05,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:05,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2022-11-21 17:25:05,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:05,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424661409] [2022-11-21 17:25:05,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:05,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:06,185 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-21 17:25:06,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:06,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424661409] [2022-11-21 17:25:06,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424661409] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:06,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:06,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 17:25:06,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626844723] [2022-11-21 17:25:06,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:06,188 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 17:25:06,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:06,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 17:25:06,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-21 17:25:06,189 INFO L87 Difference]: Start difference. First operand 147 states and 158 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:07,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:07,053 INFO L93 Difference]: Finished difference Result 149 states and 156 transitions. [2022-11-21 17:25:07,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 17:25:07,054 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-21 17:25:07,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:07,055 INFO L225 Difference]: With dead ends: 149 [2022-11-21 17:25:07,055 INFO L226 Difference]: Without dead ends: 149 [2022-11-21 17:25:07,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-11-21 17:25:07,057 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 189 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:07,057 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 282 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 17:25:07,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-11-21 17:25:07,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 123. [2022-11-21 17:25:07,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 93 states have (on average 1.4301075268817205) internal successors, (133), 122 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:07,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2022-11-21 17:25:07,061 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 16 [2022-11-21 17:25:07,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:07,062 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2022-11-21 17:25:07,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:07,062 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2022-11-21 17:25:07,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 17:25:07,064 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:07,065 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:07,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 17:25:07,065 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:25:07,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:07,066 INFO L85 PathProgramCache]: Analyzing trace with hash -30672293, now seen corresponding path program 1 times [2022-11-21 17:25:07,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:07,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729380386] [2022-11-21 17:25:07,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:07,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:07,394 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-21 17:25:07,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:07,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729380386] [2022-11-21 17:25:07,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729380386] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:07,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:07,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:25:07,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762609761] [2022-11-21 17:25:07,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:07,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 17:25:07,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:07,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 17:25:07,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:25:07,400 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:07,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:07,807 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-11-21 17:25:07,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 17:25:07,807 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-21 17:25:07,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:07,808 INFO L225 Difference]: With dead ends: 126 [2022-11-21 17:25:07,809 INFO L226 Difference]: Without dead ends: 126 [2022-11-21 17:25:07,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-11-21 17:25:07,810 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 66 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:07,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 253 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 17:25:07,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-11-21 17:25:07,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 122. [2022-11-21 17:25:07,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 93 states have (on average 1.4193548387096775) internal successors, (132), 121 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:07,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2022-11-21 17:25:07,814 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 17 [2022-11-21 17:25:07,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:07,815 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2022-11-21 17:25:07,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:07,815 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2022-11-21 17:25:07,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-21 17:25:07,816 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:07,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:07,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-21 17:25:07,817 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:25:07,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:07,817 INFO L85 PathProgramCache]: Analyzing trace with hash -30672292, now seen corresponding path program 1 times [2022-11-21 17:25:07,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:07,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950518434] [2022-11-21 17:25:07,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:07,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:08,235 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-21 17:25:08,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:08,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950518434] [2022-11-21 17:25:08,236 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950518434] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:08,236 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:08,236 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:25:08,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854280800] [2022-11-21 17:25:08,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:08,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 17:25:08,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:08,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 17:25:08,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:25:08,239 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:08,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:08,675 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2022-11-21 17:25:08,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 17:25:08,676 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-21 17:25:08,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:08,676 INFO L225 Difference]: With dead ends: 125 [2022-11-21 17:25:08,677 INFO L226 Difference]: Without dead ends: 125 [2022-11-21 17:25:08,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-11-21 17:25:08,678 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 65 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:08,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 263 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 17:25:08,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-11-21 17:25:08,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2022-11-21 17:25:08,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 93 states have (on average 1.4086021505376345) internal successors, (131), 120 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:08,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 131 transitions. [2022-11-21 17:25:08,683 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 131 transitions. Word has length 17 [2022-11-21 17:25:08,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:08,684 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 131 transitions. [2022-11-21 17:25:08,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:08,684 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 131 transitions. [2022-11-21 17:25:08,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-21 17:25:08,685 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:08,686 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:08,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 17:25:08,686 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:25:08,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:08,687 INFO L85 PathProgramCache]: Analyzing trace with hash -3964873, now seen corresponding path program 1 times [2022-11-21 17:25:08,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:08,688 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058276538] [2022-11-21 17:25:08,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:08,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:08,836 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-21 17:25:08,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:08,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058276538] [2022-11-21 17:25:08,837 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058276538] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:08,837 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:08,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:25:08,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729297096] [2022-11-21 17:25:08,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:08,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 17:25:08,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:08,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 17:25:08,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:25:08,840 INFO L87 Difference]: Start difference. First operand 121 states and 131 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:09,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:09,023 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2022-11-21 17:25:09,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:25:09,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-21 17:25:09,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:09,025 INFO L225 Difference]: With dead ends: 123 [2022-11-21 17:25:09,025 INFO L226 Difference]: Without dead ends: 123 [2022-11-21 17:25:09,025 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:25:09,026 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 157 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:09,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 113 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:25:09,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-11-21 17:25:09,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 119. [2022-11-21 17:25:09,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 92 states have (on average 1.4021739130434783) internal successors, (129), 118 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:09,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 129 transitions. [2022-11-21 17:25:09,031 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 129 transitions. Word has length 18 [2022-11-21 17:25:09,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:09,031 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 129 transitions. [2022-11-21 17:25:09,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:09,032 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 129 transitions. [2022-11-21 17:25:09,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-21 17:25:09,032 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:09,033 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:09,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 17:25:09,033 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:25:09,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:09,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1069806106, now seen corresponding path program 1 times [2022-11-21 17:25:09,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:09,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766371191] [2022-11-21 17:25:09,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:09,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:09,116 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-21 17:25:09,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:09,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766371191] [2022-11-21 17:25:09,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766371191] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:09,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:09,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:25:09,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375623551] [2022-11-21 17:25:09,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:09,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:25:09,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:09,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:25:09,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:25:09,120 INFO L87 Difference]: Start difference. First operand 119 states and 129 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:09,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:09,292 INFO L93 Difference]: Finished difference Result 181 states and 186 transitions. [2022-11-21 17:25:09,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:25:09,293 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-21 17:25:09,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:09,294 INFO L225 Difference]: With dead ends: 181 [2022-11-21 17:25:09,294 INFO L226 Difference]: Without dead ends: 181 [2022-11-21 17:25:09,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:25:09,295 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 179 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:09,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 135 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:25:09,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-11-21 17:25:09,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 117. [2022-11-21 17:25:09,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 91 states have (on average 1.3956043956043955) internal successors, (127), 116 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:09,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 127 transitions. [2022-11-21 17:25:09,300 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 127 transitions. Word has length 20 [2022-11-21 17:25:09,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:09,300 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 127 transitions. [2022-11-21 17:25:09,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:09,300 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 127 transitions. [2022-11-21 17:25:09,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-21 17:25:09,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:09,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:09,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 17:25:09,302 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:25:09,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:09,302 INFO L85 PathProgramCache]: Analyzing trace with hash 684226449, now seen corresponding path program 1 times [2022-11-21 17:25:09,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:09,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788734302] [2022-11-21 17:25:09,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:09,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:09,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:10,621 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-21 17:25:10,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:10,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788734302] [2022-11-21 17:25:10,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788734302] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:10,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:10,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-11-21 17:25:10,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912707263] [2022-11-21 17:25:10,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:10,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-11-21 17:25:10,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:10,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-11-21 17:25:10,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2022-11-21 17:25:10,624 INFO L87 Difference]: Start difference. First operand 117 states and 127 transitions. Second operand has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:11,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:11,776 INFO L93 Difference]: Finished difference Result 225 states and 229 transitions. [2022-11-21 17:25:11,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-21 17:25:11,777 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-21 17:25:11,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:11,777 INFO L225 Difference]: With dead ends: 225 [2022-11-21 17:25:11,777 INFO L226 Difference]: Without dead ends: 225 [2022-11-21 17:25:11,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=141, Invalid=411, Unknown=0, NotChecked=0, Total=552 [2022-11-21 17:25:11,779 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 284 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:11,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 490 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 17:25:11,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-11-21 17:25:11,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 133. [2022-11-21 17:25:11,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 107 states have (on average 1.3457943925233644) internal successors, (144), 132 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:11,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2022-11-21 17:25:11,784 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 25 [2022-11-21 17:25:11,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:11,785 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2022-11-21 17:25:11,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:11,785 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2022-11-21 17:25:11,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-21 17:25:11,788 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:11,788 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:11,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 17:25:11,789 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:25:11,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:11,790 INFO L85 PathProgramCache]: Analyzing trace with hash 684193678, now seen corresponding path program 1 times [2022-11-21 17:25:11,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:11,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753244311] [2022-11-21 17:25:11,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:11,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:11,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:11,890 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-21 17:25:11,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:11,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753244311] [2022-11-21 17:25:11,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753244311] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:11,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:11,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:25:11,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667254388] [2022-11-21 17:25:11,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:11,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:25:11,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:11,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:25:11,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:25:11,896 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:12,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:12,082 INFO L93 Difference]: Finished difference Result 131 states and 141 transitions. [2022-11-21 17:25:12,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:25:12,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-21 17:25:12,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:12,084 INFO L225 Difference]: With dead ends: 131 [2022-11-21 17:25:12,084 INFO L226 Difference]: Without dead ends: 131 [2022-11-21 17:25:12,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:25:12,085 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 9 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:12,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 236 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:25:12,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-21 17:25:12,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-11-21 17:25:12,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 106 states have (on average 1.330188679245283) internal successors, (141), 130 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:12,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 141 transitions. [2022-11-21 17:25:12,089 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 141 transitions. Word has length 25 [2022-11-21 17:25:12,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:12,089 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 141 transitions. [2022-11-21 17:25:12,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:12,089 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 141 transitions. [2022-11-21 17:25:12,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-21 17:25:12,090 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:12,090 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:12,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 17:25:12,091 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:25:12,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:12,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1096862923, now seen corresponding path program 1 times [2022-11-21 17:25:12,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:12,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147282905] [2022-11-21 17:25:12,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:12,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:12,611 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-21 17:25:12,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:12,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147282905] [2022-11-21 17:25:12,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147282905] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:12,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:12,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-21 17:25:12,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818903588] [2022-11-21 17:25:12,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:12,613 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-21 17:25:12,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:12,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-21 17:25:12,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2022-11-21 17:25:12,614 INFO L87 Difference]: Start difference. First operand 131 states and 141 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:13,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:13,251 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2022-11-21 17:25:13,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-21 17:25:13,252 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-21 17:25:13,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:13,253 INFO L225 Difference]: With dead ends: 185 [2022-11-21 17:25:13,253 INFO L226 Difference]: Without dead ends: 185 [2022-11-21 17:25:13,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2022-11-21 17:25:13,254 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 249 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:13,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 286 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 17:25:13,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-21 17:25:13,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 137. [2022-11-21 17:25:13,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 112 states have (on average 1.3214285714285714) internal successors, (148), 136 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:13,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 148 transitions. [2022-11-21 17:25:13,259 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 148 transitions. Word has length 28 [2022-11-21 17:25:13,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:13,259 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 148 transitions. [2022-11-21 17:25:13,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:13,260 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 148 transitions. [2022-11-21 17:25:13,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-21 17:25:13,260 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:13,260 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:13,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-21 17:25:13,261 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:25:13,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:13,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1096862922, now seen corresponding path program 1 times [2022-11-21 17:25:13,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:13,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56618435] [2022-11-21 17:25:13,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:13,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:13,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:13,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:25:13,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:13,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56618435] [2022-11-21 17:25:13,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56618435] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:13,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:13,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-21 17:25:13,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724605475] [2022-11-21 17:25:13,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:13,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-21 17:25:13,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:13,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-21 17:25:13,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-21 17:25:13,947 INFO L87 Difference]: Start difference. First operand 137 states and 148 transitions. Second operand has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:14,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:14,801 INFO L93 Difference]: Finished difference Result 217 states and 221 transitions. [2022-11-21 17:25:14,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 17:25:14,802 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-11-21 17:25:14,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:14,803 INFO L225 Difference]: With dead ends: 217 [2022-11-21 17:25:14,803 INFO L226 Difference]: Without dead ends: 217 [2022-11-21 17:25:14,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-11-21 17:25:14,804 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 187 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:14,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 341 Invalid, 555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 17:25:14,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2022-11-21 17:25:14,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 137. [2022-11-21 17:25:14,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 112 states have (on average 1.3125) internal successors, (147), 136 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:14,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 147 transitions. [2022-11-21 17:25:14,808 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 147 transitions. Word has length 28 [2022-11-21 17:25:14,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:14,809 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 147 transitions. [2022-11-21 17:25:14,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.5454545454545454) internal successors, (28), 12 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:14,809 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 147 transitions. [2022-11-21 17:25:14,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-21 17:25:14,810 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:14,810 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:14,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-21 17:25:14,810 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:25:14,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:14,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1818276907, now seen corresponding path program 1 times [2022-11-21 17:25:14,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:14,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388953349] [2022-11-21 17:25:14,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:14,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:15,746 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-21 17:25:15,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:15,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388953349] [2022-11-21 17:25:15,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388953349] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:15,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:15,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-11-21 17:25:15,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351340649] [2022-11-21 17:25:15,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:15,747 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-21 17:25:15,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:15,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-21 17:25:15,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2022-11-21 17:25:15,748 INFO L87 Difference]: Start difference. First operand 137 states and 147 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:16,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:16,809 INFO L93 Difference]: Finished difference Result 215 states and 219 transitions. [2022-11-21 17:25:16,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-21 17:25:16,811 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-11-21 17:25:16,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:16,813 INFO L225 Difference]: With dead ends: 215 [2022-11-21 17:25:16,813 INFO L226 Difference]: Without dead ends: 215 [2022-11-21 17:25:16,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2022-11-21 17:25:16,814 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 382 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:16,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 447 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 17:25:16,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2022-11-21 17:25:16,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 138. [2022-11-21 17:25:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 113 states have (on average 1.3097345132743363) internal successors, (148), 137 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:16,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 148 transitions. [2022-11-21 17:25:16,819 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 148 transitions. Word has length 30 [2022-11-21 17:25:16,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:16,820 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 148 transitions. [2022-11-21 17:25:16,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:16,820 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 148 transitions. [2022-11-21 17:25:16,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-21 17:25:16,827 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:16,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:16,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-21 17:25:16,828 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:25:16,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:16,830 INFO L85 PathProgramCache]: Analyzing trace with hash -245371248, now seen corresponding path program 1 times [2022-11-21 17:25:16,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:16,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575677814] [2022-11-21 17:25:16,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:16,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:16,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:16,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:25:16,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:16,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575677814] [2022-11-21 17:25:16,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575677814] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:16,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:16,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:25:16,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324231786] [2022-11-21 17:25:16,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:16,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:25:16,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:16,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:25:16,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:25:16,921 INFO L87 Difference]: Start difference. First operand 138 states and 148 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:17,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:17,094 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2022-11-21 17:25:17,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:25:17,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-11-21 17:25:17,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:17,096 INFO L225 Difference]: With dead ends: 136 [2022-11-21 17:25:17,096 INFO L226 Difference]: Without dead ends: 136 [2022-11-21 17:25:17,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:25:17,097 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 22 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:17,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 211 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:25:17,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-11-21 17:25:17,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2022-11-21 17:25:17,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 135 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:17,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2022-11-21 17:25:17,101 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 36 [2022-11-21 17:25:17,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:17,101 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2022-11-21 17:25:17,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:17,101 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2022-11-21 17:25:17,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-21 17:25:17,102 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:17,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:17,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-21 17:25:17,105 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:25:17,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:17,105 INFO L85 PathProgramCache]: Analyzing trace with hash 984809453, now seen corresponding path program 1 times [2022-11-21 17:25:17,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:17,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254263494] [2022-11-21 17:25:17,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:17,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:17,233 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-21 17:25:17,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:17,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254263494] [2022-11-21 17:25:17,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254263494] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:25:17,235 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:25:17,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-21 17:25:17,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357426146] [2022-11-21 17:25:17,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:25:17,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:25:17,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:17,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:25:17,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:25:17,238 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:17,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:25:17,416 INFO L93 Difference]: Finished difference Result 152 states and 157 transitions. [2022-11-21 17:25:17,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:25:17,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-21 17:25:17,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:25:17,417 INFO L225 Difference]: With dead ends: 152 [2022-11-21 17:25:17,418 INFO L226 Difference]: Without dead ends: 152 [2022-11-21 17:25:17,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:25:17,419 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 136 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:25:17,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 92 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:25:17,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-11-21 17:25:17,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 138. [2022-11-21 17:25:17,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 137 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:17,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 147 transitions. [2022-11-21 17:25:17,424 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 147 transitions. Word has length 37 [2022-11-21 17:25:17,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:25:17,425 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 147 transitions. [2022-11-21 17:25:17,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:17,425 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 147 transitions. [2022-11-21 17:25:17,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-21 17:25:17,426 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:25:17,426 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:25:17,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-21 17:25:17,427 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:25:17,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:25:17,427 INFO L85 PathProgramCache]: Analyzing trace with hash -27234752, now seen corresponding path program 1 times [2022-11-21 17:25:17,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:25:17,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498799398] [2022-11-21 17:25:17,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:17,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:25:17,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:18,954 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:25:18,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:25:18,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498799398] [2022-11-21 17:25:18,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498799398] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:25:18,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [655225841] [2022-11-21 17:25:18,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:25:18,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:25:18,955 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:25:18,960 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:25:18,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 17:25:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:25:19,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 292 conjuncts, 58 conjunts are in the unsatisfiable core [2022-11-21 17:25:19,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:25:19,331 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-21 17:25:19,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-21 17:25:19,492 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-21 17:25:19,493 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-21 17:25:19,673 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-21 17:25:19,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:25:19,694 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-21 17:25:20,023 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:25:20,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-11-21 17:25:20,039 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 20 treesize of output 22 [2022-11-21 17:25:20,104 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 25 treesize of output 13 [2022-11-21 17:25:20,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:25:20,269 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:25:20,312 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-21 17:25:20,313 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-21 17:25:20,345 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 11 treesize of output 7 [2022-11-21 17:25:20,361 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 18 [2022-11-21 17:25:20,542 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:25:20,543 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 36 [2022-11-21 17:25:20,554 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-21 17:25:20,610 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 24 treesize of output 12 [2022-11-21 17:25:20,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-11-21 17:25:20,681 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-21 17:25:20,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:25:20,686 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:25:20,765 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_874 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2022-11-21 17:25:20,787 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_874 (Array Int Int))) (= (select (select (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2022-11-21 17:25:20,813 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_872 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_873 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_872) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_873) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8)) 0)) is different from false [2022-11-21 17:25:20,955 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:25:20,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-11-21 17:25:20,971 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 60 treesize of output 52 [2022-11-21 17:25:20,982 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 24 treesize of output 22 [2022-11-21 17:25:21,040 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_main_#t~malloc6#1.base| |c_ULTIMATE.start_main_~x~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 0)) .cse1) (or (not .cse1) (forall ((v_ArrVal_869 (Array Int Int)) (v_arrayElimCell_19 Int) (v_ArrVal_872 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_869) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_872) v_arrayElimCell_19 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 0))) (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_869))) (or (forall ((v_arrayElimCell_19 Int) (v_ArrVal_872 (Array Int Int))) (= (select (select (store (store .cse2 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_872) v_arrayElimCell_19 v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 0)) (= (select (select (store .cse2 |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 0)))))) is different from false [2022-11-21 17:25:22,150 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:25:22,151 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-11-21 17:25:22,155 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 37 treesize of output 29 [2022-11-21 17:25:22,165 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 8 treesize of output 6 [2022-11-21 17:25:22,179 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:25:22,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 42 [2022-11-21 17:25:22,187 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 76 treesize of output 68 [2022-11-21 17:25:22,196 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-11-21 17:25:29,613 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:25:29,652 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:25:29,661 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:25:29,661 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2022-11-21 17:25:29,670 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:25:29,673 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 36 treesize of output 24 [2022-11-21 17:25:29,683 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 7 treesize of output 3 [2022-11-21 17:25:29,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:25:29,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [655225841] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:25:29,804 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:25:29,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 20] total 43 [2022-11-21 17:25:29,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307751281] [2022-11-21 17:25:29,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:25:29,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-11-21 17:25:29,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:25:29,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-11-21 17:25:29,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1206, Unknown=42, NotChecked=308, Total=1806 [2022-11-21 17:25:29,807 INFO L87 Difference]: Start difference. First operand 138 states and 147 transitions. Second operand has 43 states, 43 states have (on average 2.046511627906977) internal successors, (88), 43 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:25:42,109 WARN L233 SmtUtils]: Spent 6.21s on a formula simplification. DAG size of input: 60 DAG size of output: 58 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-21 17:25:48,612 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~head~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 0)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|) 0)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| 0) (not (= (select |c_#valid| |c_ULTIMATE.start_main_~x~0#1.base|) 0)) (forall ((v_ArrVal_872 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_873 (Array Int Int))) (= (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (store (store |c_#memory_int| .cse1 v_ArrVal_872) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_873) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_874)) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 0)) (= (select |c_#valid| |c_ULTIMATE.start_main_~head~0#1.base|) 1) (forall ((v_ArrVal_872 (Array Int Int)) (v_ArrVal_874 (Array Int Int)) (v_ArrVal_873 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_872) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem7#1.base| v_ArrVal_873) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 0)) (forall ((|v_ULTIMATE.start_main_#t~malloc6#1.base_6| Int)) (or (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_874 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_869) |v_ULTIMATE.start_main_#t~malloc6#1.base_6| v_ArrVal_874) |c_ULTIMATE.start_main_~head~0#1.base|) .cse0) 0)) (= |v_ULTIMATE.start_main_#t~malloc6#1.base_6| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc6#1.base_6|) 0)))))) is different from false [2022-11-21 17:26:00,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:26:00,251 INFO L93 Difference]: Finished difference Result 280 states and 288 transitions. [2022-11-21 17:26:00,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-21 17:26:00,255 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.046511627906977) internal successors, (88), 43 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-11-21 17:26:00,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:26:00,257 INFO L225 Difference]: With dead ends: 280 [2022-11-21 17:26:00,257 INFO L226 Difference]: Without dead ends: 280 [2022-11-21 17:26:00,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1545 ImplicationChecksByTransitivity, 35.4s TimeCoverageRelationStatistics Valid=852, Invalid=4614, Unknown=104, NotChecked=750, Total=6320 [2022-11-21 17:26:00,260 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 527 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 1801 mSolverCounterSat, 110 mSolverCounterUnsat, 53 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 527 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 2776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1801 IncrementalHoareTripleChecker+Invalid, 53 IncrementalHoareTripleChecker+Unknown, 812 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-11-21 17:26:00,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [527 Valid, 1188 Invalid, 2776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1801 Invalid, 53 Unknown, 812 Unchecked, 3.8s Time] [2022-11-21 17:26:00,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2022-11-21 17:26:00,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 138. [2022-11-21 17:26:00,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 114 states have (on average 1.280701754385965) internal successors, (146), 137 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:00,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 146 transitions. [2022-11-21 17:26:00,266 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 146 transitions. Word has length 37 [2022-11-21 17:26:00,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:26:00,267 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 146 transitions. [2022-11-21 17:26:00,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.046511627906977) internal successors, (88), 43 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:00,267 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 146 transitions. [2022-11-21 17:26:00,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-11-21 17:26:00,268 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:26:00,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:26:00,288 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 17:26:00,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-21 17:26:00,476 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:26:00,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:26:00,477 INFO L85 PathProgramCache]: Analyzing trace with hash 421565270, now seen corresponding path program 1 times [2022-11-21 17:26:00,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:26:00,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103799316] [2022-11-21 17:26:00,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:26:00,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:26:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:26:01,214 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-21 17:26:01,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:26:01,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103799316] [2022-11-21 17:26:01,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103799316] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:26:01,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:26:01,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-21 17:26:01,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110269510] [2022-11-21 17:26:01,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:26:01,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-21 17:26:01,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:26:01,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-21 17:26:01,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-21 17:26:01,217 INFO L87 Difference]: Start difference. First operand 138 states and 146 transitions. Second operand has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:02,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:26:02,331 INFO L93 Difference]: Finished difference Result 202 states and 206 transitions. [2022-11-21 17:26:02,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 17:26:02,333 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-11-21 17:26:02,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:26:02,334 INFO L225 Difference]: With dead ends: 202 [2022-11-21 17:26:02,334 INFO L226 Difference]: Without dead ends: 202 [2022-11-21 17:26:02,334 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2022-11-21 17:26:02,335 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 208 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-21 17:26:02,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 346 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-21 17:26:02,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2022-11-21 17:26:02,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 147. [2022-11-21 17:26:02,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 123 states have (on average 1.2682926829268293) internal successors, (156), 146 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:02,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 156 transitions. [2022-11-21 17:26:02,340 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 156 transitions. Word has length 38 [2022-11-21 17:26:02,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:26:02,341 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 156 transitions. [2022-11-21 17:26:02,341 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:02,341 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 156 transitions. [2022-11-21 17:26:02,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-21 17:26:02,341 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:26:02,341 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:26:02,342 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-21 17:26:02,342 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:26:02,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:26:02,342 INFO L85 PathProgramCache]: Analyzing trace with hash 183621750, now seen corresponding path program 1 times [2022-11-21 17:26:02,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:26:02,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233231006] [2022-11-21 17:26:02,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:26:02,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:26:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:26:02,830 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-21 17:26:02,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:26:02,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233231006] [2022-11-21 17:26:02,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233231006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:26:02,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:26:02,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-21 17:26:02,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388879279] [2022-11-21 17:26:02,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:26:02,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-21 17:26:02,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:26:02,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-21 17:26:02,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-21 17:26:02,831 INFO L87 Difference]: Start difference. First operand 147 states and 156 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:03,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:26:03,578 INFO L93 Difference]: Finished difference Result 201 states and 205 transitions. [2022-11-21 17:26:03,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-21 17:26:03,579 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-21 17:26:03,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:26:03,580 INFO L225 Difference]: With dead ends: 201 [2022-11-21 17:26:03,580 INFO L226 Difference]: Without dead ends: 201 [2022-11-21 17:26:03,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2022-11-21 17:26:03,581 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 226 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:26:03,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 296 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 17:26:03,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-11-21 17:26:03,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 148. [2022-11-21 17:26:03,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 124 states have (on average 1.2661290322580645) internal successors, (157), 147 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:03,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 157 transitions. [2022-11-21 17:26:03,585 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 157 transitions. Word has length 39 [2022-11-21 17:26:03,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:26:03,585 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 157 transitions. [2022-11-21 17:26:03,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:03,585 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 157 transitions. [2022-11-21 17:26:03,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-21 17:26:03,586 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:26:03,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:26:03,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-21 17:26:03,586 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:26:03,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:26:03,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1509086814, now seen corresponding path program 1 times [2022-11-21 17:26:03,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:26:03,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991605212] [2022-11-21 17:26:03,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:26:03,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:26:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:26:04,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:26:04,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:26:04,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991605212] [2022-11-21 17:26:04,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991605212] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:26:04,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113502305] [2022-11-21 17:26:04,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:26:04,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:26:04,332 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:26:04,343 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:26:04,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 17:26:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:26:04,540 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-21 17:26:04,545 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:26:04,696 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:26:04,697 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-21 17:26:04,747 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-21 17:26:04,900 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:26:04,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-21 17:26:04,972 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:26:04,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-21 17:26:05,542 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:26:05,545 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:26:05,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-11-21 17:26:05,589 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-21 17:26:05,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:26:05,594 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:26:05,689 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:26:05,690 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 25 treesize of output 29 [2022-11-21 17:26:05,945 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_63| Int) (v_ArrVal_1064 (Array Int Int))) (or (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1064) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_63|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_63| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_63|)))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_63| Int) (v_ArrVal_1064 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_63| |c_ULTIMATE.start_main_~head~0#1.offset|)) (let ((.cse0 (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem8#1.base| v_ArrVal_1064) |c_ULTIMATE.start_main_~head~0#1.base|))) (= (select .cse0 |c_ULTIMATE.start_main_~head~0#1.offset|) (select .cse0 |v_ULTIMATE.start_main_~x~0#1.offset_63|))) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_63|))))) is different from false [2022-11-21 17:26:06,310 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (and (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_63| Int) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_63| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_63|)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1063))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1064)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_63|))))) (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_63| Int) (v_ArrVal_1064 (Array Int Int)) (v_ArrVal_1063 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_63| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_63|)) (let ((.cse2 (select (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_1063))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1064)) |c_ULTIMATE.start_main_~head~0#1.base|))) (= (select .cse2 |v_ULTIMATE.start_main_~x~0#1.offset_63|) (select .cse2 |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2022-11-21 17:26:06,353 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:26:06,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2022-11-21 17:26:06,364 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:26:06,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 128 [2022-11-21 17:26:06,379 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:26:06,379 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 112 treesize of output 111 [2022-11-21 17:26:06,386 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 102 treesize of output 98 [2022-11-21 17:26:06,496 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-21 17:26:06,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 1 [2022-11-21 17:26:06,748 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:26:06,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 59 treesize of output 129 [2022-11-21 17:26:07,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:26:07,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113502305] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:26:07,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:26:07,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18, 19] total 40 [2022-11-21 17:26:07,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469279008] [2022-11-21 17:26:07,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:26:07,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-21 17:26:07,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:26:07,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-21 17:26:07,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1292, Unknown=16, NotChecked=150, Total=1640 [2022-11-21 17:26:07,046 INFO L87 Difference]: Start difference. First operand 148 states and 157 transitions. Second operand has 41 states, 40 states have (on average 2.425) internal successors, (97), 41 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:09,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:26:09,076 INFO L93 Difference]: Finished difference Result 200 states and 204 transitions. [2022-11-21 17:26:09,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-21 17:26:09,076 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.425) internal successors, (97), 41 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-21 17:26:09,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:26:09,077 INFO L225 Difference]: With dead ends: 200 [2022-11-21 17:26:09,077 INFO L226 Difference]: Without dead ends: 200 [2022-11-21 17:26:09,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 52 SyntacticMatches, 4 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 678 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=473, Invalid=2171, Unknown=16, NotChecked=202, Total=2862 [2022-11-21 17:26:09,079 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 984 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 1202 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 984 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 1202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 278 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:26:09,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [984 Valid, 710 Invalid, 1573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 1202 Invalid, 0 Unknown, 278 Unchecked, 1.3s Time] [2022-11-21 17:26:09,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-11-21 17:26:09,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 154. [2022-11-21 17:26:09,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 130 states have (on average 1.2615384615384615) internal successors, (164), 153 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:09,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 164 transitions. [2022-11-21 17:26:09,082 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 164 transitions. Word has length 39 [2022-11-21 17:26:09,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:26:09,082 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 164 transitions. [2022-11-21 17:26:09,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.425) internal successors, (97), 41 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:09,083 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 164 transitions. [2022-11-21 17:26:09,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-21 17:26:09,083 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:26:09,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:26:09,099 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 17:26:09,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-11-21 17:26:09,290 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:26:09,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:26:09,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1509086815, now seen corresponding path program 1 times [2022-11-21 17:26:09,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:26:09,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943966868] [2022-11-21 17:26:09,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:26:09,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:26:09,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:26:09,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:26:09,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:26:09,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943966868] [2022-11-21 17:26:09,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943966868] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:26:09,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700178488] [2022-11-21 17:26:09,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:26:09,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:26:09,654 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:26:09,655 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:26:09,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 17:26:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:26:09,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 31 conjunts are in the unsatisfiable core [2022-11-21 17:26:09,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:26:10,312 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:26:10,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-11-21 17:26:10,321 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:26:10,324 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:26:10,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 19 [2022-11-21 17:26:10,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:26:10,351 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:26:10,421 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:26:10,422 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 34 treesize of output 38 [2022-11-21 17:26:10,546 INFO L321 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2022-11-21 17:26:10,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2022-11-21 17:26:10,563 INFO L321 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2022-11-21 17:26:10,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 14 [2022-11-21 17:26:10,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:26:10,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700178488] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:26:10,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:26:10,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2022-11-21 17:26:10,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769866718] [2022-11-21 17:26:10,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:26:10,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-21 17:26:10,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:26:10,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-21 17:26:10,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2022-11-21 17:26:10,713 INFO L87 Difference]: Start difference. First operand 154 states and 164 transitions. Second operand has 19 states, 18 states have (on average 5.5) internal successors, (99), 19 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:11,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:26:11,804 INFO L93 Difference]: Finished difference Result 220 states and 225 transitions. [2022-11-21 17:26:11,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 17:26:11,805 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.5) internal successors, (99), 19 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-11-21 17:26:11,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:26:11,806 INFO L225 Difference]: With dead ends: 220 [2022-11-21 17:26:11,806 INFO L226 Difference]: Without dead ends: 220 [2022-11-21 17:26:11,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=202, Invalid=790, Unknown=0, NotChecked=0, Total=992 [2022-11-21 17:26:11,808 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 530 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 17:26:11,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 441 Invalid, 700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 17:26:11,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-11-21 17:26:11,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 164. [2022-11-21 17:26:11,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 143 states have (on average 1.2447552447552448) internal successors, (178), 163 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:11,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 178 transitions. [2022-11-21 17:26:11,812 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 178 transitions. Word has length 39 [2022-11-21 17:26:11,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:26:11,812 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 178 transitions. [2022-11-21 17:26:11,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.5) internal successors, (99), 19 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:11,813 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 178 transitions. [2022-11-21 17:26:11,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-21 17:26:11,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:26:11,813 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:26:11,821 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 17:26:12,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:26:12,020 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:26:12,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:26:12,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1397307224, now seen corresponding path program 1 times [2022-11-21 17:26:12,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:26:12,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804182976] [2022-11-21 17:26:12,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:26:12,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:26:12,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:26:12,188 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-21 17:26:12,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:26:12,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804182976] [2022-11-21 17:26:12,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804182976] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:26:12,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:26:12,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:26:12,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534812297] [2022-11-21 17:26:12,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:26:12,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 17:26:12,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:26:12,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 17:26:12,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:26:12,191 INFO L87 Difference]: Start difference. First operand 164 states and 178 transitions. Second operand has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:12,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:26:12,595 INFO L93 Difference]: Finished difference Result 192 states and 199 transitions. [2022-11-21 17:26:12,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 17:26:12,603 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2022-11-21 17:26:12,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:26:12,604 INFO L225 Difference]: With dead ends: 192 [2022-11-21 17:26:12,605 INFO L226 Difference]: Without dead ends: 192 [2022-11-21 17:26:12,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-11-21 17:26:12,606 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 88 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:26:12,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 290 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 17:26:12,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-11-21 17:26:12,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 171. [2022-11-21 17:26:12,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 150 states have (on average 1.2466666666666666) internal successors, (187), 170 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:12,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 187 transitions. [2022-11-21 17:26:12,625 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 187 transitions. Word has length 40 [2022-11-21 17:26:12,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:26:12,625 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 187 transitions. [2022-11-21 17:26:12,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.714285714285714) internal successors, (40), 8 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-21 17:26:12,626 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 187 transitions. [2022-11-21 17:26:12,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-21 17:26:12,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:26:12,627 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:26:12,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-21 17:26:12,627 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 61 more)] === [2022-11-21 17:26:12,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:26:12,628 INFO L85 PathProgramCache]: Analyzing trace with hash 402357860, now seen corresponding path program 1 times [2022-11-21 17:26:12,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:26:12,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410532713] [2022-11-21 17:26:12,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:26:12,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:26:12,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:26:14,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:26:14,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:26:14,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410532713] [2022-11-21 17:26:14,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [410532713] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:26:14,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377363416] [2022-11-21 17:26:14,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:26:14,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:26:14,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:26:14,431 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:26:14,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8bc4310b-922b-4622-a0dd-6849d44f826c/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 17:26:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:26:14,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-21 17:26:14,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:26:14,620 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-21 17:26:14,748 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-21 17:26:14,748 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-21 17:26:14,800 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-21 17:26:14,940 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:26:14,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-11-21 17:26:15,086 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:26:15,086 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 22 treesize of output 22 [2022-11-21 17:26:15,230 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-21 17:26:15,230 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 22 treesize of output 22 [2022-11-21 17:26:15,248 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-21 17:26:15,261 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-21 17:26:15,262 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-21 17:26:15,339 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-21 17:26:15,340 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 1 case distinctions, treesize of input 27 treesize of output 22 [2022-11-21 17:26:15,515 INFO L321 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-11-21 17:26:15,515 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 34 treesize of output 38 [2022-11-21 17:26:15,662 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-11-21 17:26:15,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 53 [2022-11-21 17:26:15,945 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-21 17:26:15,953 INFO L321 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2022-11-21 17:26:15,954 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 27 [2022-11-21 17:26:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:26:15,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:26:16,600 INFO L321 Elim1Store]: treesize reduction 5, result has 87.8 percent of original size [2022-11-21 17:26:16,601 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 45 treesize of output 44 [2022-11-21 17:26:16,630 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1346 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (= |c_ULTIMATE.start_main_~x~0#1.base| (select (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc6#1.base|)) |c_ULTIMATE.start_main_#t~malloc6#1.base| v_ArrVal_1346))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1347)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|)) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|)))) is different from false [2022-11-21 17:26:16,747 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:26: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 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2022-11-21 17:26:16,766 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_1347 (Array Int Int)) (v_ArrVal_1346 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_75| Int)) (let ((.cse0 (select v_arrayElimArr_7 |ULTIMATE.start_main_~x~0#1.offset|))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_75| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select |c_#valid| .cse0) 0)) (= (select (select (let ((.cse1 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_7) .cse0 v_ArrVal_1346))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1347)) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_75|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_75|))))) is different from false [2022-11-21 17:26:17,499 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:26:17,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 86 [2022-11-21 17:26:17,528 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:26:17,529 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11906 treesize of output 10149 [2022-11-21 17:26:17,685 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:26:17,686 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 10134 treesize of output 9268 [2022-11-21 17:26:17,776 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:26:17,777 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 9246 treesize of output 7556 [2022-11-21 17:26:17,853 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-21 17:26:17,854 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 7542 treesize of output 6910 [2022-11-21 17:26:17,928 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 6902 treesize of output 6646 [2022-11-21 17:26:18,086 INFO L321 Elim1Store]: treesize reduction 14, result has 71.4 percent of original size [2022-11-21 17:26:18,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 61