./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/busybox-1.22.0/printf-3.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/busybox-1.22.0/printf-3.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --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 64bit --witnessprinter.graph.data.programhash 9ada37fed3f859a92366841083d791010f6b2b10b7c06e4bb87cb16ffee75ac9 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 04:48:38,277 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 04:48:38,371 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-28 04:48:38,386 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 04:48:38,386 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 04:48:38,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 04:48:38,415 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 04:48:38,415 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 04:48:38,415 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 04:48:38,415 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 04:48:38,416 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 04:48:38,416 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 04:48:38,416 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 04:48:38,416 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 04:48:38,416 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 04:48:38,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 04:48:38,417 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 04:48:38,417 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 04:48:38,417 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 04:48:38,418 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 04:48:38,418 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 04:48:38,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 04:48:38,418 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 04:48:38,418 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 04:48:38,418 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 04:48:38,419 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 04:48:38,419 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 04:48:38,419 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:48:38,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:48:38,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:48:38,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:48:38,423 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 04:48:38,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 04:48:38,423 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 04:48:38,423 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 04:48:38,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:48:38,424 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 04:48:38,424 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 04:48:38,424 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 04:48:38,424 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 04:48:38,424 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 04:48:38,424 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 04:48:38,424 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 04:48:38,424 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 04:48:38,425 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9ada37fed3f859a92366841083d791010f6b2b10b7c06e4bb87cb16ffee75ac9 [2024-11-28 04:48:38,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 04:48:38,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 04:48:38,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 04:48:38,759 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 04:48:38,759 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 04:48:38,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/busybox-1.22.0/printf-3.i [2024-11-28 04:48:41,704 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/data/50d80eb55/5dd02d81dddd4655a0acfb037cdf7a84/FLAG343a8d9d1 [2024-11-28 04:48:42,272 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 04:48:42,272 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/sv-benchmarks/c/busybox-1.22.0/printf-3.i [2024-11-28 04:48:42,316 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/data/50d80eb55/5dd02d81dddd4655a0acfb037cdf7a84/FLAG343a8d9d1 [2024-11-28 04:48:42,335 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/data/50d80eb55/5dd02d81dddd4655a0acfb037cdf7a84 [2024-11-28 04:48:42,337 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 04:48:42,339 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 04:48:42,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 04:48:42,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 04:48:42,347 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 04:48:42,348 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:48:42" (1/1) ... [2024-11-28 04:48:42,349 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@136bc45e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:48:42, skipping insertion in model container [2024-11-28 04:48:42,349 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 04:48:42" (1/1) ... [2024-11-28 04:48:42,438 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 04:48:43,873 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,876 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,894 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,898 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,902 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,905 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,906 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,908 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,909 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,909 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,913 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,913 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,915 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,917 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,919 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,920 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,921 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,923 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,923 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,924 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,925 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,925 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,926 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,929 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,929 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,934 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,942 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,948 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,950 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,951 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,960 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,969 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,971 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,977 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,980 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,984 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,985 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,988 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,991 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,996 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,997 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,997 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,998 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:43,999 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:44,000 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:44,007 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:44,009 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:44,010 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:44,012 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:44,017 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:44,018 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:44,019 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:44,019 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:44,021 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:44,021 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:44,023 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:44,034 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:44,035 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:44,037 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:44,046 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:44,057 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-28 04:48:44,067 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:48:44,107 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 04:48:44,336 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 04:48:44,555 WARN L1212 FunctionHandler]: The following functions are not defined or handled internally: vasprintf [2024-11-28 04:48:44,563 INFO L204 MainTranslator]: Completed translation [2024-11-28 04:48:44,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:48:44 WrapperNode [2024-11-28 04:48:44,564 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 04:48:44,565 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 04:48:44,565 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 04:48:44,565 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 04:48:44,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:48:44" (1/1) ... [2024-11-28 04:48:44,624 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:48:44" (1/1) ... [2024-11-28 04:48:44,793 INFO L138 Inliner]: procedures = 648, calls = 860, calls flagged for inlining = 31, calls inlined = 29, statements flattened = 1863 [2024-11-28 04:48:44,794 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 04:48:44,794 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 04:48:44,795 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 04:48:44,795 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 04:48:44,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:48:44" (1/1) ... [2024-11-28 04:48:44,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:48:44" (1/1) ... [2024-11-28 04:48:44,834 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:48:44" (1/1) ... [2024-11-28 04:48:44,847 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-28 04:48:44,848 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:48:44" (1/1) ... [2024-11-28 04:48:44,848 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:48:44" (1/1) ... [2024-11-28 04:48:44,936 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:48:44" (1/1) ... [2024-11-28 04:48:44,940 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:48:44" (1/1) ... [2024-11-28 04:48:44,957 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:48:44" (1/1) ... [2024-11-28 04:48:44,979 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:48:44" (1/1) ... [2024-11-28 04:48:44,993 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:48:44" (1/1) ... [2024-11-28 04:48:45,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 04:48:45,025 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 04:48:45,029 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 04:48:45,029 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 04:48:45,030 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:48:44" (1/1) ... [2024-11-28 04:48:45,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 04:48:45,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:48:45,076 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 04:48:45,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 04:48:45,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-28 04:48:45,113 INFO L130 BoogieDeclarations]: Found specification of procedure bb_putchar [2024-11-28 04:48:45,113 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_putchar [2024-11-28 04:48:45,113 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-28 04:48:45,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-28 04:48:45,113 INFO L130 BoogieDeclarations]: Found specification of procedure ret_ERANGE [2024-11-28 04:48:45,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ret_ERANGE [2024-11-28 04:48:45,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2024-11-28 04:48:45,114 INFO L130 BoogieDeclarations]: Found specification of procedure bb_verror_msg [2024-11-28 04:48:45,114 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_verror_msg [2024-11-28 04:48:45,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-28 04:48:45,115 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-28 04:48:45,115 INFO L130 BoogieDeclarations]: Found specification of procedure get_width_prec [2024-11-28 04:48:45,115 INFO L138 BoogieDeclarations]: Found implementation of procedure get_width_prec [2024-11-28 04:48:45,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-28 04:48:45,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 04:48:45,116 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 04:48:45,116 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-28 04:48:45,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 04:48:45,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 04:48:45,116 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2024-11-28 04:48:45,116 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2024-11-28 04:48:45,117 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_strcpy [2024-11-28 04:48:45,117 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_strcpy [2024-11-28 04:48:45,117 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2024-11-28 04:48:45,117 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2024-11-28 04:48:45,117 INFO L130 BoogieDeclarations]: Found specification of procedure handle_errors [2024-11-28 04:48:45,117 INFO L138 BoogieDeclarations]: Found implementation of procedure handle_errors [2024-11-28 04:48:45,117 INFO L130 BoogieDeclarations]: Found specification of procedure bb_process_escape_sequence [2024-11-28 04:48:45,118 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_process_escape_sequence [2024-11-28 04:48:45,119 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-28 04:48:45,119 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-28 04:48:45,119 INFO L130 BoogieDeclarations]: Found specification of procedure print_direc [2024-11-28 04:48:45,119 INFO L138 BoogieDeclarations]: Found implementation of procedure print_direc [2024-11-28 04:48:45,119 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-28 04:48:45,119 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-28 04:48:45,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-28 04:48:45,119 INFO L130 BoogieDeclarations]: Found specification of procedure bb_ascii_isalnum [2024-11-28 04:48:45,120 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_ascii_isalnum [2024-11-28 04:48:45,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-28 04:48:45,120 INFO L130 BoogieDeclarations]: Found specification of procedure bb_strtoll [2024-11-28 04:48:45,120 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_strtoll [2024-11-28 04:48:45,120 INFO L130 BoogieDeclarations]: Found specification of procedure multiconvert [2024-11-28 04:48:45,120 INFO L138 BoogieDeclarations]: Found implementation of procedure multiconvert [2024-11-28 04:48:45,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~real [2024-11-28 04:48:45,120 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-28 04:48:45,120 INFO L130 BoogieDeclarations]: Found specification of procedure bb_error_msg [2024-11-28 04:48:45,120 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_error_msg [2024-11-28 04:48:45,701 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 04:48:45,703 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 04:48:54,646 INFO L? ?]: Removed 1334 outVars from TransFormulas that were not future-live. [2024-11-28 04:48:54,647 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 04:48:54,678 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 04:48:54,679 INFO L312 CfgBuilder]: Removed 26 assume(true) statements. [2024-11-28 04:48:54,679 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:48:54 BoogieIcfgContainer [2024-11-28 04:48:54,679 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 04:48:54,681 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 04:48:54,681 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 04:48:54,686 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 04:48:54,686 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 04:48:42" (1/3) ... [2024-11-28 04:48:54,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df0d9f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:48:54, skipping insertion in model container [2024-11-28 04:48:54,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 04:48:44" (2/3) ... [2024-11-28 04:48:54,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2df0d9f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 04:48:54, skipping insertion in model container [2024-11-28 04:48:54,688 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 04:48:54" (3/3) ... [2024-11-28 04:48:54,693 INFO L128 eAbstractionObserver]: Analyzing ICFG printf-3.i [2024-11-28 04:48:54,708 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 04:48:54,710 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG printf-3.i that has 15 procedures, 1212 locations, 1 initial locations, 23 loop locations, and 486 error locations. [2024-11-28 04:48:54,788 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 04:48:54,804 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@407fb0f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 04:48:54,805 INFO L334 AbstractCegarLoop]: Starting to check reachability of 486 error locations. [2024-11-28 04:48:54,814 INFO L276 IsEmpty]: Start isEmpty. Operand has 1212 states, 659 states have (on average 2.0197268588770867) internal successors, (1331), 1160 states have internal predecessors, (1331), 52 states have call successors, (52), 14 states have call predecessors, (52), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-28 04:48:54,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 04:48:54,822 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:48:54,822 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 04:48:54,823 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 483 more)] === [2024-11-28 04:48:54,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:48:54,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1287988, now seen corresponding path program 1 times [2024-11-28 04:48:54,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:48:54,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375329134] [2024-11-28 04:48:54,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:48:54,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:48:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:48:57,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:48:57,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:48:57,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375329134] [2024-11-28 04:48:57,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375329134] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:48:57,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:48:57,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:48:57,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687392332] [2024-11-28 04:48:57,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:48:57,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:48:57,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:48:57,158 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:48:57,158 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:48:57,164 INFO L87 Difference]: Start difference. First operand has 1212 states, 659 states have (on average 2.0197268588770867) internal successors, (1331), 1160 states have internal predecessors, (1331), 52 states have call successors, (52), 14 states have call predecessors, (52), 14 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) 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) [2024-11-28 04:49:01,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:49:04,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:49:04,056 INFO L93 Difference]: Finished difference Result 1347 states and 1540 transitions. [2024-11-28 04:49:04,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:49:04,058 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 [2024-11-28 04:49:04,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:49:04,076 INFO L225 Difference]: With dead ends: 1347 [2024-11-28 04:49:04,076 INFO L226 Difference]: Without dead ends: 1345 [2024-11-28 04:49:04,078 INFO L434 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 [2024-11-28 04:49:04,081 INFO L435 NwaCegarLoop]: 973 mSDtfsCounter, 431 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 640 mSolverCounterSat, 10 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 640 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:49:04,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [437 Valid, 1629 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 640 Invalid, 1 Unknown, 0 Unchecked, 6.7s Time] [2024-11-28 04:49:04,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2024-11-28 04:49:04,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1030. [2024-11-28 04:49:04,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 560 states have (on average 1.9660714285714285) internal successors, (1101), 983 states have internal predecessors, (1101), 48 states have call successors, (48), 13 states have call predecessors, (48), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-28 04:49:04,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1183 transitions. [2024-11-28 04:49:04,232 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1183 transitions. Word has length 3 [2024-11-28 04:49:04,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:49:04,232 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1183 transitions. [2024-11-28 04:49:04,232 INFO L472 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) [2024-11-28 04:49:04,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1183 transitions. [2024-11-28 04:49:04,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-28 04:49:04,232 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:49:04,233 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-28 04:49:04,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 04:49:04,233 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 483 more)] === [2024-11-28 04:49:04,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:04,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1287989, now seen corresponding path program 1 times [2024-11-28 04:49:04,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:04,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178889612] [2024-11-28 04:49:04,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:04,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:05,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:05,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:49:05,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:05,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178889612] [2024-11-28 04:49:05,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178889612] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:05,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:05,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:49:05,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765832011] [2024-11-28 04:49:05,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:05,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:49:05,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:05,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:49:05,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:49:05,997 INFO L87 Difference]: Start difference. First operand 1030 states and 1183 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) [2024-11-28 04:49:10,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:49:11,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:49:11,766 INFO L93 Difference]: Finished difference Result 1029 states and 1182 transitions. [2024-11-28 04:49:11,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:49:11,767 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 [2024-11-28 04:49:11,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:49:11,772 INFO L225 Difference]: With dead ends: 1029 [2024-11-28 04:49:11,773 INFO L226 Difference]: Without dead ends: 1029 [2024-11-28 04:49:11,773 INFO L434 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 [2024-11-28 04:49:11,774 INFO L435 NwaCegarLoop]: 1175 mSDtfsCounter, 12 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1930 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:49:11,774 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1930 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 419 Invalid, 1 Unknown, 0 Unchecked, 5.7s Time] [2024-11-28 04:49:11,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1029 states. [2024-11-28 04:49:11,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1029 to 1029. [2024-11-28 04:49:11,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 560 states have (on average 1.9642857142857142) internal successors, (1100), 982 states have internal predecessors, (1100), 48 states have call successors, (48), 13 states have call predecessors, (48), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-28 04:49:11,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1182 transitions. [2024-11-28 04:49:11,812 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1182 transitions. Word has length 3 [2024-11-28 04:49:11,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:49:11,812 INFO L471 AbstractCegarLoop]: Abstraction has 1029 states and 1182 transitions. [2024-11-28 04:49:11,813 INFO L472 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) [2024-11-28 04:49:11,813 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1182 transitions. [2024-11-28 04:49:11,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-28 04:49:11,813 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:49:11,814 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:49:11,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-28 04:49:11,814 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 483 more)] === [2024-11-28 04:49:11,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:11,815 INFO L85 PathProgramCache]: Analyzing trace with hash -183702467, now seen corresponding path program 1 times [2024-11-28 04:49:11,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:11,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205454900] [2024-11-28 04:49:11,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:11,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:13,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:49:13,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:13,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205454900] [2024-11-28 04:49:13,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205454900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:13,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:13,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:49:13,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314946478] [2024-11-28 04:49:13,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:13,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:49:13,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:13,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:49:13,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:49:13,172 INFO L87 Difference]: Start difference. First operand 1029 states and 1182 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:49:13,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:49:13,253 INFO L93 Difference]: Finished difference Result 1033 states and 1187 transitions. [2024-11-28 04:49:13,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:49:13,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2024-11-28 04:49:13,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:49:13,259 INFO L225 Difference]: With dead ends: 1033 [2024-11-28 04:49:13,259 INFO L226 Difference]: Without dead ends: 1033 [2024-11-28 04:49:13,261 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:49:13,262 INFO L435 NwaCegarLoop]: 1178 mSDtfsCounter, 3 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2352 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:49:13,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2352 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-28 04:49:13,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2024-11-28 04:49:13,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1030. [2024-11-28 04:49:13,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 561 states have (on average 1.9625668449197862) internal successors, (1101), 983 states have internal predecessors, (1101), 48 states have call successors, (48), 13 states have call predecessors, (48), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-28 04:49:13,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1183 transitions. [2024-11-28 04:49:13,305 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1183 transitions. Word has length 7 [2024-11-28 04:49:13,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:49:13,306 INFO L471 AbstractCegarLoop]: Abstraction has 1030 states and 1183 transitions. [2024-11-28 04:49:13,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:49:13,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1183 transitions. [2024-11-28 04:49:13,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-28 04:49:13,308 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:49:13,308 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:49:13,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 04:49:13,308 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 483 more)] === [2024-11-28 04:49:13,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:13,309 INFO L85 PathProgramCache]: Analyzing trace with hash -183704644, now seen corresponding path program 1 times [2024-11-28 04:49:13,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:13,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632411716] [2024-11-28 04:49:13,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:13,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:14,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:49:14,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:14,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632411716] [2024-11-28 04:49:14,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632411716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:49:14,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:49:14,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:49:14,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373380731] [2024-11-28 04:49:14,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:49:14,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:49:14,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:14,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:49:14,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:49:14,900 INFO L87 Difference]: Start difference. First operand 1030 states and 1183 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:49:18,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:49:22,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:49:25,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:49:25,148 INFO L93 Difference]: Finished difference Result 1033 states and 1186 transitions. [2024-11-28 04:49:25,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:49:25,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2024-11-28 04:49:25,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:49:25,154 INFO L225 Difference]: With dead ends: 1033 [2024-11-28 04:49:25,154 INFO L226 Difference]: Without dead ends: 1033 [2024-11-28 04:49:25,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:49:25,156 INFO L435 NwaCegarLoop]: 1173 mSDtfsCounter, 13 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1931 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:49:25,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1931 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 431 Invalid, 2 Unknown, 0 Unchecked, 10.2s Time] [2024-11-28 04:49:25,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1033 states. [2024-11-28 04:49:25,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1033 to 1032. [2024-11-28 04:49:25,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 563 states have (on average 1.9591474245115452) internal successors, (1103), 985 states have internal predecessors, (1103), 48 states have call successors, (48), 13 states have call predecessors, (48), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-28 04:49:25,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1185 transitions. [2024-11-28 04:49:25,187 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1185 transitions. Word has length 7 [2024-11-28 04:49:25,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:49:25,187 INFO L471 AbstractCegarLoop]: Abstraction has 1032 states and 1185 transitions. [2024-11-28 04:49:25,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:49:25,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1185 transitions. [2024-11-28 04:49:25,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 04:49:25,188 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:49:25,188 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:49:25,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-28 04:49:25,189 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 483 more)] === [2024-11-28 04:49:25,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:25,189 INFO L85 PathProgramCache]: Analyzing trace with hash 444394102, now seen corresponding path program 1 times [2024-11-28 04:49:25,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:25,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576389568] [2024-11-28 04:49:25,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:25,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:26,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:26,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:49:26,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:26,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576389568] [2024-11-28 04:49:26,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576389568] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:49:26,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608047544] [2024-11-28 04:49:26,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:26,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:49:26,373 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:49:26,377 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:49:26,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 04:49:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:27,771 INFO L256 TraceCheckSpWp]: Trace formula consists of 1678 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 04:49:27,775 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:49:27,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:49:27,843 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:49:27,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:49:27,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608047544] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:49:27,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:49:27,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-28 04:49:27,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296542067] [2024-11-28 04:49:27,942 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:49:27,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:49:27,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:27,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:49:27,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:49:27,944 INFO L87 Difference]: Start difference. First operand 1032 states and 1185 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:49:28,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:49:28,094 INFO L93 Difference]: Finished difference Result 1042 states and 1197 transitions. [2024-11-28 04:49:28,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:49:28,095 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-28 04:49:28,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:49:28,099 INFO L225 Difference]: With dead ends: 1042 [2024-11-28 04:49:28,099 INFO L226 Difference]: Without dead ends: 1042 [2024-11-28 04:49:28,100 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:49:28,101 INFO L435 NwaCegarLoop]: 1178 mSDtfsCounter, 6 mSDsluCounter, 2350 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3528 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:49:28,101 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3528 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:49:28,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2024-11-28 04:49:28,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2024-11-28 04:49:28,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 573 states have (on average 1.9458987783595114) internal successors, (1115), 995 states have internal predecessors, (1115), 48 states have call successors, (48), 13 states have call predecessors, (48), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-28 04:49:28,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1197 transitions. [2024-11-28 04:49:28,132 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1197 transitions. Word has length 11 [2024-11-28 04:49:28,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:49:28,132 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1197 transitions. [2024-11-28 04:49:28,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:49:28,132 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1197 transitions. [2024-11-28 04:49:28,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-28 04:49:28,133 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:49:28,133 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:49:28,149 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 04:49:28,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:49:28,334 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 483 more)] === [2024-11-28 04:49:28,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:49:28,336 INFO L85 PathProgramCache]: Analyzing trace with hash 444391925, now seen corresponding path program 1 times [2024-11-28 04:49:28,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:49:28,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267349140] [2024-11-28 04:49:28,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:28,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:49:29,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:30,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:49:30,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:49:30,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267349140] [2024-11-28 04:49:30,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267349140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:49:30,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119682654] [2024-11-28 04:49:30,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:49:30,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:49:30,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:49:30,021 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:49:30,024 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 04:49:31,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:49:31,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 1674 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-28 04:49:31,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:49:31,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:49:31,675 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:49:32,012 INFO L378 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 5 [2024-11-28 04:49:32,065 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:49:32,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119682654] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:49:32,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:49:32,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-28 04:49:32,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008675215] [2024-11-28 04:49:32,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:49:32,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-28 04:49:32,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:49:32,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-28 04:49:32,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-11-28 04:49:32,068 INFO L87 Difference]: Start difference. First operand 1042 states and 1197 transitions. Second operand has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:49:36,113 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:49:40,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:49:44,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:49:48,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:49:52,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:49:56,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:50:00,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:50:04,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:50:08,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:50:16,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:16,049 INFO L93 Difference]: Finished difference Result 1041 states and 1194 transitions. [2024-11-28 04:50:16,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:50:16,049 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-28 04:50:16,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:16,055 INFO L225 Difference]: With dead ends: 1041 [2024-11-28 04:50:16,055 INFO L226 Difference]: Without dead ends: 1041 [2024-11-28 04:50:16,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2024-11-28 04:50:16,058 INFO L435 NwaCegarLoop]: 1171 mSDtfsCounter, 1033 mSDsluCounter, 4379 mSDsCounter, 0 mSdLazyCounter, 2188 mSolverCounterSat, 17 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1046 SdHoareTripleChecker+Valid, 5550 SdHoareTripleChecker+Invalid, 2214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2188 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:16,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1046 Valid, 5550 Invalid, 2214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2188 Invalid, 9 Unknown, 0 Unchecked, 43.7s Time] [2024-11-28 04:50:16,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1041 states. [2024-11-28 04:50:16,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1041 to 1041. [2024-11-28 04:50:16,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1041 states, 573 states have (on average 1.9406631762652704) internal successors, (1112), 994 states have internal predecessors, (1112), 48 states have call successors, (48), 13 states have call predecessors, (48), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-28 04:50:16,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1041 states to 1041 states and 1194 transitions. [2024-11-28 04:50:16,097 INFO L78 Accepts]: Start accepts. Automaton has 1041 states and 1194 transitions. Word has length 11 [2024-11-28 04:50:16,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:16,097 INFO L471 AbstractCegarLoop]: Abstraction has 1041 states and 1194 transitions. [2024-11-28 04:50:16,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 14 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:50:16,097 INFO L276 IsEmpty]: Start isEmpty. Operand 1041 states and 1194 transitions. [2024-11-28 04:50:16,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-28 04:50:16,098 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:16,099 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:50:16,114 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 04:50:16,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:50:16,305 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 483 more)] === [2024-11-28 04:50:16,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:16,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1321252319, now seen corresponding path program 2 times [2024-11-28 04:50:16,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:50:16,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363277939] [2024-11-28 04:50:16,306 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:50:16,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:50:16,981 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 04:50:16,981 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:50:17,698 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-28 04:50:17,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:50:17,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363277939] [2024-11-28 04:50:17,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363277939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:50:17,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:50:17,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 04:50:17,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771159436] [2024-11-28 04:50:17,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:50:17,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:50:17,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:50:17,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:50:17,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:50:17,700 INFO L87 Difference]: Start difference. First operand 1041 states and 1194 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:50:22,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:22,844 INFO L93 Difference]: Finished difference Result 1815 states and 2101 transitions. [2024-11-28 04:50:22,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:50:22,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-28 04:50:22,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:22,855 INFO L225 Difference]: With dead ends: 1815 [2024-11-28 04:50:22,855 INFO L226 Difference]: Without dead ends: 1815 [2024-11-28 04:50:22,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:50:22,858 INFO L435 NwaCegarLoop]: 790 mSDtfsCounter, 980 mSDsluCounter, 1984 mSDsCounter, 0 mSdLazyCounter, 1613 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 980 SdHoareTripleChecker+Valid, 2774 SdHoareTripleChecker+Invalid, 1632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:22,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [980 Valid, 2774 Invalid, 1632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1613 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-28 04:50:22,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1815 states. [2024-11-28 04:50:22,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1815 to 1040. [2024-11-28 04:50:22,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 573 states have (on average 1.9389179755671901) internal successors, (1111), 993 states have internal predecessors, (1111), 48 states have call successors, (48), 13 states have call predecessors, (48), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-28 04:50:22,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1193 transitions. [2024-11-28 04:50:22,901 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1193 transitions. Word has length 23 [2024-11-28 04:50:22,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:22,901 INFO L471 AbstractCegarLoop]: Abstraction has 1040 states and 1193 transitions. [2024-11-28 04:50:22,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:50:22,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1193 transitions. [2024-11-28 04:50:22,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-28 04:50:22,901 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:22,902 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:50:22,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 04:50:22,903 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 483 more)] === [2024-11-28 04:50:22,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:22,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1321252318, now seen corresponding path program 1 times [2024-11-28 04:50:22,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:50:22,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220742797] [2024-11-28 04:50:22,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:22,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:50:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:24,079 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:50:24,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:50:24,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220742797] [2024-11-28 04:50:24,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220742797] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:50:24,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1939451641] [2024-11-28 04:50:24,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:24,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:50:24,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:50:24,084 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:50:24,088 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 04:50:25,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:25,492 INFO L256 TraceCheckSpWp]: Trace formula consists of 1753 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 04:50:25,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:50:25,626 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:50:25,626 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:50:25,901 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 04:50:25,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1939451641] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:50:25,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:50:25,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2024-11-28 04:50:25,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59099441] [2024-11-28 04:50:25,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:50:25,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 04:50:25,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:50:25,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 04:50:25,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-28 04:50:25,903 INFO L87 Difference]: Start difference. First operand 1040 states and 1193 transitions. Second operand has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:50:26,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:26,050 INFO L93 Difference]: Finished difference Result 1064 states and 1217 transitions. [2024-11-28 04:50:26,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 04:50:26,051 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2024-11-28 04:50:26,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:26,055 INFO L225 Difference]: With dead ends: 1064 [2024-11-28 04:50:26,055 INFO L226 Difference]: Without dead ends: 1064 [2024-11-28 04:50:26,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-28 04:50:26,056 INFO L435 NwaCegarLoop]: 1177 mSDtfsCounter, 6 mSDsluCounter, 1182 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2359 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:26,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2359 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-28 04:50:26,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2024-11-28 04:50:26,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 1064. [2024-11-28 04:50:26,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 597 states have (on average 1.9011725293132329) internal successors, (1135), 1017 states have internal predecessors, (1135), 48 states have call successors, (48), 13 states have call predecessors, (48), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-28 04:50:26,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 1217 transitions. [2024-11-28 04:50:26,089 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 1217 transitions. Word has length 23 [2024-11-28 04:50:26,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:26,090 INFO L471 AbstractCegarLoop]: Abstraction has 1064 states and 1217 transitions. [2024-11-28 04:50:26,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.5384615384615383) internal successors, (46), 13 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:50:26,090 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 1217 transitions. [2024-11-28 04:50:26,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-28 04:50:26,092 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:26,092 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:50:26,107 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 04:50:26,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:50:26,293 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 483 more)] === [2024-11-28 04:50:26,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:26,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1334398968, now seen corresponding path program 2 times [2024-11-28 04:50:26,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:50:26,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15265288] [2024-11-28 04:50:26,294 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:50:26,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:50:26,913 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 04:50:26,913 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:50:27,623 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:50:27,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:50:27,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15265288] [2024-11-28 04:50:27,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15265288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:50:27,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:50:27,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:50:27,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871577265] [2024-11-28 04:50:27,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:50:27,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 04:50:27,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:50:27,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 04:50:27,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:50:27,627 INFO L87 Difference]: Start difference. First operand 1064 states and 1217 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:50:31,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:50:38,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:38,003 INFO L93 Difference]: Finished difference Result 2489 states and 2867 transitions. [2024-11-28 04:50:38,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:50:38,004 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2024-11-28 04:50:38,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:38,014 INFO L225 Difference]: With dead ends: 2489 [2024-11-28 04:50:38,014 INFO L226 Difference]: Without dead ends: 2489 [2024-11-28 04:50:38,014 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:50:38,015 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 3421 mSDsluCounter, 1279 mSDsCounter, 0 mSdLazyCounter, 1789 mSolverCounterSat, 146 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3424 SdHoareTripleChecker+Valid, 1844 SdHoareTripleChecker+Invalid, 1936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 1789 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:38,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3424 Valid, 1844 Invalid, 1936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 1789 Invalid, 1 Unknown, 0 Unchecked, 10.2s Time] [2024-11-28 04:50:38,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2489 states. [2024-11-28 04:50:38,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2489 to 1807. [2024-11-28 04:50:38,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1807 states, 1294 states have (on average 1.9884080370942814) internal successors, (2573), 1718 states have internal predecessors, (2573), 81 states have call successors, (81), 27 states have call predecessors, (81), 26 states have return successors, (78), 63 states have call predecessors, (78), 67 states have call successors, (78) [2024-11-28 04:50:38,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1807 states to 1807 states and 2732 transitions. [2024-11-28 04:50:38,084 INFO L78 Accepts]: Start accepts. Automaton has 1807 states and 2732 transitions. Word has length 47 [2024-11-28 04:50:38,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:38,086 INFO L471 AbstractCegarLoop]: Abstraction has 1807 states and 2732 transitions. [2024-11-28 04:50:38,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 04:50:38,087 INFO L276 IsEmpty]: Start isEmpty. Operand 1807 states and 2732 transitions. [2024-11-28 04:50:38,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 04:50:38,089 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:38,089 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:50:38,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 04:50:38,090 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 483 more)] === [2024-11-28 04:50:38,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:38,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1152224059, now seen corresponding path program 1 times [2024-11-28 04:50:38,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:50:38,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093549515] [2024-11-28 04:50:38,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:38,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:50:38,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:39,257 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:50:39,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:50:39,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093549515] [2024-11-28 04:50:39,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093549515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:50:39,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:50:39,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:50:39,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339110218] [2024-11-28 04:50:39,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:50:39,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:50:39,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:50:39,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:50:39,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:50:39,260 INFO L87 Difference]: Start difference. First operand 1807 states and 2732 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:50:43,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:50:45,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:45,523 INFO L93 Difference]: Finished difference Result 1959 states and 2728 transitions. [2024-11-28 04:50:45,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:50:45,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2024-11-28 04:50:45,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:45,530 INFO L225 Difference]: With dead ends: 1959 [2024-11-28 04:50:45,531 INFO L226 Difference]: Without dead ends: 1959 [2024-11-28 04:50:45,531 INFO L434 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 [2024-11-28 04:50:45,531 INFO L435 NwaCegarLoop]: 964 mSDtfsCounter, 409 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 12 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:45,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1628 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 636 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2024-11-28 04:50:45,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1959 states. [2024-11-28 04:50:45,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1959 to 1802. [2024-11-28 04:50:45,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1802 states, 1294 states have (on average 1.9845440494590418) internal successors, (2568), 1713 states have internal predecessors, (2568), 81 states have call successors, (81), 27 states have call predecessors, (81), 26 states have return successors, (78), 63 states have call predecessors, (78), 67 states have call successors, (78) [2024-11-28 04:50:45,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1802 states to 1802 states and 2727 transitions. [2024-11-28 04:50:45,606 INFO L78 Accepts]: Start accepts. Automaton has 1802 states and 2727 transitions. Word has length 55 [2024-11-28 04:50:45,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:45,607 INFO L471 AbstractCegarLoop]: Abstraction has 1802 states and 2727 transitions. [2024-11-28 04:50:45,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:50:45,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1802 states and 2727 transitions. [2024-11-28 04:50:45,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-28 04:50:45,608 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:45,608 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:50:45,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 04:50:45,608 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 483 more)] === [2024-11-28 04:50:45,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:45,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1152224058, now seen corresponding path program 1 times [2024-11-28 04:50:45,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:50:45,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000002378] [2024-11-28 04:50:45,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:45,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:50:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:47,759 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:50:47,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:50:47,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000002378] [2024-11-28 04:50:47,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000002378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:50:47,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:50:47,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 04:50:47,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532009908] [2024-11-28 04:50:47,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:50:47,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:50:47,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:50:47,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:50:47,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:50:47,761 INFO L87 Difference]: Start difference. First operand 1802 states and 2727 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:50:51,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:50:53,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:50:53,721 INFO L93 Difference]: Finished difference Result 1804 states and 2730 transitions. [2024-11-28 04:50:53,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:50:53,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2024-11-28 04:50:53,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:50:53,730 INFO L225 Difference]: With dead ends: 1804 [2024-11-28 04:50:53,732 INFO L226 Difference]: Without dead ends: 1804 [2024-11-28 04:50:53,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:50:53,733 INFO L435 NwaCegarLoop]: 1162 mSDtfsCounter, 488 mSDsluCounter, 3727 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 4889 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2024-11-28 04:50:53,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 4889 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 471 Invalid, 1 Unknown, 0 Unchecked, 5.9s Time] [2024-11-28 04:50:53,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1804 states. [2024-11-28 04:50:53,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1804 to 1801. [2024-11-28 04:50:53,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1801 states, 1294 states have (on average 1.9837712519319939) internal successors, (2567), 1712 states have internal predecessors, (2567), 81 states have call successors, (81), 27 states have call predecessors, (81), 26 states have return successors, (78), 63 states have call predecessors, (78), 67 states have call successors, (78) [2024-11-28 04:50:53,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1801 states to 1801 states and 2726 transitions. [2024-11-28 04:50:53,779 INFO L78 Accepts]: Start accepts. Automaton has 1801 states and 2726 transitions. Word has length 55 [2024-11-28 04:50:53,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:50:53,779 INFO L471 AbstractCegarLoop]: Abstraction has 1801 states and 2726 transitions. [2024-11-28 04:50:53,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:50:53,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1801 states and 2726 transitions. [2024-11-28 04:50:53,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2024-11-28 04:50:53,781 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:50:53,781 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:50:53,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 04:50:53,782 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 483 more)] === [2024-11-28 04:50:53,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:50:53,782 INFO L85 PathProgramCache]: Analyzing trace with hash 841328589, now seen corresponding path program 1 times [2024-11-28 04:50:53,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:50:53,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993677793] [2024-11-28 04:50:53,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:50:53,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:50:54,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:50:55,504 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:50:55,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:50:55,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993677793] [2024-11-28 04:50:55,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993677793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:50:55,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:50:55,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:50:55,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786695711] [2024-11-28 04:50:55,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:50:55,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:50:55,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:50:55,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:50:55,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:50:55,507 INFO L87 Difference]: Start difference. First operand 1801 states and 2726 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:50:59,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:51:03,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:51:07,613 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:51:14,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:51:14,483 INFO L93 Difference]: Finished difference Result 1978 states and 2750 transitions. [2024-11-28 04:51:14,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:51:14,483 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 59 [2024-11-28 04:51:14,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:51:14,492 INFO L225 Difference]: With dead ends: 1978 [2024-11-28 04:51:14,492 INFO L226 Difference]: Without dead ends: 1978 [2024-11-28 04:51:14,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:51:14,494 INFO L435 NwaCegarLoop]: 862 mSDtfsCounter, 875 mSDsluCounter, 1931 mSDsCounter, 0 mSdLazyCounter, 2236 mSolverCounterSat, 20 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 890 SdHoareTripleChecker+Valid, 2793 SdHoareTripleChecker+Invalid, 2259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2236 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:51:14,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [890 Valid, 2793 Invalid, 2259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2236 Invalid, 3 Unknown, 0 Unchecked, 18.8s Time] [2024-11-28 04:51:14,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2024-11-28 04:51:14,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1815. [2024-11-28 04:51:14,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1815 states, 1309 states have (on average 1.9778456837280367) internal successors, (2589), 1726 states have internal predecessors, (2589), 81 states have call successors, (81), 27 states have call predecessors, (81), 26 states have return successors, (78), 63 states have call predecessors, (78), 67 states have call successors, (78) [2024-11-28 04:51:14,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 2748 transitions. [2024-11-28 04:51:14,572 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 2748 transitions. Word has length 59 [2024-11-28 04:51:14,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:51:14,574 INFO L471 AbstractCegarLoop]: Abstraction has 1815 states and 2748 transitions. [2024-11-28 04:51:14,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:51:14,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2748 transitions. [2024-11-28 04:51:14,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-28 04:51:14,577 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:51:14,577 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:51:14,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 04:51:14,578 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 483 more)] === [2024-11-28 04:51:14,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:51:14,579 INFO L85 PathProgramCache]: Analyzing trace with hash 311486081, now seen corresponding path program 1 times [2024-11-28 04:51:14,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:51:14,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118845806] [2024-11-28 04:51:14,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:51:14,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:51:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:51:17,876 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:51:17,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:51:17,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118845806] [2024-11-28 04:51:17,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118845806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:51:17,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:51:17,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-28 04:51:17,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414675546] [2024-11-28 04:51:17,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:51:17,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-28 04:51:17,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:51:17,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-28 04:51:17,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:51:17,882 INFO L87 Difference]: Start difference. First operand 1815 states and 2748 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:51:21,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:51:34,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:51:34,568 INFO L93 Difference]: Finished difference Result 5057 states and 6531 transitions. [2024-11-28 04:51:34,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 04:51:34,569 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2024-11-28 04:51:34,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:51:34,580 INFO L225 Difference]: With dead ends: 5057 [2024-11-28 04:51:34,580 INFO L226 Difference]: Without dead ends: 5057 [2024-11-28 04:51:34,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=50, Invalid=60, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:51:34,581 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 8236 mSDsluCounter, 2700 mSDsCounter, 0 mSdLazyCounter, 3502 mSolverCounterSat, 680 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8240 SdHoareTripleChecker+Valid, 3307 SdHoareTripleChecker+Invalid, 4183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 680 IncrementalHoareTripleChecker+Valid, 3502 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:51:34,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8240 Valid, 3307 Invalid, 4183 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [680 Valid, 3502 Invalid, 1 Unknown, 0 Unchecked, 16.3s Time] [2024-11-28 04:51:34,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5057 states. [2024-11-28 04:51:34,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5057 to 3133. [2024-11-28 04:51:34,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3133 states, 2521 states have (on average 1.940896469654899) internal successors, (4893), 2940 states have internal predecessors, (4893), 160 states have call successors, (160), 61 states have call predecessors, (160), 61 states have return successors, (184), 137 states have call predecessors, (184), 146 states have call successors, (184) [2024-11-28 04:51:34,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3133 states to 3133 states and 5237 transitions. [2024-11-28 04:51:34,664 INFO L78 Accepts]: Start accepts. Automaton has 3133 states and 5237 transitions. Word has length 60 [2024-11-28 04:51:34,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:51:34,665 INFO L471 AbstractCegarLoop]: Abstraction has 3133 states and 5237 transitions. [2024-11-28 04:51:34,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:51:34,665 INFO L276 IsEmpty]: Start isEmpty. Operand 3133 states and 5237 transitions. [2024-11-28 04:51:34,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-28 04:51:34,666 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:51:34,666 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:51:34,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 04:51:34,666 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 483 more)] === [2024-11-28 04:51:34,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:51:34,667 INFO L85 PathProgramCache]: Analyzing trace with hash -1407898308, now seen corresponding path program 1 times [2024-11-28 04:51:34,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:51:34,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117120073] [2024-11-28 04:51:34,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:51:34,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:51:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:51:36,135 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:51:36,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:51:36,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117120073] [2024-11-28 04:51:36,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117120073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:51:36,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:51:36,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 04:51:36,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044536900] [2024-11-28 04:51:36,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:51:36,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 04:51:36,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:51:36,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 04:51:36,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:51:36,137 INFO L87 Difference]: Start difference. First operand 3133 states and 5237 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:51:40,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:51:42,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:51:42,384 INFO L93 Difference]: Finished difference Result 3289 states and 5236 transitions. [2024-11-28 04:51:42,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 04:51:42,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2024-11-28 04:51:42,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:51:42,413 INFO L225 Difference]: With dead ends: 3289 [2024-11-28 04:51:42,413 INFO L226 Difference]: Without dead ends: 3289 [2024-11-28 04:51:42,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 04:51:42,414 INFO L435 NwaCegarLoop]: 959 mSDtfsCounter, 406 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 1614 SdHoareTripleChecker+Invalid, 635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2024-11-28 04:51:42,414 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 1614 Invalid, 635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 626 Invalid, 1 Unknown, 0 Unchecked, 6.2s Time] [2024-11-28 04:51:42,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2024-11-28 04:51:42,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 3132. [2024-11-28 04:51:42,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3132 states, 2521 states have (on average 1.9401031336771122) internal successors, (4891), 2939 states have internal predecessors, (4891), 160 states have call successors, (160), 61 states have call predecessors, (160), 61 states have return successors, (184), 137 states have call predecessors, (184), 146 states have call successors, (184) [2024-11-28 04:51:42,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 5235 transitions. [2024-11-28 04:51:42,486 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 5235 transitions. Word has length 62 [2024-11-28 04:51:42,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:51:42,487 INFO L471 AbstractCegarLoop]: Abstraction has 3132 states and 5235 transitions. [2024-11-28 04:51:42,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:51:42,487 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 5235 transitions. [2024-11-28 04:51:42,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-28 04:51:42,488 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:51:42,488 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:51:42,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 04:51:42,488 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 483 more)] === [2024-11-28 04:51:42,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:51:42,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1407898307, now seen corresponding path program 1 times [2024-11-28 04:51:42,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:51:42,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009408553] [2024-11-28 04:51:42,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:51:42,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:51:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:51:44,860 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:51:44,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:51:44,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009408553] [2024-11-28 04:51:44,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009408553] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:51:44,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:51:44,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:51:44,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591240705] [2024-11-28 04:51:44,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:51:44,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:51:44,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:51:44,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:51:44,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:51:44,863 INFO L87 Difference]: Start difference. First operand 3132 states and 5235 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:51:48,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:51:52,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:51:56,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:52:00,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:52:05,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:52:08,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:52:08,770 INFO L93 Difference]: Finished difference Result 3138 states and 5236 transitions. [2024-11-28 04:52:08,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:52:08,771 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2024-11-28 04:52:08,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:52:08,786 INFO L225 Difference]: With dead ends: 3138 [2024-11-28 04:52:08,786 INFO L226 Difference]: Without dead ends: 3138 [2024-11-28 04:52:08,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:52:08,787 INFO L435 NwaCegarLoop]: 1146 mSDtfsCounter, 38 mSDsluCounter, 1274 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 2420 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.8s IncrementalHoareTripleChecker+Time [2024-11-28 04:52:08,787 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 2420 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1064 Invalid, 5 Unknown, 0 Unchecked, 23.8s Time] [2024-11-28 04:52:08,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3138 states. [2024-11-28 04:52:08,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3138 to 3132. [2024-11-28 04:52:08,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3132 states, 2521 states have (on average 1.939706465688219) internal successors, (4890), 2939 states have internal predecessors, (4890), 160 states have call successors, (160), 61 states have call predecessors, (160), 61 states have return successors, (184), 137 states have call predecessors, (184), 146 states have call successors, (184) [2024-11-28 04:52:08,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 5234 transitions. [2024-11-28 04:52:08,887 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 5234 transitions. Word has length 62 [2024-11-28 04:52:08,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:52:08,887 INFO L471 AbstractCegarLoop]: Abstraction has 3132 states and 5234 transitions. [2024-11-28 04:52:08,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:52:08,888 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 5234 transitions. [2024-11-28 04:52:08,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-28 04:52:08,888 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:52:08,889 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:52:08,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 04:52:08,889 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 483 more)] === [2024-11-28 04:52:08,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:52:08,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1309205566, now seen corresponding path program 1 times [2024-11-28 04:52:08,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:52:08,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324692367] [2024-11-28 04:52:08,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:52:08,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:52:09,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:52:10,249 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:52:10,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:52:10,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324692367] [2024-11-28 04:52:10,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324692367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:52:10,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:52:10,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 04:52:10,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029836004] [2024-11-28 04:52:10,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:52:10,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-28 04:52:10,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:52:10,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-28 04:52:10,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-28 04:52:10,252 INFO L87 Difference]: Start difference. First operand 3132 states and 5234 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:52:14,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:52:18,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:52:21,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:52:21,805 INFO L93 Difference]: Finished difference Result 3283 states and 5229 transitions. [2024-11-28 04:52:21,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 04:52:21,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2024-11-28 04:52:21,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:52:21,818 INFO L225 Difference]: With dead ends: 3283 [2024-11-28 04:52:21,818 INFO L226 Difference]: Without dead ends: 3283 [2024-11-28 04:52:21,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-28 04:52:21,819 INFO L435 NwaCegarLoop]: 950 mSDtfsCounter, 432 mSDsluCounter, 1334 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 18 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 2284 SdHoareTripleChecker+Invalid, 1094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2024-11-28 04:52:21,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 2284 Invalid, 1094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1074 Invalid, 2 Unknown, 0 Unchecked, 11.5s Time] [2024-11-28 04:52:21,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3283 states. [2024-11-28 04:52:21,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3283 to 3126. [2024-11-28 04:52:21,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3126 states, 2521 states have (on average 1.9373264577548592) internal successors, (4884), 2933 states have internal predecessors, (4884), 160 states have call successors, (160), 61 states have call predecessors, (160), 61 states have return successors, (184), 137 states have call predecessors, (184), 146 states have call successors, (184) [2024-11-28 04:52:21,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 5228 transitions. [2024-11-28 04:52:21,883 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 5228 transitions. Word has length 62 [2024-11-28 04:52:21,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:52:21,884 INFO L471 AbstractCegarLoop]: Abstraction has 3126 states and 5228 transitions. [2024-11-28 04:52:21,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:52:21,884 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 5228 transitions. [2024-11-28 04:52:21,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-28 04:52:21,884 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:52:21,885 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:52:21,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-28 04:52:21,885 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 483 more)] === [2024-11-28 04:52:21,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:52:21,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1309205565, now seen corresponding path program 1 times [2024-11-28 04:52:21,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:52:21,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955204792] [2024-11-28 04:52:21,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:52:21,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:52:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:52:23,086 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:52:23,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:52:23,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955204792] [2024-11-28 04:52:23,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955204792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:52:23,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:52:23,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:52:23,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401550109] [2024-11-28 04:52:23,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:52:23,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 04:52:23,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:52:23,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 04:52:23,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:52:23,091 INFO L87 Difference]: Start difference. First operand 3126 states and 5228 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:52:23,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:52:23,530 INFO L93 Difference]: Finished difference Result 3131 states and 5228 transitions. [2024-11-28 04:52:23,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:52:23,531 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2024-11-28 04:52:23,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:52:23,541 INFO L225 Difference]: With dead ends: 3131 [2024-11-28 04:52:23,541 INFO L226 Difference]: Without dead ends: 3131 [2024-11-28 04:52:23,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-28 04:52:23,542 INFO L435 NwaCegarLoop]: 1141 mSDtfsCounter, 492 mSDsluCounter, 4063 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 5204 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:52:23,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 5204 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-28 04:52:23,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states. [2024-11-28 04:52:23,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 3126. [2024-11-28 04:52:23,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3126 states, 2521 states have (on average 1.9369297897659659) internal successors, (4883), 2933 states have internal predecessors, (4883), 160 states have call successors, (160), 61 states have call predecessors, (160), 61 states have return successors, (184), 137 states have call predecessors, (184), 146 states have call successors, (184) [2024-11-28 04:52:23,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3126 states to 3126 states and 5227 transitions. [2024-11-28 04:52:23,606 INFO L78 Accepts]: Start accepts. Automaton has 3126 states and 5227 transitions. Word has length 62 [2024-11-28 04:52:23,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:52:23,607 INFO L471 AbstractCegarLoop]: Abstraction has 3126 states and 5227 transitions. [2024-11-28 04:52:23,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:52:23,607 INFO L276 IsEmpty]: Start isEmpty. Operand 3126 states and 5227 transitions. [2024-11-28 04:52:23,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-28 04:52:23,607 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:52:23,608 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 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] [2024-11-28 04:52:23,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 04:52:23,608 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 483 more)] === [2024-11-28 04:52:23,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:52:23,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1953402100, now seen corresponding path program 1 times [2024-11-28 04:52:23,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:52:23,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102005711] [2024-11-28 04:52:23,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:52:23,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:52:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:52:25,638 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:52:25,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:52:25,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102005711] [2024-11-28 04:52:25,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102005711] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:52:25,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:52:25,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:52:25,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131029685] [2024-11-28 04:52:25,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:52:25,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:52:25,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:52:25,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:52:25,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:52:25,641 INFO L87 Difference]: Start difference. First operand 3126 states and 5227 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:52:29,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:52:33,706 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:52:37,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:52:37,186 INFO L93 Difference]: Finished difference Result 3125 states and 5225 transitions. [2024-11-28 04:52:37,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:52:37,187 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2024-11-28 04:52:37,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:52:37,198 INFO L225 Difference]: With dead ends: 3125 [2024-11-28 04:52:37,198 INFO L226 Difference]: Without dead ends: 3125 [2024-11-28 04:52:37,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:52:37,199 INFO L435 NwaCegarLoop]: 1135 mSDtfsCounter, 468 mSDsluCounter, 2389 mSDsCounter, 0 mSdLazyCounter, 1089 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 480 SdHoareTripleChecker+Valid, 3524 SdHoareTripleChecker+Invalid, 1092 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1089 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2024-11-28 04:52:37,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [480 Valid, 3524 Invalid, 1092 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1089 Invalid, 2 Unknown, 0 Unchecked, 11.4s Time] [2024-11-28 04:52:37,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2024-11-28 04:52:37,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 3125. [2024-11-28 04:52:37,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3125 states, 2521 states have (on average 1.9361364537881793) internal successors, (4881), 2932 states have internal predecessors, (4881), 160 states have call successors, (160), 61 states have call predecessors, (160), 61 states have return successors, (184), 137 states have call predecessors, (184), 146 states have call successors, (184) [2024-11-28 04:52:37,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3125 states to 3125 states and 5225 transitions. [2024-11-28 04:52:37,256 INFO L78 Accepts]: Start accepts. Automaton has 3125 states and 5225 transitions. Word has length 65 [2024-11-28 04:52:37,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:52:37,256 INFO L471 AbstractCegarLoop]: Abstraction has 3125 states and 5225 transitions. [2024-11-28 04:52:37,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:52:37,257 INFO L276 IsEmpty]: Start isEmpty. Operand 3125 states and 5225 transitions. [2024-11-28 04:52:37,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-28 04:52:37,257 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:52:37,257 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 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] [2024-11-28 04:52:37,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 04:52:37,258 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 483 more)] === [2024-11-28 04:52:37,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:52:37,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1953402099, now seen corresponding path program 1 times [2024-11-28 04:52:37,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:52:37,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677855041] [2024-11-28 04:52:37,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:52:37,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:52:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:52:38,754 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:52:38,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:52:38,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677855041] [2024-11-28 04:52:38,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677855041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:52:38,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:52:38,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 04:52:38,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813911877] [2024-11-28 04:52:38,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:52:38,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 04:52:38,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:52:38,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 04:52:38,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-28 04:52:38,756 INFO L87 Difference]: Start difference. First operand 3125 states and 5225 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:52:42,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:52:46,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:52:50,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:52:50,980 INFO L93 Difference]: Finished difference Result 3124 states and 5223 transitions. [2024-11-28 04:52:50,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 04:52:50,981 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2024-11-28 04:52:50,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:52:50,991 INFO L225 Difference]: With dead ends: 3124 [2024-11-28 04:52:50,992 INFO L226 Difference]: Without dead ends: 3124 [2024-11-28 04:52:50,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-28 04:52:50,992 INFO L435 NwaCegarLoop]: 1135 mSDtfsCounter, 464 mSDsluCounter, 2563 mSDsCounter, 0 mSdLazyCounter, 1388 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 476 SdHoareTripleChecker+Valid, 3698 SdHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1388 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.1s IncrementalHoareTripleChecker+Time [2024-11-28 04:52:50,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [476 Valid, 3698 Invalid, 1391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1388 Invalid, 2 Unknown, 0 Unchecked, 12.1s Time] [2024-11-28 04:52:50,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states. [2024-11-28 04:52:51,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 3124. [2024-11-28 04:52:51,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3124 states, 2521 states have (on average 1.9353431178103928) internal successors, (4879), 2931 states have internal predecessors, (4879), 160 states have call successors, (160), 61 states have call predecessors, (160), 61 states have return successors, (184), 137 states have call predecessors, (184), 146 states have call successors, (184) [2024-11-28 04:52:51,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3124 states to 3124 states and 5223 transitions. [2024-11-28 04:52:51,049 INFO L78 Accepts]: Start accepts. Automaton has 3124 states and 5223 transitions. Word has length 65 [2024-11-28 04:52:51,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:52:51,050 INFO L471 AbstractCegarLoop]: Abstraction has 3124 states and 5223 transitions. [2024-11-28 04:52:51,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:52:51,050 INFO L276 IsEmpty]: Start isEmpty. Operand 3124 states and 5223 transitions. [2024-11-28 04:52:51,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 04:52:51,051 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:52:51,051 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 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] [2024-11-28 04:52:51,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 04:52:51,051 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 483 more)] === [2024-11-28 04:52:51,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:52:51,051 INFO L85 PathProgramCache]: Analyzing trace with hash -279386971, now seen corresponding path program 1 times [2024-11-28 04:52:51,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:52:51,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576834161] [2024-11-28 04:52:51,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:52:51,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:52:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:52:53,061 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:52:53,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:52:53,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576834161] [2024-11-28 04:52:53,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576834161] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:52:53,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:52:53,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-28 04:52:53,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402135556] [2024-11-28 04:52:53,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:52:53,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-28 04:52:53,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:52:53,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-28 04:52:53,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-28 04:52:53,063 INFO L87 Difference]: Start difference. First operand 3124 states and 5223 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:52:57,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:53:01,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:53:05,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:53:09,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:53:13,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:53:19,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:53:19,720 INFO L93 Difference]: Finished difference Result 3291 states and 5238 transitions. [2024-11-28 04:53:19,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:53:19,721 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2024-11-28 04:53:19,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:53:19,732 INFO L225 Difference]: With dead ends: 3291 [2024-11-28 04:53:19,732 INFO L226 Difference]: Without dead ends: 3291 [2024-11-28 04:53:19,732 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-11-28 04:53:19,733 INFO L435 NwaCegarLoop]: 947 mSDtfsCounter, 1205 mSDsluCounter, 4949 mSDsCounter, 0 mSdLazyCounter, 2126 mSolverCounterSat, 20 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1220 SdHoareTripleChecker+Valid, 5896 SdHoareTripleChecker+Invalid, 2151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2126 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.3s IncrementalHoareTripleChecker+Time [2024-11-28 04:53:19,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1220 Valid, 5896 Invalid, 2151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2126 Invalid, 5 Unknown, 0 Unchecked, 26.3s Time] [2024-11-28 04:53:19,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3291 states. [2024-11-28 04:53:19,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3291 to 3132. [2024-11-28 04:53:19,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3132 states, 2529 states have (on average 1.9343614076710163) internal successors, (4892), 2939 states have internal predecessors, (4892), 160 states have call successors, (160), 61 states have call predecessors, (160), 61 states have return successors, (184), 137 states have call predecessors, (184), 146 states have call successors, (184) [2024-11-28 04:53:19,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 5236 transitions. [2024-11-28 04:53:19,793 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 5236 transitions. Word has length 70 [2024-11-28 04:53:19,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:53:19,793 INFO L471 AbstractCegarLoop]: Abstraction has 3132 states and 5236 transitions. [2024-11-28 04:53:19,793 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:53:19,793 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 5236 transitions. [2024-11-28 04:53:19,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-28 04:53:19,794 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:53:19,794 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 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] [2024-11-28 04:53:19,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 04:53:19,795 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 483 more)] === [2024-11-28 04:53:19,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:53:19,795 INFO L85 PathProgramCache]: Analyzing trace with hash -279386970, now seen corresponding path program 1 times [2024-11-28 04:53:19,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:53:19,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050940096] [2024-11-28 04:53:19,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:53:19,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:53:20,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:53:22,217 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:53:22,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:53:22,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050940096] [2024-11-28 04:53:22,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050940096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 04:53:22,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 04:53:22,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-28 04:53:22,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058090338] [2024-11-28 04:53:22,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 04:53:22,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-28 04:53:22,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:53:22,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-28 04:53:22,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-28 04:53:22,219 INFO L87 Difference]: Start difference. First operand 3132 states and 5236 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:53:26,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:53:30,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:53:34,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:53:38,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:53:42,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:53:46,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:53:50,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:54:00,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:54:00,322 INFO L93 Difference]: Finished difference Result 3289 states and 5233 transitions. [2024-11-28 04:54:00,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-28 04:54:00,322 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2024-11-28 04:54:00,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:54:00,330 INFO L225 Difference]: With dead ends: 3289 [2024-11-28 04:54:00,330 INFO L226 Difference]: Without dead ends: 3289 [2024-11-28 04:54:00,330 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2024-11-28 04:54:00,331 INFO L435 NwaCegarLoop]: 948 mSDtfsCounter, 805 mSDsluCounter, 4490 mSDsCounter, 0 mSdLazyCounter, 3251 mSolverCounterSat, 16 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 5438 SdHoareTripleChecker+Invalid, 3274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 3251 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 37.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:54:00,331 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 5438 Invalid, 3274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 3251 Invalid, 7 Unknown, 0 Unchecked, 37.7s Time] [2024-11-28 04:54:00,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3289 states. [2024-11-28 04:54:00,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3289 to 3132. [2024-11-28 04:54:00,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3132 states, 2529 states have (on average 1.9327797548438117) internal successors, (4888), 2939 states have internal predecessors, (4888), 160 states have call successors, (160), 61 states have call predecessors, (160), 61 states have return successors, (184), 137 states have call predecessors, (184), 146 states have call successors, (184) [2024-11-28 04:54:00,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3132 states to 3132 states and 5232 transitions. [2024-11-28 04:54:00,385 INFO L78 Accepts]: Start accepts. Automaton has 3132 states and 5232 transitions. Word has length 70 [2024-11-28 04:54:00,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:54:00,385 INFO L471 AbstractCegarLoop]: Abstraction has 3132 states and 5232 transitions. [2024-11-28 04:54:00,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:54:00,385 INFO L276 IsEmpty]: Start isEmpty. Operand 3132 states and 5232 transitions. [2024-11-28 04:54:00,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 04:54:00,386 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:54:00,386 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:54:00,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 04:54:00,386 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 483 more)] === [2024-11-28 04:54:00,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:54:00,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1559960516, now seen corresponding path program 1 times [2024-11-28 04:54:00,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:54:00,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523902571] [2024-11-28 04:54:00,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:54:00,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:54:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:54:02,148 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:54:02,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:54:02,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523902571] [2024-11-28 04:54:02,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523902571] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:54:02,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [25976067] [2024-11-28 04:54:02,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:54:02,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:54:02,149 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:54:02,153 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:54:02,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 04:54:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:54:03,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 2117 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-28 04:54:03,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:54:03,901 INFO L378 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 10 treesize of output 8 [2024-11-28 04:54:04,038 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-28 04:54:04,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-28 04:54:04,201 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-28 04:54:04,414 INFO L378 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 34 treesize of output 27 [2024-11-28 04:54:04,733 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 04:54:04,733 INFO L378 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 50 treesize of output 49 [2024-11-28 04:54:04,960 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 04:54:04,960 INFO L378 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 50 treesize of output 49 [2024-11-28 04:54:05,052 INFO L378 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 13 [2024-11-28 04:54:05,212 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-11-28 04:54:05,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:54:05,261 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11542 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem361#1.base| v_ArrVal_11542) |c_ULTIMATE.start_main_~argv~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) 1)) is different from false [2024-11-28 04:54:05,293 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11542 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_11542) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) 1)) is different from false [2024-11-28 04:54:05,335 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_11542 (Array Int Int)) (v_ArrVal_11541 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem360#1.base| v_ArrVal_11541))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_11542)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) 1)) is different from false [2024-11-28 04:54:09,707 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:54:09,708 INFO L378 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 106 treesize of output 71 [2024-11-28 04:54:09,720 INFO L378 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 3400 treesize of output 2712 [2024-11-28 04:54:09,753 INFO L378 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 146 treesize of output 110 [2024-11-28 04:54:09,763 INFO L378 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 110 treesize of output 98 [2024-11-28 04:54:09,775 INFO L378 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 57 treesize of output 39 [2024-11-28 04:54:13,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:54:13,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 121 treesize of output 461 [2024-11-28 04:54:21,274 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 4 not checked. [2024-11-28 04:54:21,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [25976067] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:54:21,275 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:54:21,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 11] total 23 [2024-11-28 04:54:21,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585863265] [2024-11-28 04:54:21,275 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:54:21,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-28 04:54:21,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:54:21,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-28 04:54:21,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=333, Unknown=17, NotChecked=120, Total=552 [2024-11-28 04:54:21,276 INFO L87 Difference]: Start difference. First operand 3132 states and 5232 transitions. Second operand has 24 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 24 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:54:25,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:54:29,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:54:33,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 04:54:37,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:54:41,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:54:45,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:54:49,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:54:53,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:54:57,490 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:55:01,506 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:55:05,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:55:09,545 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:55:13,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:55:30,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:55:30,403 INFO L93 Difference]: Finished difference Result 3288 states and 5231 transitions. [2024-11-28 04:55:30,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 04:55:30,404 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 24 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2024-11-28 04:55:30,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:55:30,413 INFO L225 Difference]: With dead ends: 3288 [2024-11-28 04:55:30,413 INFO L226 Difference]: Without dead ends: 3288 [2024-11-28 04:55:30,413 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 137 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=112, Invalid=389, Unknown=17, NotChecked=132, Total=650 [2024-11-28 04:55:30,417 INFO L435 NwaCegarLoop]: 947 mSDtfsCounter, 1206 mSDsluCounter, 9956 mSDsCounter, 0 mSdLazyCounter, 5082 mSolverCounterSat, 23 mSolverCounterUnsat, 13 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 67.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 10903 SdHoareTripleChecker+Invalid, 8295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 5082 IncrementalHoareTripleChecker+Invalid, 13 IncrementalHoareTripleChecker+Unknown, 3177 IncrementalHoareTripleChecker+Unchecked, 68.7s IncrementalHoareTripleChecker+Time [2024-11-28 04:55:30,417 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1221 Valid, 10903 Invalid, 8295 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 5082 Invalid, 13 Unknown, 3177 Unchecked, 68.7s Time] [2024-11-28 04:55:30,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3288 states. [2024-11-28 04:55:30,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3288 to 3131. [2024-11-28 04:55:30,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3131 states, 2529 states have (on average 1.9319889284302096) internal successors, (4886), 2938 states have internal predecessors, (4886), 160 states have call successors, (160), 61 states have call predecessors, (160), 61 states have return successors, (184), 137 states have call predecessors, (184), 146 states have call successors, (184) [2024-11-28 04:55:30,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3131 states to 3131 states and 5230 transitions. [2024-11-28 04:55:30,474 INFO L78 Accepts]: Start accepts. Automaton has 3131 states and 5230 transitions. Word has length 75 [2024-11-28 04:55:30,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:55:30,475 INFO L471 AbstractCegarLoop]: Abstraction has 3131 states and 5230 transitions. [2024-11-28 04:55:30,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.0434782608695654) internal successors, (70), 24 states have internal predecessors, (70), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:55:30,475 INFO L276 IsEmpty]: Start isEmpty. Operand 3131 states and 5230 transitions. [2024-11-28 04:55:30,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-28 04:55:30,475 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:55:30,476 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:55:30,492 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 04:55:30,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:55:30,677 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 483 more)] === [2024-11-28 04:55:30,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:55:30,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1559960517, now seen corresponding path program 1 times [2024-11-28 04:55:30,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:55:30,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363843113] [2024-11-28 04:55:30,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:55:30,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:55:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:55:33,416 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:55:33,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:55:33,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363843113] [2024-11-28 04:55:33,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363843113] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:55:33,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1762725080] [2024-11-28 04:55:33,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 04:55:33,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:55:33,417 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:55:33,418 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:55:33,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 04:55:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 04:55:35,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 2117 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-28 04:55:35,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 04:55:35,344 INFO L378 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 10 treesize of output 8 [2024-11-28 04:55:35,415 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 04:55:35,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 04:55:35,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 04:55:35,539 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-28 04:55:35,553 INFO L378 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 15 treesize of output 11 [2024-11-28 04:55:35,707 INFO L378 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 34 treesize of output 27 [2024-11-28 04:55:35,716 INFO L378 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 15 [2024-11-28 04:55:36,029 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 04:55:36,029 INFO L378 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 74 treesize of output 69 [2024-11-28 04:55:36,046 INFO L378 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 36 treesize of output 15 [2024-11-28 04:55:36,439 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 04:55:36,440 INFO L378 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 74 treesize of output 69 [2024-11-28 04:55:36,458 INFO L378 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 36 treesize of output 15 [2024-11-28 04:55:36,675 INFO L378 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 13 [2024-11-28 04:55:36,691 INFO L378 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 11 treesize of output 3 [2024-11-28 04:55:36,824 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:55:36,824 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 04:55:37,171 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_12572 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem361#1.base| v_ArrVal_12572) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 1))) (forall ((v_ArrVal_12571 (Array Int Int)) (v_ArrVal_12572 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem361#1.base| v_ArrVal_12572) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem361#1.base| v_ArrVal_12571) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))))) is different from false [2024-11-28 04:55:37,228 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_12572 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12572) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_12571 (Array Int Int)) (v_ArrVal_12572 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12572) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12571) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2024-11-28 04:55:37,284 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_12572 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12572) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))) (forall ((v_ArrVal_12571 (Array Int Int)) (v_ArrVal_12572 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12572) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12571) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2024-11-28 04:55:37,320 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_12571 (Array Int Int)) (v_ArrVal_12572 (Array Int Int)) (v_ArrVal_12569 (Array Int Int)) (v_ArrVal_12570 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem360#1.base| v_ArrVal_12570))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ 2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem360#1.base| v_ArrVal_12569) .cse0 v_ArrVal_12572) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_12571) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_12572 (Array Int Int)) (v_ArrVal_12569 (Array Int Int)) (v_ArrVal_12570 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem360#1.base| v_ArrVal_12569) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem360#1.base| v_ArrVal_12570) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_12572) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 1))))) is different from false [2024-11-28 04:55:37,355 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_12571 (Array Int Int)) (v_ArrVal_12572 (Array Int Int)) (v_ArrVal_12569 (Array Int Int)) (v_ArrVal_12570 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12570))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12569) .cse1 v_ArrVal_12572) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 2) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_12571) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_12572 (Array Int Int)) (v_ArrVal_12569 (Array Int Int)) (v_ArrVal_12570 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_12569) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_12570) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_12572) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1)))))) is different from false [2024-11-28 04:55:37,437 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_12572 (Array Int Int)) (v_ArrVal_12567 (Array Int Int)) (v_ArrVal_12568 (Array Int Int)) (v_ArrVal_12569 (Array Int Int)) (v_ArrVal_12570 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_12567))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_12568) .cse0 v_ArrVal_12569) (select (select (store .cse1 .cse0 v_ArrVal_12570) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_12572))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 1))) (forall ((v_ArrVal_12571 (Array Int Int)) (v_ArrVal_12572 (Array Int Int)) (v_ArrVal_12567 (Array Int Int)) (v_ArrVal_12568 (Array Int Int)) (v_ArrVal_12569 (Array Int Int)) (v_ArrVal_12570 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_12567))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_12570))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ 2 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_12568) .cse3 v_ArrVal_12569) .cse4 v_ArrVal_12572) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_12571) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))))) is different from false [2024-11-28 04:55:37,507 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:55:37,507 INFO L378 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 106 treesize of output 107 [2024-11-28 04:55:37,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:55:37,526 INFO L378 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 94 treesize of output 71 [2024-11-28 04:55:37,537 INFO L378 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 454 treesize of output 374 [2024-11-28 04:55:37,555 INFO L378 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 1130 treesize of output 1074 [2024-11-28 04:55:37,572 INFO L378 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 146 treesize of output 122 [2024-11-28 04:55:37,581 INFO L378 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 122 treesize of output 110 [2024-11-28 04:55:37,590 INFO L378 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 110 treesize of output 98 [2024-11-28 04:55:37,601 INFO L378 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 57 treesize of output 45 [2024-11-28 04:55:37,612 INFO L378 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 45 treesize of output 39 [2024-11-28 04:55:37,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:55:37,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 209 treesize of output 210 [2024-11-28 04:55:37,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 04:55:37,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 197 treesize of output 126 [2024-11-28 04:55:37,739 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:55:37,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 554 treesize of output 354 [2024-11-28 04:55:37,755 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:55:37,756 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 04:55:37,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 12 [2024-11-28 04:55:38,052 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 04:55:38,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-28 04:55:38,072 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 4 not checked. [2024-11-28 04:55:38,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1762725080] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 04:55:38,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 04:55:38,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 13] total 31 [2024-11-28 04:55:38,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993591080] [2024-11-28 04:55:38,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 04:55:38,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-28 04:55:38,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 04:55:38,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-28 04:55:38,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=564, Unknown=6, NotChecked=318, Total=992 [2024-11-28 04:55:38,074 INFO L87 Difference]: Start difference. First operand 3131 states and 5230 transitions. Second operand has 32 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 32 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:55:42,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:55:46,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:55:50,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:55:54,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:55:58,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:56:02,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:56:06,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:56:10,261 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:56:14,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:56:18,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:56:22,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:56:26,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:56:30,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:56:34,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:56:38,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 04:56:42,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:56:46,502 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:56:50,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:56:54,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:56:58,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:57:02,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:57:06,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 04:57:30,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-28 04:57:30,216 INFO L93 Difference]: Finished difference Result 3298 states and 5242 transitions. [2024-11-28 04:57:30,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 04:57:30,216 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 32 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2024-11-28 04:57:30,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-28 04:57:30,223 INFO L225 Difference]: With dead ends: 3298 [2024-11-28 04:57:30,223 INFO L226 Difference]: Without dead ends: 3298 [2024-11-28 04:57:30,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=199, Invalid=875, Unknown=6, NotChecked=402, Total=1482 [2024-11-28 04:57:30,224 INFO L435 NwaCegarLoop]: 948 mSDtfsCounter, 1217 mSDsluCounter, 13017 mSDsCounter, 0 mSdLazyCounter, 7988 mSolverCounterSat, 32 mSolverCounterUnsat, 22 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 109.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1232 SdHoareTripleChecker+Valid, 13965 SdHoareTripleChecker+Invalid, 14259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 7988 IncrementalHoareTripleChecker+Invalid, 22 IncrementalHoareTripleChecker+Unknown, 6217 IncrementalHoareTripleChecker+Unchecked, 110.9s IncrementalHoareTripleChecker+Time [2024-11-28 04:57:30,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1232 Valid, 13965 Invalid, 14259 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [32 Valid, 7988 Invalid, 22 Unknown, 6217 Unchecked, 110.9s Time] [2024-11-28 04:57:30,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2024-11-28 04:57:30,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 3141. [2024-11-28 04:57:30,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3141 states, 2539 states have (on average 1.928712091374557) internal successors, (4897), 2948 states have internal predecessors, (4897), 160 states have call successors, (160), 61 states have call predecessors, (160), 61 states have return successors, (184), 137 states have call predecessors, (184), 146 states have call successors, (184) [2024-11-28 04:57:30,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3141 states to 3141 states and 5241 transitions. [2024-11-28 04:57:30,278 INFO L78 Accepts]: Start accepts. Automaton has 3141 states and 5241 transitions. Word has length 75 [2024-11-28 04:57:30,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-28 04:57:30,279 INFO L471 AbstractCegarLoop]: Abstraction has 3141 states and 5241 transitions. [2024-11-28 04:57:30,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 32 states have internal predecessors, (76), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 04:57:30,279 INFO L276 IsEmpty]: Start isEmpty. Operand 3141 states and 5241 transitions. [2024-11-28 04:57:30,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-28 04:57:30,280 INFO L210 NwaCegarLoop]: Found error trace [2024-11-28 04:57:30,280 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 04:57:30,300 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 04:57:30,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-28 04:57:30,481 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, #Ultimate.C_strcpyErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, #Ultimate.C_strcpyErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 483 more)] === [2024-11-28 04:57:30,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 04:57:30,481 INFO L85 PathProgramCache]: Analyzing trace with hash 873037830, now seen corresponding path program 2 times [2024-11-28 04:57:30,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 04:57:30,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495043012] [2024-11-28 04:57:30,482 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:57:30,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 04:57:31,153 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 04:57:31,154 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 04:57:33,704 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 04:57:33,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 04:57:33,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495043012] [2024-11-28 04:57:33,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495043012] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 04:57:33,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863527581] [2024-11-28 04:57:33,704 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 04:57:33,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 04:57:33,705 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 04:57:33,709 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 04:57:33,711 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b4649241-7dae-4893-bd97-174716e577bc/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 05:02:22,969 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-28 05:02:22,969 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 05:02:22,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 2150 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-28 05:02:23,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 05:02:23,012 INFO L378 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 10 treesize of output 8 [2024-11-28 05:02:23,090 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 05:02:23,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 05:02:23,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 05:02:23,230 INFO L378 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 15 treesize of output 11 [2024-11-28 05:02:23,247 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-28 05:02:23,429 INFO L378 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 34 treesize of output 27 [2024-11-28 05:02:23,459 INFO L378 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 15 [2024-11-28 05:02:23,722 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 05:02:23,722 INFO L378 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 74 treesize of output 69 [2024-11-28 05:02:23,749 INFO L378 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 36 treesize of output 15 [2024-11-28 05:02:24,124 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 05:02:24,124 INFO L378 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 74 treesize of output 69 [2024-11-28 05:02:24,142 INFO L378 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 36 treesize of output 15 [2024-11-28 05:02:24,542 INFO L349 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2024-11-28 05:02:24,542 INFO L378 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 74 treesize of output 69 [2024-11-28 05:02:24,566 INFO L378 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 36 treesize of output 15 [2024-11-28 05:02:24,758 INFO L378 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 13 [2024-11-28 05:02:24,775 INFO L378 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 11 treesize of output 3 [2024-11-28 05:02:24,887 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2024-11-28 05:02:24,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 05:02:25,235 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_13620 (Array Int Int)) (v_ArrVal_13619 (Array Int Int))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem361#1.base| v_ArrVal_13619) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem361#1.base| v_ArrVal_13620) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)))) (forall ((v_ArrVal_13619 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem361#1.base| v_ArrVal_13619) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) 1))))) is different from false [2024-11-28 05:02:25,278 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (and (forall ((v_ArrVal_13619 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_13619) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 1))) (forall ((v_ArrVal_13620 (Array Int Int)) (v_ArrVal_13619 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_13619) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) |c_ULTIMATE.start_main_~j~0#1| 2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_13620) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))))))) is different from false [2024-11-28 05:02:25,576 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_13620 (Array Int Int)) (v_ArrVal_13617 (Array Int Int)) (v_ArrVal_13618 (Array Int Int)) (v_ArrVal_13619 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem361#1.base| v_ArrVal_13618))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem361#1.base| v_ArrVal_13617) .cse0 v_ArrVal_13619) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) 3) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_13620) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_13617 (Array Int Int)) (v_ArrVal_13618 (Array Int Int)) (v_ArrVal_13619 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem361#1.base| v_ArrVal_13617) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem361#1.base| v_ArrVal_13618) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_13619) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) is different from false [2024-11-28 05:02:25,636 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_13620 (Array Int Int)) (v_ArrVal_13617 (Array Int Int)) (v_ArrVal_13618 (Array Int Int)) (v_ArrVal_13619 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_13618))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ |c_ULTIMATE.start_main_~j~0#1| 3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_13617) .cse1 v_ArrVal_13619) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_13620) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_13617 (Array Int Int)) (v_ArrVal_13618 (Array Int Int)) (v_ArrVal_13619 (Array Int Int))) (<= 0 (+ |c_ULTIMATE.start_main_~j~0#1| 2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_13617) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_13618) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_13619) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))))) is different from false [2024-11-28 05:02:25,698 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (and (forall ((v_ArrVal_13620 (Array Int Int)) (v_ArrVal_13617 (Array Int Int)) (v_ArrVal_13618 (Array Int Int)) (v_ArrVal_13619 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_13618))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ 3 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_13617) .cse1 v_ArrVal_13619) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_13620) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) (forall ((v_ArrVal_13617 (Array Int Int)) (v_ArrVal_13618 (Array Int Int)) (v_ArrVal_13619 (Array Int Int))) (<= 0 (+ 2 (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_13617) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_13618) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_13619) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))))))) is different from false [2024-11-28 05:02:25,756 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~4#1|) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (and (forall ((v_ArrVal_13615 (Array Int Int)) (v_ArrVal_13616 (Array Int Int)) (v_ArrVal_13617 (Array Int Int)) (v_ArrVal_13618 (Array Int Int)) (v_ArrVal_13619 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem360#1.base| v_ArrVal_13615))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem360#1.base| v_ArrVal_13616) .cse0 v_ArrVal_13617) (select (select (store .cse1 .cse0 v_ArrVal_13618) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_13619))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 2))) (forall ((v_ArrVal_13620 (Array Int Int)) (v_ArrVal_13615 (Array Int Int)) (v_ArrVal_13616 (Array Int Int)) (v_ArrVal_13617 (Array Int Int)) (v_ArrVal_13618 (Array Int Int)) (v_ArrVal_13619 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem360#1.base| v_ArrVal_13615))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_13618))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem360#1.base| v_ArrVal_13616) .cse3 v_ArrVal_13617) .cse4 v_ArrVal_13619) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) 3) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_13620) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))))) is different from false [2024-11-28 05:02:28,212 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:02:28,212 INFO L378 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 417 treesize of output 418 [2024-11-28 05:02:28,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:02:28,234 INFO L378 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 405 treesize of output 238 [2024-11-28 05:02:28,304 INFO L378 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 4083524 treesize of output 3368524 [2024-11-28 05:02:29,890 INFO L378 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 438011 treesize of output 430707 [2024-11-28 05:02:30,340 INFO L378 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 9859 treesize of output 8299 [2024-11-28 05:02:30,393 INFO L378 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 8299 treesize of output 6811 [2024-11-28 05:02:30,450 INFO L378 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 6811 treesize of output 6211 [2024-11-28 05:02:30,499 INFO L378 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 6211 treesize of output 5923 [2024-11-28 05:02:30,545 INFO L378 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 5923 treesize of output 5731 [2024-11-28 05:02:30,596 INFO L378 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 5731 treesize of output 5539 [2024-11-28 05:02:30,701 INFO L378 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 5539 treesize of output 4555 [2024-11-28 05:02:30,744 INFO L378 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 4555 treesize of output 4459 [2024-11-28 05:02:31,170 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:02:31,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 211 [2024-11-28 05:02:31,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 05:02:31,195 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 198 treesize of output 127 [2024-11-28 05:02:31,202 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:02:31,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1056 treesize of output 680 [2024-11-28 05:02:31,222 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:02:31,223 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 05:02:31,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2024-11-28 05:02:31,712 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 05:02:31,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-28 05:02:31,734 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 190 trivial. 12 not checked. [2024-11-28 05:02:31,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863527581] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 05:02:31,734 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 05:02:31,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 16] total 38 [2024-11-28 05:02:31,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230052274] [2024-11-28 05:02:31,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 05:02:31,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-28 05:02:31,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 05:02:31,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-28 05:02:31,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=889, Unknown=30, NotChecked=402, Total=1482 [2024-11-28 05:02:31,737 INFO L87 Difference]: Start difference. First operand 3141 states and 5241 transitions. Second operand has 39 states, 38 states have (on average 2.3947368421052633) internal successors, (91), 39 states have internal predecessors, (91), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-28 05:02:35,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 05:02:39,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 05:02:43,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 05:02:47,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-28 05:02:51,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 05:02:55,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-28 05:02:59,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Real, Int], hasArrays=true, hasNonlinArith=false, quantifiers []